/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/safe025_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:17:19,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:17:19,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:17:19,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:17:19,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:17:19,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:17:19,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:17:19,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:17:19,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:17:19,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:17:19,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:17:19,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:17:19,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:17:19,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:17:19,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:17:19,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:17:19,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:17:19,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:17:19,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:17:19,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:17:19,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:17:19,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:17:19,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:17:19,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:17:19,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:17:19,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:17:19,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:17:19,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:17:19,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:17:19,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:17:19,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:17:19,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:17:19,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:17:19,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:17:19,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:17:19,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:17:19,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:17:19,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:17:19,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:17:19,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:17:19,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:17:19,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:17:19,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:17:19,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:17:19,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:17:19,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:17:19,217 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:17:19,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:17:19,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:17:19,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:17:19,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:17:19,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:17:19,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:17:19,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:17:19,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:17:19,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:17:19,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:17:19,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:17:19,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:17:19,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:17:19,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:17:19,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:17:19,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:17:19,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:17:19,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:17:19,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:17:19,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:17:19,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:17:19,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:17:19,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:17:19,221 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-13 03:17:19,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:17:19,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:17:19,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:17:19,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:17:19,507 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:17:19,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 03:17:20,657 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:17:20,859 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:17:20,860 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 03:17:20,871 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d8ab254/a6acb3f9514848c289d8721710a9afc0/FLAG172733cdd [2022-12-13 03:17:20,881 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d8ab254/a6acb3f9514848c289d8721710a9afc0 [2022-12-13 03:17:20,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:17:20,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:17:20,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:17:20,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:17:20,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:17:20,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:17:20" (1/1) ... [2022-12-13 03:17:20,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8d2fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:20, skipping insertion in model container [2022-12-13 03:17:20,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:17:20" (1/1) ... [2022-12-13 03:17:20,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:17:20,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:17:21,068 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/safe025_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 03:17:21,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:17:21,308 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:17:21,324 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/safe025_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 03:17:21,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:17:21,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:17:21,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:17:21,440 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:17:21,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21 WrapperNode [2022-12-13 03:17:21,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:17:21,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:17:21,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:17:21,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:17:21,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,505 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-13 03:17:21,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:17:21,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:17:21,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:17:21,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:17:21,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,535 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:17:21,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:17:21,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:17:21,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:17:21,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (1/1) ... [2022-12-13 03:17:21,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:17:21,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:17:21,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:17:21,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:17:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:17:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:17:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:17:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:17:21,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:17:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:17:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:17:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:17:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:17:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:17:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:17:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:17:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:17:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:17:21,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:17:21,610 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:17:21,760 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:17:21,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:17:22,020 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:17:22,026 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:17:22,027 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:17:22,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:17:22 BoogieIcfgContainer [2022-12-13 03:17:22,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:17:22,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:17:22,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:17:22,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:17:22,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:17:20" (1/3) ... [2022-12-13 03:17:22,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e7cd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:17:22, skipping insertion in model container [2022-12-13 03:17:22,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:17:21" (2/3) ... [2022-12-13 03:17:22,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e7cd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:17:22, skipping insertion in model container [2022-12-13 03:17:22,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:17:22" (3/3) ... [2022-12-13 03:17:22,037 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 03:17:22,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:17:22,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:17:22,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:17:22,111 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:17:22,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 03:17:22,198 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-13 03:17:22,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:17:22,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 03:17:22,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 03:17:22,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-13 03:17:22,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:22,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 03:17:22,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-13 03:17:22,268 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-13 03:17:22,269 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:17:22,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 03:17:22,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 03:17:22,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 03:17:24,258 INFO L241 LiptonReduction]: Total number of compositions: 53 [2022-12-13 03:17:24,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:17:24,276 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;@206add5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:17:24,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:17:24,280 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-13 03:17:24,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:17:24,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:24,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:24,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:24,288 INFO L85 PathProgramCache]: Analyzing trace with hash 254003369, now seen corresponding path program 1 times [2022-12-13 03:17:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:24,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93695941] [2022-12-13 03:17:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:24,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93695941] [2022-12-13 03:17:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93695941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:24,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:24,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:17:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708259899] [2022-12-13 03:17:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:24,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:17:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:17:24,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:17:24,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:24,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:24,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:24,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:24,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:25,039 INFO L130 PetriNetUnfolder]: 1234/2043 cut-off events. [2022-12-13 03:17:25,040 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 03:17:25,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4037 conditions, 2043 events. 1234/2043 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11011 event pairs, 414 based on Foata normal form. 87/1708 useless extension candidates. Maximal degree in co-relation 4026. Up to 1164 conditions per place. [2022-12-13 03:17:25,064 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 29 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2022-12-13 03:17:25,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 164 flow [2022-12-13 03:17:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:17:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:17:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 03:17:25,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2022-12-13 03:17:25,080 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 03:17:25,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 41 transitions, 164 flow [2022-12-13 03:17:25,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 41 transitions, 164 flow [2022-12-13 03:17:25,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:25,108 INFO L89 Accepts]: Start accepts. Operand has 38 places, 41 transitions, 164 flow [2022-12-13 03:17:25,111 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:25,111 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:25,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 41 transitions, 164 flow [2022-12-13 03:17:25,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 41 transitions, 164 flow [2022-12-13 03:17:25,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 03:17:25,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:17:25,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 03:17:25,292 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 41 transitions, 164 flow [2022-12-13 03:17:25,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:25,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:25,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:17:25,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash -715831111, now seen corresponding path program 1 times [2022-12-13 03:17:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:25,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738402916] [2022-12-13 03:17:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:25,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:25,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738402916] [2022-12-13 03:17:25,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738402916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:25,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:25,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:25,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045839449] [2022-12-13 03:17:25,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:25,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:25,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:25,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:25,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 41 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:25,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:25,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:25,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:25,648 INFO L130 PetriNetUnfolder]: 1132/1931 cut-off events. [2022-12-13 03:17:25,648 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 03:17:25,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 1931 events. 1132/1931 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10719 event pairs, 237 based on Foata normal form. 40/1567 useless extension candidates. Maximal degree in co-relation 5537. Up to 1084 conditions per place. [2022-12-13 03:17:25,659 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 46 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2022-12-13 03:17:25,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 345 flow [2022-12-13 03:17:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 03:17:25,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-13 03:17:25,663 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 03:17:25,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 59 transitions, 345 flow [2022-12-13 03:17:25,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 59 transitions, 345 flow [2022-12-13 03:17:25,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:25,682 INFO L89 Accepts]: Start accepts. Operand has 41 places, 59 transitions, 345 flow [2022-12-13 03:17:25,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:25,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:25,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 59 transitions, 345 flow [2022-12-13 03:17:25,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 59 transitions, 345 flow [2022-12-13 03:17:25,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-13 03:17:25,778 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:17:25,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 03:17:25,781 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 59 transitions, 349 flow [2022-12-13 03:17:25,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:25,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:25,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:25,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:17:25,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash -715916333, now seen corresponding path program 1 times [2022-12-13 03:17:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:25,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607647993] [2022-12-13 03:17:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:25,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607647993] [2022-12-13 03:17:25,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607647993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:25,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:25,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578878650] [2022-12-13 03:17:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:25,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:25,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 03:17:25,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 59 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:25,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:25,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 03:17:25,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:26,077 INFO L130 PetriNetUnfolder]: 998/1750 cut-off events. [2022-12-13 03:17:26,078 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 03:17:26,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6664 conditions, 1750 events. 998/1750 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9809 event pairs, 80 based on Foata normal form. 30/1390 useless extension candidates. Maximal degree in co-relation 6647. Up to 1011 conditions per place. [2022-12-13 03:17:26,088 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 59 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2022-12-13 03:17:26,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 75 transitions, 579 flow [2022-12-13 03:17:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 03:17:26,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2022-12-13 03:17:26,098 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 03:17:26,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 75 transitions, 579 flow [2022-12-13 03:17:26,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 75 transitions, 579 flow [2022-12-13 03:17:26,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:26,121 INFO L89 Accepts]: Start accepts. Operand has 44 places, 75 transitions, 579 flow [2022-12-13 03:17:26,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:26,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:26,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 75 transitions, 579 flow [2022-12-13 03:17:26,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 75 transitions, 579 flow [2022-12-13 03:17:26,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-13 03:17:26,130 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:26,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:17:26,131 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 75 transitions, 579 flow [2022-12-13 03:17:26,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:26,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:26,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:17:26,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash -715915465, now seen corresponding path program 1 times [2022-12-13 03:17:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:26,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679932471] [2022-12-13 03:17:26,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:26,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679932471] [2022-12-13 03:17:26,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679932471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:26,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:26,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:17:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465912255] [2022-12-13 03:17:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:26,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:26,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:26,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:26,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 75 transitions, 579 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:26,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:26,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:26,385 INFO L130 PetriNetUnfolder]: 910/1641 cut-off events. [2022-12-13 03:17:26,385 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 03:17:26,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7685 conditions, 1641 events. 910/1641 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9356 event pairs, 65 based on Foata normal form. 40/1307 useless extension candidates. Maximal degree in co-relation 7665. Up to 909 conditions per place. [2022-12-13 03:17:26,395 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 72 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2022-12-13 03:17:26,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 92 transitions, 890 flow [2022-12-13 03:17:26,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 03:17:26,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-13 03:17:26,397 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-13 03:17:26,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 92 transitions, 890 flow [2022-12-13 03:17:26,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 92 transitions, 890 flow [2022-12-13 03:17:26,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:26,415 INFO L89 Accepts]: Start accepts. Operand has 47 places, 92 transitions, 890 flow [2022-12-13 03:17:26,416 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:26,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:26,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 92 transitions, 890 flow [2022-12-13 03:17:26,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 92 transitions, 890 flow [2022-12-13 03:17:26,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 03:17:26,420 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:26,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:17:26,421 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 92 transitions, 890 flow [2022-12-13 03:17:26,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:26,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:26,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:17:26,421 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash -718570801, now seen corresponding path program 1 times [2022-12-13 03:17:26,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:26,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657910337] [2022-12-13 03:17:26,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:26,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657910337] [2022-12-13 03:17:26,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657910337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:26,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:26,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:26,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509323530] [2022-12-13 03:17:26,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:26,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:26,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:26,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:26,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 92 transitions, 890 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:26,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:26,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:26,804 INFO L130 PetriNetUnfolder]: 1718/2885 cut-off events. [2022-12-13 03:17:26,804 INFO L131 PetriNetUnfolder]: For 2694/2829 co-relation queries the response was YES. [2022-12-13 03:17:26,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14838 conditions, 2885 events. 1718/2885 cut-off events. For 2694/2829 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 17497 event pairs, 226 based on Foata normal form. 140/2402 useless extension candidates. Maximal degree in co-relation 14815. Up to 1694 conditions per place. [2022-12-13 03:17:26,820 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 90 selfloop transitions, 44 changer transitions 110/263 dead transitions. [2022-12-13 03:17:26,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 263 transitions, 3031 flow [2022-12-13 03:17:26,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:17:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:17:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 03:17:26,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-12-13 03:17:26,824 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-13 03:17:26,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 263 transitions, 3031 flow [2022-12-13 03:17:26,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 153 transitions, 1759 flow [2022-12-13 03:17:26,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:26,855 INFO L89 Accepts]: Start accepts. Operand has 49 places, 153 transitions, 1759 flow [2022-12-13 03:17:26,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:26,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:26,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 153 transitions, 1759 flow [2022-12-13 03:17:26,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 153 transitions, 1759 flow [2022-12-13 03:17:26,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 03:17:26,864 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:26,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:17:26,864 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 153 transitions, 1759 flow [2022-12-13 03:17:26,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:26,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:26,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:17:26,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:26,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash -746578053, now seen corresponding path program 1 times [2022-12-13 03:17:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:26,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108672157] [2022-12-13 03:17:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:26,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108672157] [2022-12-13 03:17:26,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108672157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:26,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:26,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:17:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389605301] [2022-12-13 03:17:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:26,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:26,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:26,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 153 transitions, 1759 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:26,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:26,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:26,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:27,146 INFO L130 PetriNetUnfolder]: 1055/1810 cut-off events. [2022-12-13 03:17:27,146 INFO L131 PetriNetUnfolder]: For 2360/2590 co-relation queries the response was YES. [2022-12-13 03:17:27,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11006 conditions, 1810 events. 1055/1810 cut-off events. For 2360/2590 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10060 event pairs, 47 based on Foata normal form. 154/1600 useless extension candidates. Maximal degree in co-relation 10980. Up to 1505 conditions per place. [2022-12-13 03:17:27,156 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 73 selfloop transitions, 81 changer transitions 6/179 dead transitions. [2022-12-13 03:17:27,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 179 transitions, 2373 flow [2022-12-13 03:17:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 03:17:27,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2022-12-13 03:17:27,157 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-13 03:17:27,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 179 transitions, 2373 flow [2022-12-13 03:17:27,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 173 transitions, 2289 flow [2022-12-13 03:17:27,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:27,177 INFO L89 Accepts]: Start accepts. Operand has 52 places, 173 transitions, 2289 flow [2022-12-13 03:17:27,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:27,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:27,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 173 transitions, 2289 flow [2022-12-13 03:17:27,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 173 transitions, 2289 flow [2022-12-13 03:17:27,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 03:17:27,183 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:27,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:17:27,184 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 173 transitions, 2289 flow [2022-12-13 03:17:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:27,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:27,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:27,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:17:27,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash -201886480, now seen corresponding path program 1 times [2022-12-13 03:17:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:27,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166284132] [2022-12-13 03:17:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:27,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:27,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166284132] [2022-12-13 03:17:27,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166284132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:27,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:27,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:17:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802003716] [2022-12-13 03:17:27,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:27,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:17:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:27,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:17:27,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:17:27,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:27,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 173 transitions, 2289 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:27,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:27,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:27,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:27,434 INFO L130 PetriNetUnfolder]: 955/1656 cut-off events. [2022-12-13 03:17:27,435 INFO L131 PetriNetUnfolder]: For 3123/3394 co-relation queries the response was YES. [2022-12-13 03:17:27,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11425 conditions, 1656 events. 955/1656 cut-off events. For 3123/3394 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9201 event pairs, 17 based on Foata normal form. 216/1543 useless extension candidates. Maximal degree in co-relation 11396. Up to 1363 conditions per place. [2022-12-13 03:17:27,442 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 62 selfloop transitions, 88 changer transitions 5/174 dead transitions. [2022-12-13 03:17:27,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 174 transitions, 2613 flow [2022-12-13 03:17:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:17:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:17:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-13 03:17:27,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-13 03:17:27,444 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-13 03:17:27,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 174 transitions, 2613 flow [2022-12-13 03:17:27,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 169 transitions, 2533 flow [2022-12-13 03:17:27,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:27,461 INFO L89 Accepts]: Start accepts. Operand has 56 places, 169 transitions, 2533 flow [2022-12-13 03:17:27,462 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:27,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:27,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 169 transitions, 2533 flow [2022-12-13 03:17:27,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 169 transitions, 2533 flow [2022-12-13 03:17:27,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 03:17:27,467 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:27,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:17:27,468 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 169 transitions, 2533 flow [2022-12-13 03:17:27,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:27,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:27,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:27,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:17:27,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash -44705260, now seen corresponding path program 1 times [2022-12-13 03:17:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:27,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835127742] [2022-12-13 03:17:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:27,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:27,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835127742] [2022-12-13 03:17:27,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835127742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:27,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:27,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:17:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105782354] [2022-12-13 03:17:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:27,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:17:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:27,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:17:27,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:17:27,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:27,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 169 transitions, 2533 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:27,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:27,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:27,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:27,723 INFO L130 PetriNetUnfolder]: 813/1524 cut-off events. [2022-12-13 03:17:27,723 INFO L131 PetriNetUnfolder]: For 3995/4252 co-relation queries the response was YES. [2022-12-13 03:17:27,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11770 conditions, 1524 events. 813/1524 cut-off events. For 3995/4252 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9059 event pairs, 14 based on Foata normal form. 198/1429 useless extension candidates. Maximal degree in co-relation 11738. Up to 1231 conditions per place. [2022-12-13 03:17:27,731 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 68 selfloop transitions, 79 changer transitions 43/209 dead transitions. [2022-12-13 03:17:27,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 209 transitions, 3505 flow [2022-12-13 03:17:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:17:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:17:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 03:17:27,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-13 03:17:27,734 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-13 03:17:27,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 209 transitions, 3505 flow [2022-12-13 03:17:27,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 166 transitions, 2779 flow [2022-12-13 03:17:27,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:27,781 INFO L89 Accepts]: Start accepts. Operand has 59 places, 166 transitions, 2779 flow [2022-12-13 03:17:27,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:27,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:27,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 166 transitions, 2779 flow [2022-12-13 03:17:27,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 166 transitions, 2779 flow [2022-12-13 03:17:27,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 03:17:27,787 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:27,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:17:27,788 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 166 transitions, 2779 flow [2022-12-13 03:17:27,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:27,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:27,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:27,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:17:27,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1311068019, now seen corresponding path program 1 times [2022-12-13 03:17:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:27,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616961838] [2022-12-13 03:17:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:27,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616961838] [2022-12-13 03:17:27,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616961838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:27,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:27,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:17:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242560327] [2022-12-13 03:17:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:27,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:17:27,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:17:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:17:27,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:27,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 166 transitions, 2779 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:27,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:27,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:27,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:28,082 INFO L130 PetriNetUnfolder]: 781/1419 cut-off events. [2022-12-13 03:17:28,082 INFO L131 PetriNetUnfolder]: For 4399/4532 co-relation queries the response was YES. [2022-12-13 03:17:28,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12127 conditions, 1419 events. 781/1419 cut-off events. For 4399/4532 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8085 event pairs, 0 based on Foata normal form. 47/1173 useless extension candidates. Maximal degree in co-relation 12092. Up to 1158 conditions per place. [2022-12-13 03:17:28,090 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 109 selfloop transitions, 26 changer transitions 91/238 dead transitions. [2022-12-13 03:17:28,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 238 transitions, 4454 flow [2022-12-13 03:17:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:17:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:17:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 03:17:28,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6370370370370371 [2022-12-13 03:17:28,093 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-13 03:17:28,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 238 transitions, 4454 flow [2022-12-13 03:17:28,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 147 transitions, 2698 flow [2022-12-13 03:17:28,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:28,114 INFO L89 Accepts]: Start accepts. Operand has 63 places, 147 transitions, 2698 flow [2022-12-13 03:17:28,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:28,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:28,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 147 transitions, 2698 flow [2022-12-13 03:17:28,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 147 transitions, 2698 flow [2022-12-13 03:17:28,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-13 03:17:28,124 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:28,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:17:28,125 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 147 transitions, 2698 flow [2022-12-13 03:17:28,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:28,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:28,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:28,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:17:28,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash -75349453, now seen corresponding path program 1 times [2022-12-13 03:17:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:28,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177798519] [2022-12-13 03:17:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177798519] [2022-12-13 03:17:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177798519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:28,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:28,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:17:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713767949] [2022-12-13 03:17:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:28,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:17:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:17:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:17:28,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:17:28,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 147 transitions, 2698 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:28,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:28,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:17:28,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:28,440 INFO L130 PetriNetUnfolder]: 512/1001 cut-off events. [2022-12-13 03:17:28,440 INFO L131 PetriNetUnfolder]: For 3479/3561 co-relation queries the response was YES. [2022-12-13 03:17:28,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 1001 events. 512/1001 cut-off events. For 3479/3561 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5721 event pairs, 0 based on Foata normal form. 42/816 useless extension candidates. Maximal degree in co-relation 9311. Up to 816 conditions per place. [2022-12-13 03:17:28,448 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 96 selfloop transitions, 19 changer transitions 66/192 dead transitions. [2022-12-13 03:17:28,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 192 transitions, 3918 flow [2022-12-13 03:17:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:17:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:17:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-13 03:17:28,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 03:17:28,450 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2022-12-13 03:17:28,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 192 transitions, 3918 flow [2022-12-13 03:17:28,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 126 transitions, 2541 flow [2022-12-13 03:17:28,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:17:28,469 INFO L89 Accepts]: Start accepts. Operand has 65 places, 126 transitions, 2541 flow [2022-12-13 03:17:28,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:17:28,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:28,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 126 transitions, 2541 flow [2022-12-13 03:17:28,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 126 transitions, 2541 flow [2022-12-13 03:17:28,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 03:17:28,476 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:28,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:17:28,477 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 126 transitions, 2541 flow [2022-12-13 03:17:28,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:28,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:17:28,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:28,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:17:28,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:17:28,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:17:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash -19447149, now seen corresponding path program 2 times [2022-12-13 03:17:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:17:28,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152060935] [2022-12-13 03:17:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:17:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:17:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:17:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:17:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:17:28,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152060935] [2022-12-13 03:17:28,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152060935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:17:28,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:17:28,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:17:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523632253] [2022-12-13 03:17:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:17:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:17:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:17:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:17:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:17:28,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 03:17:28,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 126 transitions, 2541 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:28,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:17:28,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 03:17:28,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:17:28,683 INFO L130 PetriNetUnfolder]: 269/560 cut-off events. [2022-12-13 03:17:28,683 INFO L131 PetriNetUnfolder]: For 2566/2603 co-relation queries the response was YES. [2022-12-13 03:17:28,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5658 conditions, 560 events. 269/560 cut-off events. For 2566/2603 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2867 event pairs, 0 based on Foata normal form. 68/502 useless extension candidates. Maximal degree in co-relation 5617. Up to 447 conditions per place. [2022-12-13 03:17:28,686 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 0 selfloop transitions, 0 changer transitions 123/123 dead transitions. [2022-12-13 03:17:28,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 123 transitions, 2699 flow [2022-12-13 03:17:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:17:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:17:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 03:17:28,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-13 03:17:28,688 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2022-12-13 03:17:28,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 123 transitions, 2699 flow [2022-12-13 03:17:28,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:17:28,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:17:28,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:17:28,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:17:28,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:17:28,695 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:17:28,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 03:17:28,696 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:17:28,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:17:28,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:17:28,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:17:28,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:17:28,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:17:28,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:17:28,705 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:17:28,720 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:17:28,720 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:17:28,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:17:28 BasicIcfg [2022-12-13 03:17:28,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:17:28,722 INFO L158 Benchmark]: Toolchain (without parser) took 7838.18ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 143.5MB in the beginning and 222.4MB in the end (delta: -78.9MB). Peak memory consumption was 124.6MB. Max. memory is 8.0GB. [2022-12-13 03:17:28,722 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 89.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:17:28,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.75ms. Allocated memory is still 186.6MB. Free memory was 143.5MB in the beginning and 119.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 03:17:28,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.28ms. Allocated memory is still 186.6MB. Free memory was 119.9MB in the beginning and 118.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:17:28,723 INFO L158 Benchmark]: Boogie Preprocessor took 31.04ms. Allocated memory is still 186.6MB. Free memory was 118.2MB in the beginning and 116.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:17:28,723 INFO L158 Benchmark]: RCFGBuilder took 490.35ms. Allocated memory is still 186.6MB. Free memory was 116.2MB in the beginning and 102.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 03:17:28,723 INFO L158 Benchmark]: TraceAbstraction took 6691.65ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 101.6MB in the beginning and 222.4MB in the end (delta: -120.8MB). Peak memory consumption was 82.6MB. Max. memory is 8.0GB. [2022-12-13 03:17:28,724 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.12ms. Allocated memory is still 186.6MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 89.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 555.75ms. Allocated memory is still 186.6MB. Free memory was 143.5MB in the beginning and 119.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.28ms. Allocated memory is still 186.6MB. Free memory was 119.9MB in the beginning and 118.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.04ms. Allocated memory is still 186.6MB. Free memory was 118.2MB in the beginning and 116.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 490.35ms. Allocated memory is still 186.6MB. Free memory was 116.2MB in the beginning and 102.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6691.65ms. Allocated memory was 186.6MB in the beginning and 389.0MB in the end (delta: 202.4MB). Free memory was 101.6MB in the beginning and 222.4MB in the end (delta: -120.8MB). Peak memory consumption was 82.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 79 PlacesBefore, 36 PlacesAfterwards, 70 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 971, independent: 911, independent conditional: 911, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 971, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 971, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 971, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 770, independent: 731, independent conditional: 0, independent unconditional: 731, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 770, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 971, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 770, unknown conditional: 0, unknown unconditional: 770] , Statistics on independence cache: Total cache size (in pairs): 1103, Positive cache size: 1064, Positive conditional cache size: 0, Positive unconditional cache size: 1064, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, 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.2s, 38 PlacesBefore, 38 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 352 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 392 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 153 TransitionsBefore, 153 TransitionsAfterwards, 298 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 300 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 298 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 292 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 212 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 160 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): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 4 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: 6.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 22 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2779occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:17:28,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...