/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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:18:37,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:18:37,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:18:37,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:18:37,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:18:37,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:18:37,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:18:37,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:18:37,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:18:37,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:18:37,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:18:37,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:18:37,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:18:37,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:18:37,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:18:37,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:18:37,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:18:37,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:18:37,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:18:37,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:18:37,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:18:37,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:18:37,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:18:37,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:18:37,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:18:37,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:18:37,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:18:37,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:18:37,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:18:37,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:18:37,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:18:37,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:18:37,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:18:37,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:18:37,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:18:37,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:18:37,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:18:37,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:18:37,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:18:37,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:18:37,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:18:37,627 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:18:37,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:18:37,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:18:37,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:18:37,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:18:37,668 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:18:37,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:18:37,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:18:37,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:18:37,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:18:37,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:18:37,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:18:37,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:18:37,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:18:37,670 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:18:37,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:18:37,670 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:18:37,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:18:37,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:18:37,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:18:37,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:18:37,672 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:18:37,672 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:18:37,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:18:37,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:18:37,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:18:37,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:18:37,940 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:18:37,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 03:18:38,889 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:18:39,158 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:18:39,159 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 03:18:39,175 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f663265a9/485c1eda693f40519f961c304ec4b91d/FLAGe520b36a7 [2022-12-13 03:18:39,185 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f663265a9/485c1eda693f40519f961c304ec4b91d [2022-12-13 03:18:39,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:18:39,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:18:39,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:18:39,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:18:39,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:18:39,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32329fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39, skipping insertion in model container [2022-12-13 03:18:39,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:18:39,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:18:39,312 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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i[992,1005] [2022-12-13 03:18:39,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:18:39,448 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:18:39,457 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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i[992,1005] [2022-12-13 03:18:39,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:18:39,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:18:39,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:18:39,529 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:18:39,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39 WrapperNode [2022-12-13 03:18:39,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:18:39,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:18:39,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:18:39,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:18:39,535 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:18:39" (1/1) ... [2022-12-13 03:18:39,547 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:18:39" (1/1) ... [2022-12-13 03:18:39,561 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-13 03:18:39,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:18:39,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:18:39,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:18:39,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:18:39,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,585 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:18:39,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:18:39,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:18:39,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:18:39,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (1/1) ... [2022-12-13 03:18:39,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:18:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:18:39,626 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:18:39,642 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:18:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:18:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:18:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:18:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:18:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:18:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:18:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:18:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:18:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:18:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:18:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:18:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:18:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:18:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:18:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:18:39,655 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:18:39,747 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:18:39,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:18:39,905 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:18:39,910 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:18:39,911 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:18:39,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:18:39 BoogieIcfgContainer [2022-12-13 03:18:39,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:18:39,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:18:39,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:18:39,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:18:39,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:18:39" (1/3) ... [2022-12-13 03:18:39,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd5da25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:18:39, skipping insertion in model container [2022-12-13 03:18:39,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:39" (2/3) ... [2022-12-13 03:18:39,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd5da25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:18:39, skipping insertion in model container [2022-12-13 03:18:39,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:18:39" (3/3) ... [2022-12-13 03:18:39,919 INFO L112 eAbstractionObserver]: Analyzing ICFG safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 03:18:39,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:18:39,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:18:39,934 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:18:39,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:18:40,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 03:18:40,075 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-13 03:18:40,076 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:18:40,080 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 48 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:18:40,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 03:18:40,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-13 03:18:40,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:40,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 03:18:40,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-13 03:18:40,151 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-13 03:18:40,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:18:40,152 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 39 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:18:40,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 03:18:40,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 03:18:42,020 INFO L241 LiptonReduction]: Total number of compositions: 53 [2022-12-13 03:18:42,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:18:42,037 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;@ef16990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:18:42,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:18:42,045 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-13 03:18:42,046 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:18:42,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:42,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:42,055 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:18:42,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2007099196, now seen corresponding path program 1 times [2022-12-13 03:18:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754689666] [2022-12-13 03:18:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:42,488 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:18:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:42,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754689666] [2022-12-13 03:18:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754689666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:42,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:42,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:18:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265735281] [2022-12-13 03:18:42,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:42,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:18:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:18:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:18:42,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:18:42,515 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:18:42,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:42,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:18:42,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:42,718 INFO L130 PetriNetUnfolder]: 1288/2134 cut-off events. [2022-12-13 03:18:42,718 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 03:18:42,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 2134 events. 1288/2134 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12078 event pairs, 447 based on Foata normal form. 117/1811 useless extension candidates. Maximal degree in co-relation 4213. Up to 1029 conditions per place. [2022-12-13 03:18:42,733 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 30 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2022-12-13 03:18:42,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 171 flow [2022-12-13 03:18:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:18:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:18:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 03:18:42,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-12-13 03:18:42,745 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 03:18:42,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 42 transitions, 171 flow [2022-12-13 03:18:42,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 42 transitions, 171 flow [2022-12-13 03:18:42,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:42,762 INFO L89 Accepts]: Start accepts. Operand has 38 places, 42 transitions, 171 flow [2022-12-13 03:18:42,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:42,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:42,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 42 transitions, 171 flow [2022-12-13 03:18:42,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 171 flow [2022-12-13 03:18:42,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-13 03:18:42,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:18:42,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 03:18:42,906 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 42 transitions, 171 flow [2022-12-13 03:18:42,906 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:18:42,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:42,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:42,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:18:42,909 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:18:42,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:42,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2090531422, now seen corresponding path program 1 times [2022-12-13 03:18:42,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:42,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128795827] [2022-12-13 03:18:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:42,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:43,070 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:18:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:43,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128795827] [2022-12-13 03:18:43,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128795827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:43,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:43,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:18:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813626199] [2022-12-13 03:18:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:43,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:18:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:18:43,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:18:43,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2022-12-13 03:18:43,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 42 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:43,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:43,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2022-12-13 03:18:43,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:43,216 INFO L130 PetriNetUnfolder]: 1064/1810 cut-off events. [2022-12-13 03:18:43,216 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-13 03:18:43,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1810 events. 1064/1810 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9879 event pairs, 209 based on Foata normal form. 80/1498 useless extension candidates. Maximal degree in co-relation 5004. Up to 950 conditions per place. [2022-12-13 03:18:43,225 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 37 selfloop transitions, 3 changer transitions 4/54 dead transitions. [2022-12-13 03:18:43,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 307 flow [2022-12-13 03:18:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:18:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:18:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 03:18:43,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2022-12-13 03:18:43,228 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-13 03:18:43,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 54 transitions, 307 flow [2022-12-13 03:18:43,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 50 transitions, 283 flow [2022-12-13 03:18:43,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:43,242 INFO L89 Accepts]: Start accepts. Operand has 40 places, 50 transitions, 283 flow [2022-12-13 03:18:43,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:43,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:43,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 50 transitions, 283 flow [2022-12-13 03:18:43,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 50 transitions, 283 flow [2022-12-13 03:18:43,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 03:18:43,251 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:43,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:18:43,253 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 50 transitions, 283 flow [2022-12-13 03:18:43,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:43,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:43,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:43,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:18:43,254 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:18:43,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1043013231, now seen corresponding path program 1 times [2022-12-13 03:18:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:43,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469741286] [2022-12-13 03:18:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:43,353 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:18:43,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:43,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469741286] [2022-12-13 03:18:43,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469741286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:43,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:43,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:43,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617733005] [2022-12-13 03:18:43,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:43,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:43,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:43,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:18:43,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 50 transitions, 283 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:18:43,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:43,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:18:43,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:43,645 INFO L130 PetriNetUnfolder]: 1898/3124 cut-off events. [2022-12-13 03:18:43,646 INFO L131 PetriNetUnfolder]: For 1573/1600 co-relation queries the response was YES. [2022-12-13 03:18:43,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10544 conditions, 3124 events. 1898/3124 cut-off events. For 1573/1600 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 18739 event pairs, 348 based on Foata normal form. 149/2672 useless extension candidates. Maximal degree in co-relation 10527. Up to 1935 conditions per place. [2022-12-13 03:18:43,659 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 46 selfloop transitions, 18 changer transitions 66/139 dead transitions. [2022-12-13 03:18:43,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 139 transitions, 1050 flow [2022-12-13 03:18:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:18:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:18:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 03:18:43,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-12-13 03:18:43,661 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 03:18:43,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 139 transitions, 1050 flow [2022-12-13 03:18:43,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 73 transitions, 543 flow [2022-12-13 03:18:43,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:43,686 INFO L89 Accepts]: Start accepts. Operand has 42 places, 73 transitions, 543 flow [2022-12-13 03:18:43,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:43,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:43,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 73 transitions, 543 flow [2022-12-13 03:18:43,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 73 transitions, 543 flow [2022-12-13 03:18:43,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-13 03:18:43,691 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:43,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:18:43,692 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 73 transitions, 543 flow [2022-12-13 03:18:43,692 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:18:43,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:43,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:43,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:18:43,692 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:18:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1057273785, now seen corresponding path program 1 times [2022-12-13 03:18:43,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:43,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564900503] [2022-12-13 03:18:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:43,788 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:18:43,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:43,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564900503] [2022-12-13 03:18:43,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564900503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:43,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:43,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:18:43,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938070844] [2022-12-13 03:18:43,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:43,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:43,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:43,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:43,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:43,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:18:43,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 73 transitions, 543 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:18:43,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:43,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:18:43,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:43,966 INFO L130 PetriNetUnfolder]: 1274/2136 cut-off events. [2022-12-13 03:18:43,967 INFO L131 PetriNetUnfolder]: For 1696/1793 co-relation queries the response was YES. [2022-12-13 03:18:43,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9103 conditions, 2136 events. 1274/2136 cut-off events. For 1696/1793 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 12092 event pairs, 85 based on Foata normal form. 103/1855 useless extension candidates. Maximal degree in co-relation 9083. Up to 1766 conditions per place. [2022-12-13 03:18:43,982 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 48 selfloop transitions, 33 changer transitions 10/100 dead transitions. [2022-12-13 03:18:43,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 100 transitions, 935 flow [2022-12-13 03:18:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 03:18:43,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-12-13 03:18:43,987 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-13 03:18:43,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 100 transitions, 935 flow [2022-12-13 03:18:43,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 90 transitions, 829 flow [2022-12-13 03:18:44,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:44,007 INFO L89 Accepts]: Start accepts. Operand has 45 places, 90 transitions, 829 flow [2022-12-13 03:18:44,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:44,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:44,009 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 90 transitions, 829 flow [2022-12-13 03:18:44,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 90 transitions, 829 flow [2022-12-13 03:18:44,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 03:18:44,012 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:44,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:18:44,017 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 90 transitions, 829 flow [2022-12-13 03:18:44,017 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:18:44,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:44,019 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:44,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:18:44,020 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:18:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1584037018, now seen corresponding path program 1 times [2022-12-13 03:18:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:44,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266933636] [2022-12-13 03:18:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:44,124 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:18:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266933636] [2022-12-13 03:18:44,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266933636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:44,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:44,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:18:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605482452] [2022-12-13 03:18:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:44,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:18:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:18:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:18:44,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:18:44,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 90 transitions, 829 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:18:44,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:44,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:18:44,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:44,324 INFO L130 PetriNetUnfolder]: 1001/1950 cut-off events. [2022-12-13 03:18:44,325 INFO L131 PetriNetUnfolder]: For 2504/2603 co-relation queries the response was YES. [2022-12-13 03:18:44,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9824 conditions, 1950 events. 1001/1950 cut-off events. For 2504/2603 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 13136 event pairs, 121 based on Foata normal form. 174/1778 useless extension candidates. Maximal degree in co-relation 9801. Up to 1580 conditions per place. [2022-12-13 03:18:44,333 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 43 selfloop transitions, 31 changer transitions 42/125 dead transitions. [2022-12-13 03:18:44,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 125 transitions, 1387 flow [2022-12-13 03:18:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:18:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:18:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-13 03:18:44,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 03:18:44,335 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-13 03:18:44,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 125 transitions, 1387 flow [2022-12-13 03:18:44,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 83 transitions, 907 flow [2022-12-13 03:18:44,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:44,351 INFO L89 Accepts]: Start accepts. Operand has 48 places, 83 transitions, 907 flow [2022-12-13 03:18:44,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:44,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:44,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 83 transitions, 907 flow [2022-12-13 03:18:44,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 83 transitions, 907 flow [2022-12-13 03:18:44,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-13 03:18:44,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:44,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:18:44,356 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 83 transitions, 907 flow [2022-12-13 03:18:44,356 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:18:44,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:44,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:44,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:18:44,356 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:18:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2143738164, now seen corresponding path program 1 times [2022-12-13 03:18:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:44,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697108833] [2022-12-13 03:18:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:44,421 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:18:44,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:44,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697108833] [2022-12-13 03:18:44,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697108833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:44,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:44,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:18:44,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389605301] [2022-12-13 03:18:44,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:44,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:44,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:44,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:44,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:44,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 03:18:44,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 83 transitions, 907 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:18:44,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:44,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 03:18:44,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:44,640 INFO L130 PetriNetUnfolder]: 1255/2484 cut-off events. [2022-12-13 03:18:44,640 INFO L131 PetriNetUnfolder]: For 5246/5330 co-relation queries the response was YES. [2022-12-13 03:18:44,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14420 conditions, 2484 events. 1255/2484 cut-off events. For 5246/5330 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 18173 event pairs, 126 based on Foata normal form. 132/2155 useless extension candidates. Maximal degree in co-relation 14394. Up to 2116 conditions per place. [2022-12-13 03:18:44,651 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 98 selfloop transitions, 11 changer transitions 44/167 dead transitions. [2022-12-13 03:18:44,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 167 transitions, 2191 flow [2022-12-13 03:18:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 03:18:44,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-12-13 03:18:44,653 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-13 03:18:44,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 167 transitions, 2191 flow [2022-12-13 03:18:44,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 123 transitions, 1609 flow [2022-12-13 03:18:44,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:44,676 INFO L89 Accepts]: Start accepts. Operand has 50 places, 123 transitions, 1609 flow [2022-12-13 03:18:44,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:44,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:44,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 123 transitions, 1609 flow [2022-12-13 03:18:44,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 123 transitions, 1609 flow [2022-12-13 03:18:44,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-13 03:18:44,742 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:18:44,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 03:18:44,743 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 123 transitions, 1609 flow [2022-12-13 03:18:44,743 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:18:44,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:44,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:44,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:18:44,744 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:18:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1866681864, now seen corresponding path program 2 times [2022-12-13 03:18:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:44,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56424123] [2022-12-13 03:18:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:44,815 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:18:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56424123] [2022-12-13 03:18:44,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56424123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:44,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:44,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:18:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465061368] [2022-12-13 03:18:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:44,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:18:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:18:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:18:44,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 03:18:44,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 123 transitions, 1609 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:18:44,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:44,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 03:18:44,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:45,050 INFO L130 PetriNetUnfolder]: 815/1666 cut-off events. [2022-12-13 03:18:45,050 INFO L131 PetriNetUnfolder]: For 4779/4867 co-relation queries the response was YES. [2022-12-13 03:18:45,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11008 conditions, 1666 events. 815/1666 cut-off events. For 4779/4867 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 11387 event pairs, 39 based on Foata normal form. 147/1531 useless extension candidates. Maximal degree in co-relation 10979. Up to 1382 conditions per place. [2022-12-13 03:18:45,057 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 42 selfloop transitions, 68 changer transitions 9/127 dead transitions. [2022-12-13 03:18:45,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 127 transitions, 1901 flow [2022-12-13 03:18:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:18:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:18:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-13 03:18:45,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161 [2022-12-13 03:18:45,059 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-13 03:18:45,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 127 transitions, 1901 flow [2022-12-13 03:18:45,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 118 transitions, 1767 flow [2022-12-13 03:18:45,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:45,072 INFO L89 Accepts]: Start accepts. Operand has 54 places, 118 transitions, 1767 flow [2022-12-13 03:18:45,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:45,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:45,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 118 transitions, 1767 flow [2022-12-13 03:18:45,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 118 transitions, 1767 flow [2022-12-13 03:18:45,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-13 03:18:45,076 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:45,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:18:45,077 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 118 transitions, 1767 flow [2022-12-13 03:18:45,077 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:18:45,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:45,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:45,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:18:45,077 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:18:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1091432062, now seen corresponding path program 1 times [2022-12-13 03:18:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:45,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98602164] [2022-12-13 03:18:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:45,177 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:18:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:45,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98602164] [2022-12-13 03:18:45,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98602164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:45,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:45,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:18:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563234782] [2022-12-13 03:18:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:45,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:18:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:45,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:18:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:18:45,178 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 03:18:45,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 118 transitions, 1767 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:18:45,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:45,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 03:18:45,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:45,328 INFO L130 PetriNetUnfolder]: 686/1698 cut-off events. [2022-12-13 03:18:45,328 INFO L131 PetriNetUnfolder]: For 6919/7001 co-relation queries the response was YES. [2022-12-13 03:18:45,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11897 conditions, 1698 events. 686/1698 cut-off events. For 6919/7001 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 13768 event pairs, 15 based on Foata normal form. 149/1552 useless extension candidates. Maximal degree in co-relation 11865. Up to 1396 conditions per place. [2022-12-13 03:18:45,333 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 30 selfloop transitions, 4 changer transitions 154/196 dead transitions. [2022-12-13 03:18:45,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 196 transitions, 3374 flow [2022-12-13 03:18:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:18:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:18:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 03:18:45,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-13 03:18:45,334 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-13 03:18:45,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 196 transitions, 3374 flow [2022-12-13 03:18:45,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 681 flow [2022-12-13 03:18:45,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:18:45,345 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 681 flow [2022-12-13 03:18:45,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:18:45,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:45,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 681 flow [2022-12-13 03:18:45,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 681 flow [2022-12-13 03:18:45,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 03:18:45,392 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:18:45,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 03:18:45,393 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 681 flow [2022-12-13 03:18:45,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:18:45,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:18:45,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:45,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:18:45,394 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:18:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:18:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2110198382, now seen corresponding path program 1 times [2022-12-13 03:18:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:18:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932628041] [2022-12-13 03:18:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:18:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:18:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:18:45,497 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:18:45,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:18:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932628041] [2022-12-13 03:18:45,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932628041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:18:45,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:18:45,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:18:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81436451] [2022-12-13 03:18:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:18:45,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:18:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:18:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:18:45,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:18:45,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 03:18:45,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:45,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:18:45,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 03:18:45,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:18:45,561 INFO L130 PetriNetUnfolder]: 33/184 cut-off events. [2022-12-13 03:18:45,561 INFO L131 PetriNetUnfolder]: For 949/949 co-relation queries the response was YES. [2022-12-13 03:18:45,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 184 events. 33/184 cut-off events. For 949/949 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1076 event pairs, 3 based on Foata normal form. 9/161 useless extension candidates. Maximal degree in co-relation 1492. Up to 136 conditions per place. [2022-12-13 03:18:45,561 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2022-12-13 03:18:45,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 809 flow [2022-12-13 03:18:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:18:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:18:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-13 03:18:45,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32653061224489793 [2022-12-13 03:18:45,563 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-12-13 03:18:45,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 45 transitions, 809 flow [2022-12-13 03:18:45,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:45,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:18:45,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:45,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:45,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:18:45,565 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:18:45,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 03:18:45,566 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:18:45,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:18:45,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:18:45,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:18:45,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:18:45,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:18:45,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:18:45,568 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:18:45,570 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:18:45,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:18:45,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:18:45 BasicIcfg [2022-12-13 03:18:45,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:18:45,573 INFO L158 Benchmark]: Toolchain (without parser) took 6385.22ms. Allocated memory was 194.0MB in the beginning and 397.4MB in the end (delta: 203.4MB). Free memory was 167.8MB in the beginning and 315.9MB in the end (delta: -148.1MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. [2022-12-13 03:18:45,573 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory was 169.8MB in the beginning and 169.8MB in the end (delta: 85.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:18:45,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.52ms. Allocated memory is still 194.0MB. Free memory was 167.8MB in the beginning and 143.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 03:18:45,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.80ms. Allocated memory is still 194.0MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:18:45,573 INFO L158 Benchmark]: Boogie Preprocessor took 40.98ms. Allocated memory is still 194.0MB. Free memory was 141.6MB in the beginning and 140.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:18:45,573 INFO L158 Benchmark]: RCFGBuilder took 309.21ms. Allocated memory is still 194.0MB. Free memory was 140.0MB in the beginning and 126.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 03:18:45,574 INFO L158 Benchmark]: TraceAbstraction took 5657.91ms. Allocated memory was 194.0MB in the beginning and 397.4MB in the end (delta: 203.4MB). Free memory was 125.3MB in the beginning and 315.9MB in the end (delta: -190.6MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-12-13 03:18:45,575 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory was 169.8MB in the beginning and 169.8MB in the end (delta: 85.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 341.52ms. Allocated memory is still 194.0MB. Free memory was 167.8MB in the beginning and 143.7MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.80ms. Allocated memory is still 194.0MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.98ms. Allocated memory is still 194.0MB. Free memory was 141.6MB in the beginning and 140.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 309.21ms. Allocated memory is still 194.0MB. Free memory was 140.0MB in the beginning and 126.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5657.91ms. Allocated memory was 194.0MB in the beginning and 397.4MB in the end (delta: 203.4MB). Free memory was 125.3MB in the beginning and 315.9MB in the end (delta: -190.6MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 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: 1140, independent: 1077, independent conditional: 1077, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1140, independent: 1077, independent conditional: 0, independent unconditional: 1077, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1140, independent: 1077, independent conditional: 0, independent unconditional: 1077, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1140, independent: 1077, independent conditional: 0, independent unconditional: 1077, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 888, independent: 849, independent conditional: 0, independent unconditional: 849, 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: 888, independent: 838, independent conditional: 0, independent unconditional: 838, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1140, independent: 228, independent conditional: 0, independent unconditional: 228, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 888, unknown conditional: 0, unknown unconditional: 888] , Statistics on independence cache: Total cache size (in pairs): 1259, Positive cache size: 1220, Positive conditional cache size: 0, Positive unconditional cache size: 1220, 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.1s, 38 PlacesBefore, 38 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 222 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): 7, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 228 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): 7, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 210 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): 7, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 11, Positive conditional cache size: 4, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 218 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): 13, Positive cache size: 11, Positive conditional cache size: 4, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 8, independent unconditional: 1, 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: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 15, Positive conditional cache size: 8, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 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): 17, Positive cache size: 15, Positive conditional cache size: 8, Positive unconditional cache size: 7, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 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: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 6 mSDtfsCounter, 639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1767occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:18:45,593 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...