/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/weaver/parallel-barrier.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:12:32,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:12:32,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:12:32,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:12:32,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:12:32,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:12:32,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:12:32,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:12:32,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:12:32,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:12:32,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:12:32,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:12:32,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:12:32,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:12:32,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:12:32,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:12:32,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:12:32,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:12:32,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:12:32,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:12:32,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:12:32,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:12:32,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:12:32,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:12:32,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:12:32,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:12:32,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:12:32,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:12:32,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:12:32,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:12:32,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:12:32,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:12:32,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:12:32,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:12:32,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:12:32,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:12:32,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:12:32,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:12:32,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:12:32,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:12:32,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:12:32,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:12:32,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:12:32,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:12:32,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:12:32,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:12:32,864 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:12:32,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:12:32,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:12:32,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:12:32,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:12:32,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:12:32,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:12:32,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:12:32,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:12:32,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:12:32,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:12:32,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:12:32,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:12:32,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:12:32,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:12:32,867 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:12:32,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:12:33,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:12:33,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:12:33,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:12:33,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:12:33,121 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:12:33,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier.wvr.c [2022-12-06 02:12:34,086 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:12:34,236 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:12:34,237 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c [2022-12-06 02:12:34,241 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9824d43fe/abc072e4190b4721b06988ef186742e2/FLAG6f530669d [2022-12-06 02:12:34,251 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9824d43fe/abc072e4190b4721b06988ef186742e2 [2022-12-06 02:12:34,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:12:34,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:12:34,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:12:34,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:12:34,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:12:34,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dfde744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34, skipping insertion in model container [2022-12-06 02:12:34,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:12:34,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:12:34,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,397 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c[4722,4735] [2022-12-06 02:12:34,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:12:34,407 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:12:34,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:12:34,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:12:34,433 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c[4722,4735] [2022-12-06 02:12:34,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:12:34,443 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:12:34,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34 WrapperNode [2022-12-06 02:12:34,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:12:34,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:12:34,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:12:34,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:12:34,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,474 INFO L138 Inliner]: procedures = 25, calls = 98, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 253 [2022-12-06 02:12:34,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:12:34,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:12:34,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:12:34,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:12:34,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,492 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:12:34,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:12:34,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:12:34,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:12:34,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (1/1) ... [2022-12-06 02:12:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:12:34,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:12:34,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:12:34,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:12:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:12:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:12:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:12:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:12:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:12:34,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:12:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:12:34,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:12:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:12:34,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:12:34,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 02:12:34,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 02:12:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 02:12:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 02:12:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:12:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:12:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:12:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:12:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:12:34,576 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:12:34,690 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:12:34,691 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:12:34,991 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:12:35,057 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:12:35,057 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 02:12:35,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:12:35 BoogieIcfgContainer [2022-12-06 02:12:35,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:12:35,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:12:35,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:12:35,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:12:35,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:12:34" (1/3) ... [2022-12-06 02:12:35,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e48b408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:12:35, skipping insertion in model container [2022-12-06 02:12:35,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:12:34" (2/3) ... [2022-12-06 02:12:35,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e48b408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:12:35, skipping insertion in model container [2022-12-06 02:12:35,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:12:35" (3/3) ... [2022-12-06 02:12:35,074 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2022-12-06 02:12:35,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:12:35,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:12:35,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:12:35,186 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-12-06 02:12:35,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 224 transitions, 520 flow [2022-12-06 02:12:35,354 INFO L130 PetriNetUnfolder]: 8/196 cut-off events. [2022-12-06 02:12:35,354 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 02:12:35,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 196 events. 8/196 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 168. Up to 3 conditions per place. [2022-12-06 02:12:35,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 224 transitions, 520 flow [2022-12-06 02:12:35,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 188 transitions, 424 flow [2022-12-06 02:12:35,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:12:35,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 188 transitions, 424 flow [2022-12-06 02:12:35,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 188 transitions, 424 flow [2022-12-06 02:12:35,447 INFO L130 PetriNetUnfolder]: 8/188 cut-off events. [2022-12-06 02:12:35,447 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 02:12:35,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 8/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 234 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 168. Up to 3 conditions per place. [2022-12-06 02:12:35,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 188 transitions, 424 flow [2022-12-06 02:12:35,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 7268 [2022-12-06 02:12:39,874 INFO L203 LiptonReduction]: Total number of compositions: 131 [2022-12-06 02:12:39,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:12:39,903 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;@20249642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:12:39,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-12-06 02:12:39,910 INFO L130 PetriNetUnfolder]: 6/64 cut-off events. [2022-12-06 02:12:39,910 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 02:12:39,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:12:39,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:12:39,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:12:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:12:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1625495205, now seen corresponding path program 1 times [2022-12-06 02:12:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:12:39,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297363971] [2022-12-06 02:12:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:12:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:12:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:12:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:12:40,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:12:40,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297363971] [2022-12-06 02:12:40,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297363971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:12:40,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:12:40,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:12:40,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314894716] [2022-12-06 02:12:40,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:12:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 02:12:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:12:40,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 02:12:40,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 02:12:40,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 65 [2022-12-06 02:12:40,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:12:40,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:12:40,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 65 [2022-12-06 02:12:40,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:12:42,175 INFO L130 PetriNetUnfolder]: 19745/26241 cut-off events. [2022-12-06 02:12:42,175 INFO L131 PetriNetUnfolder]: For 3807/3807 co-relation queries the response was YES. [2022-12-06 02:12:42,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56610 conditions, 26241 events. 19745/26241 cut-off events. For 3807/3807 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 135170 event pairs, 18645 based on Foata normal form. 220/24996 useless extension candidates. Maximal degree in co-relation 55869. Up to 25797 conditions per place. [2022-12-06 02:12:42,309 INFO L137 encePairwiseOnDemand]: 63/65 looper letters, 47 selfloop transitions, 0 changer transitions 0/63 dead transitions. [2022-12-06 02:12:42,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 63 transitions, 268 flow [2022-12-06 02:12:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 02:12:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 02:12:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2022-12-06 02:12:42,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2022-12-06 02:12:42,322 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2022-12-06 02:12:42,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:12:42,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 63 transitions, 268 flow [2022-12-06 02:12:42,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 63 transitions, 268 flow [2022-12-06 02:12:42,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 906 [2022-12-06 02:12:42,891 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 02:12:42,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 570 [2022-12-06 02:12:42,892 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 246 flow [2022-12-06 02:12:42,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:12:42,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:12:42,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:12:42,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:12:42,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:12:42,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:12:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1628593678, now seen corresponding path program 1 times [2022-12-06 02:12:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:12:42,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24726156] [2022-12-06 02:12:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:12:42,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:12:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:12:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:12:43,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:12:43,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24726156] [2022-12-06 02:12:43,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24726156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:12:43,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:12:43,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 02:12:43,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653139650] [2022-12-06 02:12:43,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:12:43,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:12:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:12:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:12:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:12:43,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:12:43,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 246 flow. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:12:43,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:12:43,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:12:43,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:12:48,940 INFO L130 PetriNetUnfolder]: 37542/49027 cut-off events. [2022-12-06 02:12:48,940 INFO L131 PetriNetUnfolder]: For 5999/5999 co-relation queries the response was YES. [2022-12-06 02:12:49,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152364 conditions, 49027 events. 37542/49027 cut-off events. For 5999/5999 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 238248 event pairs, 5856 based on Foata normal form. 1/47275 useless extension candidates. Maximal degree in co-relation 150236. Up to 47372 conditions per place. [2022-12-06 02:12:49,185 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 383 selfloop transitions, 124 changer transitions 19/526 dead transitions. [2022-12-06 02:12:49,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 526 transitions, 3417 flow [2022-12-06 02:12:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 02:12:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 02:12:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 527 transitions. [2022-12-06 02:12:49,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36195054945054944 [2022-12-06 02:12:49,193 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 17 predicate places. [2022-12-06 02:12:49,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:12:49,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 526 transitions, 3417 flow [2022-12-06 02:12:49,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 526 transitions, 3417 flow [2022-12-06 02:12:49,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:12:49,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:12:49,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 02:12:49,380 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 526 transitions, 3417 flow [2022-12-06 02:12:49,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:12:49,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:12:49,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:12:49,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:12:49,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:12:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:12:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -960331286, now seen corresponding path program 2 times [2022-12-06 02:12:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:12:49,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647253734] [2022-12-06 02:12:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:12:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:12:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:12:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:12:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:12:49,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647253734] [2022-12-06 02:12:49,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647253734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:12:49,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:12:49,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:12:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145473824] [2022-12-06 02:12:49,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:12:49,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:12:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:12:49,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:12:49,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:12:49,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:12:49,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 526 transitions, 3417 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:12:49,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:12:49,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:12:49,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:12:53,030 INFO L130 PetriNetUnfolder]: 31304/40861 cut-off events. [2022-12-06 02:12:53,031 INFO L131 PetriNetUnfolder]: For 5838/5838 co-relation queries the response was YES. [2022-12-06 02:12:53,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168206 conditions, 40861 events. 31304/40861 cut-off events. For 5838/5838 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 191543 event pairs, 7124 based on Foata normal form. 258/39518 useless extension candidates. Maximal degree in co-relation 166200. Up to 39406 conditions per place. [2022-12-06 02:12:53,277 INFO L137 encePairwiseOnDemand]: 48/52 looper letters, 485 selfloop transitions, 10 changer transitions 19/514 dead transitions. [2022-12-06 02:12:53,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 514 transitions, 4363 flow [2022-12-06 02:12:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:12:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:12:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-06 02:12:53,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-06 02:12:53,280 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2022-12-06 02:12:53,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:12:53,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 514 transitions, 4363 flow [2022-12-06 02:12:53,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 514 transitions, 4363 flow [2022-12-06 02:12:53,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:12:53,451 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:12:53,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 02:12:53,452 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 514 transitions, 4363 flow [2022-12-06 02:12:53,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:12:53,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:12:53,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:12:53,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:12:53,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:12:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:12:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash 663400864, now seen corresponding path program 3 times [2022-12-06 02:12:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:12:53,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346067714] [2022-12-06 02:12:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:12:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:12:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:12:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:12:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:12:54,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346067714] [2022-12-06 02:12:54,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346067714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:12:54,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:12:54,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 02:12:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049831086] [2022-12-06 02:12:54,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:12:54,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:12:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:12:54,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:12:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:12:54,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:12:54,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 514 transitions, 4363 flow. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:12:54,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:12:54,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:12:54,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:01,862 INFO L130 PetriNetUnfolder]: 54799/71871 cut-off events. [2022-12-06 02:13:01,862 INFO L131 PetriNetUnfolder]: For 11731/11731 co-relation queries the response was YES. [2022-12-06 02:13:02,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368733 conditions, 71871 events. 54799/71871 cut-off events. For 11731/11731 co-relation queries the response was YES. Maximal size of possible extension queue 1475. Compared 371939 event pairs, 5072 based on Foata normal form. 1/68229 useless extension candidates. Maximal degree in co-relation 365026. Up to 69978 conditions per place. [2022-12-06 02:13:02,307 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 977 selfloop transitions, 242 changer transitions 20/1239 dead transitions. [2022-12-06 02:13:02,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 1239 transitions, 13052 flow [2022-12-06 02:13:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:13:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:13:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 649 transitions. [2022-12-06 02:13:02,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4303713527851459 [2022-12-06 02:13:02,310 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 43 predicate places. [2022-12-06 02:13:02,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:02,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 1239 transitions, 13052 flow [2022-12-06 02:13:02,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 1239 transitions, 13052 flow [2022-12-06 02:13:02,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:02,630 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:02,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 322 [2022-12-06 02:13:02,633 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 1239 transitions, 13052 flow [2022-12-06 02:13:02,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:02,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:02,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:02,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:13:02,633 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:13:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1092277030, now seen corresponding path program 4 times [2022-12-06 02:13:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:02,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630016808] [2022-12-06 02:13:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:02,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:02,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630016808] [2022-12-06 02:13:02,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630016808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:02,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:02,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:13:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907546912] [2022-12-06 02:13:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:02,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:13:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:13:02,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:13:02,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:13:02,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 1239 transitions, 13052 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:02,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:02,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:13:02,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:08,535 INFO L130 PetriNetUnfolder]: 37625/49529 cut-off events. [2022-12-06 02:13:08,535 INFO L131 PetriNetUnfolder]: For 7018/7018 co-relation queries the response was YES. [2022-12-06 02:13:08,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303210 conditions, 49529 events. 37625/49529 cut-off events. For 7018/7018 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 243455 event pairs, 4182 based on Foata normal form. 705/47850 useless extension candidates. Maximal degree in co-relation 300680. Up to 48420 conditions per place. [2022-12-06 02:13:08,903 INFO L137 encePairwiseOnDemand]: 48/52 looper letters, 1093 selfloop transitions, 16 changer transitions 32/1141 dead transitions. [2022-12-06 02:13:08,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 1141 transitions, 14297 flow [2022-12-06 02:13:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:13:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:13:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-12-06 02:13:08,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5048076923076923 [2022-12-06 02:13:08,907 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 45 predicate places. [2022-12-06 02:13:08,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:08,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 1141 transitions, 14297 flow [2022-12-06 02:13:09,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 1141 transitions, 14297 flow [2022-12-06 02:13:09,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:09,179 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:09,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-06 02:13:09,181 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 1141 transitions, 14297 flow [2022-12-06 02:13:09,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:09,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:09,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:09,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:13:09,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:13:09,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1410319752, now seen corresponding path program 5 times [2022-12-06 02:13:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:09,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056491090] [2022-12-06 02:13:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:09,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056491090] [2022-12-06 02:13:09,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056491090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:09,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:09,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 02:13:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152987644] [2022-12-06 02:13:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:09,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:13:09,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:13:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:13:09,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:13:09,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 1141 transitions, 14297 flow. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:09,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:09,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:13:09,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:19,230 INFO L130 PetriNetUnfolder]: 46378/61086 cut-off events. [2022-12-06 02:13:19,230 INFO L131 PetriNetUnfolder]: For 9075/9075 co-relation queries the response was YES. [2022-12-06 02:13:19,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435243 conditions, 61086 events. 46378/61086 cut-off events. For 9075/9075 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 310043 event pairs, 4704 based on Foata normal form. 1/58040 useless extension candidates. Maximal degree in co-relation 430920. Up to 59794 conditions per place. [2022-12-06 02:13:19,789 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 1480 selfloop transitions, 139 changer transitions 71/1690 dead transitions. [2022-12-06 02:13:19,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 1690 transitions, 24583 flow [2022-12-06 02:13:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:13:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:13:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 474 transitions. [2022-12-06 02:13:19,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3646153846153846 [2022-12-06 02:13:19,792 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 69 predicate places. [2022-12-06 02:13:19,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:19,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 1690 transitions, 24583 flow [2022-12-06 02:13:20,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 1690 transitions, 24583 flow [2022-12-06 02:13:20,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:20,122 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:20,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-06 02:13:20,123 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 1690 transitions, 24583 flow [2022-12-06 02:13:20,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:20,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:20,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:20,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:13:20,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:13:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash -898487327, now seen corresponding path program 1 times [2022-12-06 02:13:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:20,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930493] [2022-12-06 02:13:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930493] [2022-12-06 02:13:20,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:20,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:20,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 02:13:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245754268] [2022-12-06 02:13:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:20,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:13:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:13:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:13:20,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:13:20,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 1690 transitions, 24583 flow. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:20,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:20,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:13:20,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:34,559 INFO L130 PetriNetUnfolder]: 54152/71554 cut-off events. [2022-12-06 02:13:34,559 INFO L131 PetriNetUnfolder]: For 10951/10951 co-relation queries the response was YES. [2022-12-06 02:13:34,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581870 conditions, 71554 events. 54152/71554 cut-off events. For 10951/10951 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 375260 event pairs, 3454 based on Foata normal form. 1/67756 useless extension candidates. Maximal degree in co-relation 575931. Up to 70079 conditions per place. [2022-12-06 02:13:35,235 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 1883 selfloop transitions, 165 changer transitions 109/2157 dead transitions. [2022-12-06 02:13:35,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 2157 transitions, 35778 flow [2022-12-06 02:13:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:13:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:13:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 543 transitions. [2022-12-06 02:13:35,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.336848635235732 [2022-12-06 02:13:35,238 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 99 predicate places. [2022-12-06 02:13:35,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:35,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 2157 transitions, 35778 flow [2022-12-06 02:13:35,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 2157 transitions, 35778 flow [2022-12-06 02:13:35,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:35,669 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:35,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 432 [2022-12-06 02:13:35,670 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 2157 transitions, 35778 flow [2022-12-06 02:13:35,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:35,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:35,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:35,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:13:35,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:13:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359387, now seen corresponding path program 2 times [2022-12-06 02:13:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:35,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005232457] [2022-12-06 02:13:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:36,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005232457] [2022-12-06 02:13:36,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005232457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:36,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:36,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 02:13:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534065136] [2022-12-06 02:13:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:36,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:13:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:13:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:13:36,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:13:36,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 2157 transitions, 35778 flow. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:36,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:36,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:13:36,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:55,320 INFO L130 PetriNetUnfolder]: 60513/80140 cut-off events. [2022-12-06 02:13:55,321 INFO L131 PetriNetUnfolder]: For 12919/12919 co-relation queries the response was YES. [2022-12-06 02:13:55,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732299 conditions, 80140 events. 60513/80140 cut-off events. For 12919/12919 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 428941 event pairs, 3398 based on Foata normal form. 1/75598 useless extension candidates. Maximal degree in co-relation 725592. Up to 78665 conditions per place. [2022-12-06 02:13:55,998 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 2245 selfloop transitions, 182 changer transitions 148/2575 dead transitions. [2022-12-06 02:13:55,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 2575 transitions, 47991 flow [2022-12-06 02:13:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:13:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:13:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 505 transitions. [2022-12-06 02:13:56,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32371794871794873 [2022-12-06 02:13:56,005 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 128 predicate places. [2022-12-06 02:13:56,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:56,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 2575 transitions, 47991 flow [2022-12-06 02:13:56,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 2575 transitions, 47991 flow [2022-12-06 02:13:56,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:56,514 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:56,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 512 [2022-12-06 02:13:56,517 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 2575 transitions, 47991 flow [2022-12-06 02:13:56,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:56,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:56,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:56,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:13:56,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:13:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1486049875, now seen corresponding path program 3 times [2022-12-06 02:13:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:56,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182119450] [2022-12-06 02:13:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:57,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182119450] [2022-12-06 02:13:57,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182119450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:57,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:57,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 02:13:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658038140] [2022-12-06 02:13:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:57,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:13:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:13:57,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:13:57,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:13:57,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 2575 transitions, 47991 flow. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:57,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:57,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:13:57,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:22,695 INFO L130 PetriNetUnfolder]: 71085/94705 cut-off events. [2022-12-06 02:14:22,696 INFO L131 PetriNetUnfolder]: For 16409/16409 co-relation queries the response was YES. [2022-12-06 02:14:22,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960982 conditions, 94705 events. 71085/94705 cut-off events. For 16409/16409 co-relation queries the response was YES. Maximal size of possible extension queue 1957. Compared 529712 event pairs, 3302 based on Foata normal form. 1/88819 useless extension candidates. Maximal degree in co-relation 953412. Up to 93230 conditions per place. [2022-12-06 02:14:23,494 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 2696 selfloop transitions, 292 changer transitions 262/3250 dead transitions. [2022-12-06 02:14:23,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 3250 transitions, 67226 flow [2022-12-06 02:14:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 02:14:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 02:14:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 614 transitions. [2022-12-06 02:14:23,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2951923076923077 [2022-12-06 02:14:23,498 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 167 predicate places. [2022-12-06 02:14:23,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:23,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 3250 transitions, 67226 flow [2022-12-06 02:14:24,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 3250 transitions, 67226 flow [2022-12-06 02:14:24,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:24,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:24,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 795 [2022-12-06 02:14:24,293 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 3250 transitions, 67226 flow [2022-12-06 02:14:24,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:14:24,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:24,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:24,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 02:14:24,293 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:14:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -414147053, now seen corresponding path program 4 times [2022-12-06 02:14:24,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:24,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483318231] [2022-12-06 02:14:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483318231] [2022-12-06 02:14:24,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483318231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:14:24,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:14:24,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:14:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395138026] [2022-12-06 02:14:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:14:24,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:14:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:14:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:14:24,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:14:24,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 3250 transitions, 67226 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:14:24,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:24,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:14:24,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:52,657 INFO L130 PetriNetUnfolder]: 56907/76521 cut-off events. [2022-12-06 02:14:52,658 INFO L131 PetriNetUnfolder]: For 13656/13656 co-relation queries the response was YES. [2022-12-06 02:14:52,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853697 conditions, 76521 events. 56907/76521 cut-off events. For 13656/13656 co-relation queries the response was YES. Maximal size of possible extension queue 1548. Compared 424007 event pairs, 4800 based on Foata normal form. 1210/72564 useless extension candidates. Maximal degree in co-relation 845389. Up to 75542 conditions per place. [2022-12-06 02:14:53,533 INFO L137 encePairwiseOnDemand]: 48/52 looper letters, 2803 selfloop transitions, 77 changer transitions 292/3172 dead transitions. [2022-12-06 02:14:53,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 3172 transitions, 72058 flow [2022-12-06 02:14:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:14:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:14:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-06 02:14:53,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4951923076923077 [2022-12-06 02:14:53,535 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 166 predicate places. [2022-12-06 02:14:53,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:53,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 3172 transitions, 72058 flow [2022-12-06 02:14:54,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 3172 transitions, 72058 flow [2022-12-06 02:14:54,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:54,263 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:54,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 729 [2022-12-06 02:14:54,264 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 3172 transitions, 72058 flow [2022-12-06 02:14:54,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:14:54,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:54,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:54,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 02:14:54,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:14:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash -440597, now seen corresponding path program 5 times [2022-12-06 02:14:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:54,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993713215] [2022-12-06 02:14:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:54,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:54,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993713215] [2022-12-06 02:14:54,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993713215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:14:54,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:14:54,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:14:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906060118] [2022-12-06 02:14:54,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:14:54,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:14:54,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:54,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:14:54,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:14:54,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:14:54,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 3172 transitions, 72058 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:14:54,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:54,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:14:54,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:15:18,754 INFO L130 PetriNetUnfolder]: 49163/66585 cut-off events. [2022-12-06 02:15:18,754 INFO L131 PetriNetUnfolder]: For 13078/13078 co-relation queries the response was YES. [2022-12-06 02:15:18,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810269 conditions, 66585 events. 49163/66585 cut-off events. For 13078/13078 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 368656 event pairs, 3704 based on Foata normal form. 704/62446 useless extension candidates. Maximal degree in co-relation 801273. Up to 65630 conditions per place. [2022-12-06 02:15:19,420 INFO L137 encePairwiseOnDemand]: 48/52 looper letters, 2625 selfloop transitions, 93 changer transitions 292/3010 dead transitions. [2022-12-06 02:15:19,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 3010 transitions, 74536 flow [2022-12-06 02:15:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:15:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:15:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-06 02:15:19,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2022-12-06 02:15:19,422 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 159 predicate places. [2022-12-06 02:15:19,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:15:19,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 3010 transitions, 74536 flow [2022-12-06 02:15:20,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 3010 transitions, 74536 flow [2022-12-06 02:15:20,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:15:20,051 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:15:20,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 629 [2022-12-06 02:15:20,052 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 3010 transitions, 74536 flow [2022-12-06 02:15:20,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:15:20,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:15:20,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:15:20,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 02:15:20,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:15:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:15:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1754196387, now seen corresponding path program 6 times [2022-12-06 02:15:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:15:20,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570553651] [2022-12-06 02:15:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:15:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:15:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:15:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:15:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:15:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570553651] [2022-12-06 02:15:20,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570553651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:15:20,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:15:20,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-06 02:15:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776915202] [2022-12-06 02:15:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:15:20,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:15:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:15:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:15:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:15:20,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:15:20,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 3010 transitions, 74536 flow. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:15:20,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:15:20,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:15:20,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:15:50,094 INFO L130 PetriNetUnfolder]: 55763/75272 cut-off events. [2022-12-06 02:15:50,094 INFO L131 PetriNetUnfolder]: For 13868/13868 co-relation queries the response was YES. [2022-12-06 02:15:50,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990468 conditions, 75272 events. 55763/75272 cut-off events. For 13868/13868 co-relation queries the response was YES. Maximal size of possible extension queue 1621. Compared 421359 event pairs, 4178 based on Foata normal form. 1/70118 useless extension candidates. Maximal degree in co-relation 980697. Up to 74313 conditions per place. [2022-12-06 02:15:50,930 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 2822 selfloop transitions, 270 changer transitions 356/3448 dead transitions. [2022-12-06 02:15:50,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 3448 transitions, 92164 flow [2022-12-06 02:15:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:15:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:15:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 478 transitions. [2022-12-06 02:15:50,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29652605459057074 [2022-12-06 02:15:50,932 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 189 predicate places. [2022-12-06 02:15:50,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:15:50,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 3448 transitions, 92164 flow [2022-12-06 02:15:51,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 3448 transitions, 92164 flow [2022-12-06 02:15:51,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:15:51,786 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:15:51,787 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 855 [2022-12-06 02:15:51,787 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 3448 transitions, 92164 flow [2022-12-06 02:15:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:15:51,787 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:15:51,787 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:15:51,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 02:15:51,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:15:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:15:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1385545585, now seen corresponding path program 7 times [2022-12-06 02:15:51,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:15:51,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958794704] [2022-12-06 02:15:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:15:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:15:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:15:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:15:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:15:52,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958794704] [2022-12-06 02:15:52,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958794704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:15:52,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:15:52,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 02:15:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659137117] [2022-12-06 02:15:52,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:15:52,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:15:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:15:52,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:15:52,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:15:52,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:15:52,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 3448 transitions, 92164 flow. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:15:52,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:15:52,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:15:52,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:16:30,555 INFO L130 PetriNetUnfolder]: 61354/82528 cut-off events. [2022-12-06 02:16:30,555 INFO L131 PetriNetUnfolder]: For 14710/14710 co-relation queries the response was YES. [2022-12-06 02:16:30,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168085 conditions, 82528 events. 61354/82528 cut-off events. For 14710/14710 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 464536 event pairs, 3484 based on Foata normal form. 1/77026 useless extension candidates. Maximal degree in co-relation 1157562. Up to 81553 conditions per place. [2022-12-06 02:16:31,291 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 3137 selfloop transitions, 211 changer transitions 421/3769 dead transitions. [2022-12-06 02:16:31,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 3769 transitions, 108229 flow [2022-12-06 02:16:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:16:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:16:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 351 transitions. [2022-12-06 02:16:31,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-06 02:16:31,293 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 210 predicate places. [2022-12-06 02:16:31,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:16:31,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 3769 transitions, 108229 flow [2022-12-06 02:16:31,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 3769 transitions, 108229 flow [2022-12-06 02:16:31,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:16:32,009 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:16:32,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 716 [2022-12-06 02:16:32,009 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 3769 transitions, 108229 flow [2022-12-06 02:16:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:16:32,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:16:32,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:16:32,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 02:16:32,010 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:16:32,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:16:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1367892413, now seen corresponding path program 8 times [2022-12-06 02:16:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:16:32,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702274149] [2022-12-06 02:16:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:16:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:16:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:16:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:16:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:16:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702274149] [2022-12-06 02:16:32,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702274149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:16:32,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:16:32,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 02:16:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634751452] [2022-12-06 02:16:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:16:32,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:16:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:16:32,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:16:32,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:16:32,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:16:32,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 3769 transitions, 108229 flow. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:16:32,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:16:32,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:16:32,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:17:16,164 INFO L130 PetriNetUnfolder]: 64496/86909 cut-off events. [2022-12-06 02:17:16,164 INFO L131 PetriNetUnfolder]: For 15792/15792 co-relation queries the response was YES. [2022-12-06 02:17:16,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317079 conditions, 86909 events. 64496/86909 cut-off events. For 15792/15792 co-relation queries the response was YES. Maximal size of possible extension queue 1875. Compared 494731 event pairs, 3418 based on Foata normal form. 1/81069 useless extension candidates. Maximal degree in co-relation 1305709. Up to 85902 conditions per place. [2022-12-06 02:17:17,110 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 3501 selfloop transitions, 109 changer transitions 455/4065 dead transitions. [2022-12-06 02:17:17,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 4065 transitions, 124857 flow [2022-12-06 02:17:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:17:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:17:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 384 transitions. [2022-12-06 02:17:17,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2953846153846154 [2022-12-06 02:17:17,112 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 234 predicate places. [2022-12-06 02:17:17,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:17:17,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 312 places, 4065 transitions, 124857 flow [2022-12-06 02:17:17,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 312 places, 4065 transitions, 124857 flow [2022-12-06 02:17:17,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:17:17,815 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:17:17,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 704 [2022-12-06 02:17:17,816 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 4065 transitions, 124857 flow [2022-12-06 02:17:17,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:17,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:17:17,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:17:17,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 02:17:17,817 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:17:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:17:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1356406588, now seen corresponding path program 6 times [2022-12-06 02:17:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:17:17,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922465362] [2022-12-06 02:17:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:17:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:17:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:17:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:17:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:17:18,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922465362] [2022-12-06 02:17:18,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922465362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:17:18,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:17:18,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 02:17:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945459709] [2022-12-06 02:17:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:17:18,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:17:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:17:18,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:17:18,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:17:18,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:17:18,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 4065 transitions, 124857 flow. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:17:18,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:17:18,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:17:18,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:18:13,753 INFO L130 PetriNetUnfolder]: 73953/99342 cut-off events. [2022-12-06 02:18:13,753 INFO L131 PetriNetUnfolder]: For 17276/17276 co-relation queries the response was YES. [2022-12-06 02:18:14,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604281 conditions, 99342 events. 73953/99342 cut-off events. For 17276/17276 co-relation queries the response was YES. Maximal size of possible extension queue 2262. Compared 571697 event pairs, 3738 based on Foata normal form. 2/92855 useless extension candidates. Maximal degree in co-relation 1592099. Up to 98319 conditions per place. [2022-12-06 02:18:15,011 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 3881 selfloop transitions, 249 changer transitions 507/4637 dead transitions. [2022-12-06 02:18:15,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 4637 transitions, 151498 flow [2022-12-06 02:18:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:18:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:18:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 478 transitions. [2022-12-06 02:18:15,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29652605459057074 [2022-12-06 02:18:15,014 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 264 predicate places. [2022-12-06 02:18:15,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:18:15,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 342 places, 4637 transitions, 151498 flow [2022-12-06 02:18:16,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 342 places, 4637 transitions, 151498 flow [2022-12-06 02:18:16,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:18:16,095 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:18:16,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1081 [2022-12-06 02:18:16,095 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 4637 transitions, 151498 flow [2022-12-06 02:18:16,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:18:16,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:18:16,096 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:18:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 02:18:16,096 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:18:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:18:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1234248474, now seen corresponding path program 7 times [2022-12-06 02:18:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:18:16,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737032687] [2022-12-06 02:18:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:18:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:18:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:18:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:18:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:18:16,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737032687] [2022-12-06 02:18:16,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737032687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:18:16,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:18:16,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 02:18:16,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808043993] [2022-12-06 02:18:16,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:18:16,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:18:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:18:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:18:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:18:16,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:18:16,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 4637 transitions, 151498 flow. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:18:16,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:18:16,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:18:16,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:19:39,991 INFO L130 PetriNetUnfolder]: 76588/102874 cut-off events. [2022-12-06 02:19:39,991 INFO L131 PetriNetUnfolder]: For 18104/18104 co-relation queries the response was YES. [2022-12-06 02:19:40,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764480 conditions, 102874 events. 76588/102874 cut-off events. For 18104/18104 co-relation queries the response was YES. Maximal size of possible extension queue 2323. Compared 594784 event pairs, 3838 based on Foata normal form. 1/96002 useless extension candidates. Maximal degree in co-relation 1751531. Up to 101835 conditions per place. [2022-12-06 02:19:41,288 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 4114 selfloop transitions, 127 changer transitions 544/4785 dead transitions. [2022-12-06 02:19:41,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4785 transitions, 165952 flow [2022-12-06 02:19:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:19:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:19:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 311 transitions. [2022-12-06 02:19:41,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29903846153846153 [2022-12-06 02:19:41,299 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 283 predicate places. [2022-12-06 02:19:41,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:19:41,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 361 places, 4785 transitions, 165952 flow [2022-12-06 02:19:42,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 361 places, 4785 transitions, 165952 flow [2022-12-06 02:19:42,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:19:42,435 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:19:42,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1137 [2022-12-06 02:19:42,436 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 4785 transitions, 165952 flow [2022-12-06 02:19:42,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:42,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:19:42,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:19:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 02:19:42,437 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:19:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:19:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 221858210, now seen corresponding path program 8 times [2022-12-06 02:19:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:19:42,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49787843] [2022-12-06 02:19:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:19:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:19:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:19:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:19:42,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:19:42,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49787843] [2022-12-06 02:19:42,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49787843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:19:42,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:19:42,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 02:19:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290635516] [2022-12-06 02:19:42,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:19:42,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:19:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:19:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:19:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:19:42,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:19:42,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 4785 transitions, 165952 flow. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:19:42,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:19:42,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:19:42,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:21:21,035 INFO L130 PetriNetUnfolder]: 82309/110554 cut-off events. [2022-12-06 02:21:21,035 INFO L131 PetriNetUnfolder]: For 20134/20134 co-relation queries the response was YES. [2022-12-06 02:21:21,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2007347 conditions, 110554 events. 82309/110554 cut-off events. For 20134/20134 co-relation queries the response was YES. Maximal size of possible extension queue 2465. Compared 645570 event pairs, 3452 based on Foata normal form. 1/102838 useless extension candidates. Maximal degree in co-relation 1993591. Up to 109515 conditions per place. [2022-12-06 02:21:22,548 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 4304 selfloop transitions, 176 changer transitions 633/5113 dead transitions. [2022-12-06 02:21:22,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 5113 transitions, 187642 flow [2022-12-06 02:21:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:21:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:21:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 371 transitions. [2022-12-06 02:21:22,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2853846153846154 [2022-12-06 02:21:22,557 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 307 predicate places. [2022-12-06 02:21:22,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:21:22,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 385 places, 5113 transitions, 187642 flow [2022-12-06 02:21:23,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 5113 transitions, 187642 flow [2022-12-06 02:21:23,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:21:23,702 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:21:23,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1146 [2022-12-06 02:21:23,703 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 5113 transitions, 187642 flow [2022-12-06 02:21:23,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:21:23,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:21:23,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:21:23,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 02:21:23,710 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:21:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:21:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1777616671, now seen corresponding path program 1 times [2022-12-06 02:21:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:21:23,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540842588] [2022-12-06 02:21:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:21:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:21:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:21:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:21:24,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:21:24,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540842588] [2022-12-06 02:21:24,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540842588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:21:24,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:21:24,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 02:21:24,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343163510] [2022-12-06 02:21:24,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:21:24,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:21:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:21:24,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:21:24,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:21:24,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:21:24,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 5113 transitions, 187642 flow. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:21:24,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:21:24,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:21:24,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:23:01,894 INFO L130 PetriNetUnfolder]: 85007/114195 cut-off events. [2022-12-06 02:23:01,894 INFO L131 PetriNetUnfolder]: For 20678/20678 co-relation queries the response was YES. [2022-12-06 02:23:02,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187693 conditions, 114195 events. 85007/114195 cut-off events. For 20678/20678 co-relation queries the response was YES. Maximal size of possible extension queue 2549. Compared 670046 event pairs, 3492 based on Foata normal form. 1/106181 useless extension candidates. Maximal degree in co-relation 2173125. Up to 113156 conditions per place. [2022-12-06 02:23:03,376 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 4511 selfloop transitions, 130 changer transitions 691/5332 dead transitions. [2022-12-06 02:23:03,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 5332 transitions, 206370 flow [2022-12-06 02:23:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:23:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:23:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 306 transitions. [2022-12-06 02:23:03,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3097165991902834 [2022-12-06 02:23:03,391 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 325 predicate places. [2022-12-06 02:23:03,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:23:03,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 5332 transitions, 206370 flow [2022-12-06 02:23:04,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 5332 transitions, 206370 flow [2022-12-06 02:23:04,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:23:04,845 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:23:04,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1454 [2022-12-06 02:23:04,845 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 5332 transitions, 206370 flow [2022-12-06 02:23:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:23:04,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:23:04,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:23:04,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 02:23:04,846 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:23:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:23:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1527859650, now seen corresponding path program 9 times [2022-12-06 02:23:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:23:04,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631736749] [2022-12-06 02:23:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:23:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:23:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:23:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:23:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:23:05,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631736749] [2022-12-06 02:23:05,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631736749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:23:05,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:23:05,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 02:23:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103648464] [2022-12-06 02:23:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:23:05,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:23:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:23:05,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:23:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:23:05,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:23:05,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 5332 transitions, 206370 flow. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:23:05,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:23:05,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:23:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:25:20,326 INFO L130 PetriNetUnfolder]: 87821/118004 cut-off events. [2022-12-06 02:25:20,326 INFO L131 PetriNetUnfolder]: For 21620/21620 co-relation queries the response was YES. [2022-12-06 02:25:20,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378825 conditions, 118004 events. 87821/118004 cut-off events. For 21620/21620 co-relation queries the response was YES. Maximal size of possible extension queue 2620. Compared 696797 event pairs, 3602 based on Foata normal form. 1/109620 useless extension candidates. Maximal degree in co-relation 2363439. Up to 116965 conditions per place. [2022-12-06 02:25:22,042 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 4706 selfloop transitions, 153 changer transitions 732/5591 dead transitions. [2022-12-06 02:25:22,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 5591 transitions, 227628 flow [2022-12-06 02:25:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:25:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:25:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 348 transitions. [2022-12-06 02:25:22,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3041958041958042 [2022-12-06 02:25:22,049 INFO L294 CegarLoopForPetriNet]: 78 programPoint places, 346 predicate places. [2022-12-06 02:25:22,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:22,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 424 places, 5591 transitions, 227628 flow [2022-12-06 02:25:23,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 424 places, 5591 transitions, 227628 flow [2022-12-06 02:25:23,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:25:23,754 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:25:23,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1716 [2022-12-06 02:25:23,766 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 5591 transitions, 227628 flow [2022-12-06 02:25:23,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:23,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:25:23,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:25:23,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 02:25:23,767 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 02:25:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:25:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash -819899973, now seen corresponding path program 2 times [2022-12-06 02:25:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:25:23,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600224140] [2022-12-06 02:25:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:23,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:25:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:24,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:25:24,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600224140] [2022-12-06 02:25:24,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600224140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:25:24,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:25:24,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 02:25:24,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006629685] [2022-12-06 02:25:24,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:25:24,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:25:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:25:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:25:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:25:24,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 02:25:24,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 5591 transitions, 227628 flow. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:24,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:25:24,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 02:25:24,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:25:50,980 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:25:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:25:51,048 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2022-12-06 02:25:51,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 02:25:51,048 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining) [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining) [2022-12-06 02:25:51,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining) [2022-12-06 02:25:51,051 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork3Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2022-12-06 02:25:51,051 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2022-12-06 02:25:51,051 INFO L458 BasicCegarLoop]: Path program histogram: [9, 8, 2, 1] [2022-12-06 02:25:51,053 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:25:51,053 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:25:51,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:25:51 BasicIcfg [2022-12-06 02:25:51,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:25:51,056 INFO L158 Benchmark]: Toolchain (without parser) took 796801.13ms. Allocated memory was 198.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 167.1MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-06 02:25:51,056 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 175.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:25:51,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.63ms. Allocated memory is still 198.2MB. Free memory was 166.8MB in the beginning and 149.1MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 02:25:51,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.30ms. Allocated memory is still 198.2MB. Free memory was 149.1MB in the beginning and 146.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:25:51,056 INFO L158 Benchmark]: Boogie Preprocessor took 19.97ms. Allocated memory is still 198.2MB. Free memory was 146.8MB in the beginning and 144.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:25:51,056 INFO L158 Benchmark]: RCFGBuilder took 564.05ms. Allocated memory is still 198.2MB. Free memory was 144.9MB in the beginning and 121.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 02:25:51,057 INFO L158 Benchmark]: TraceAbstraction took 795995.00ms. Allocated memory was 198.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 121.2MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-12-06 02:25:51,057 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 175.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.63ms. Allocated memory is still 198.2MB. Free memory was 166.8MB in the beginning and 149.1MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.30ms. Allocated memory is still 198.2MB. Free memory was 149.1MB in the beginning and 146.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.97ms. Allocated memory is still 198.2MB. Free memory was 146.8MB in the beginning and 144.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.05ms. Allocated memory is still 198.2MB. Free memory was 144.9MB in the beginning and 121.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 795995.00ms. Allocated memory was 198.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 121.2MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 199 PlacesBefore, 78 PlacesAfterwards, 188 TransitionsBefore, 65 TransitionsAfterwards, 7268 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 70 TrivialYvCompositions, 51 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6804, independent: 6559, independent conditional: 6559, independent unconditional: 0, dependent: 245, dependent conditional: 245, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6804, independent: 6559, independent conditional: 0, independent unconditional: 6559, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6804, independent: 6559, independent conditional: 0, independent unconditional: 6559, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6804, independent: 6559, independent conditional: 0, independent unconditional: 6559, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4418, independent: 4324, independent conditional: 0, independent unconditional: 4324, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4418, independent: 4250, independent conditional: 0, independent unconditional: 4250, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 168, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6804, independent: 2235, independent conditional: 0, independent unconditional: 2235, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 4418, unknown conditional: 0, unknown unconditional: 4418] , Statistics on independence cache: Total cache size (in pairs): 6300, Positive cache size: 6206, Positive conditional cache size: 0, Positive unconditional cache size: 6206, Negative cache size: 94, Negative conditional cache size: 0, Negative unconditional cache size: 94, 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.4s, 79 PlacesBefore, 68 PlacesAfterwards, 63 TransitionsBefore, 52 TransitionsAfterwards, 906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 526 TransitionsBefore, 526 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 514 TransitionsBefore, 514 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 121 PlacesBefore, 121 PlacesAfterwards, 1239 TransitionsBefore, 1239 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 1141 TransitionsBefore, 1141 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 147 PlacesBefore, 147 PlacesAfterwards, 1690 TransitionsBefore, 1690 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 177 PlacesBefore, 177 PlacesAfterwards, 2157 TransitionsBefore, 2157 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 206 PlacesBefore, 206 PlacesAfterwards, 2575 TransitionsBefore, 2575 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 245 PlacesBefore, 245 PlacesAfterwards, 3250 TransitionsBefore, 3250 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 244 PlacesBefore, 244 PlacesAfterwards, 3172 TransitionsBefore, 3172 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 237 PlacesBefore, 237 PlacesAfterwards, 3010 TransitionsBefore, 3010 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 267 PlacesBefore, 267 PlacesAfterwards, 3448 TransitionsBefore, 3448 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 288 PlacesBefore, 288 PlacesAfterwards, 3769 TransitionsBefore, 3769 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 312 PlacesBefore, 312 PlacesAfterwards, 4065 TransitionsBefore, 4065 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 342 PlacesBefore, 342 PlacesAfterwards, 4637 TransitionsBefore, 4637 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 361 PlacesBefore, 361 PlacesAfterwards, 4785 TransitionsBefore, 4785 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 385 PlacesBefore, 385 PlacesAfterwards, 5113 TransitionsBefore, 5113 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 403 PlacesBefore, 403 PlacesAfterwards, 5332 TransitionsBefore, 5332 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 424 PlacesBefore, 424 PlacesAfterwards, 5591 TransitionsBefore, 5591 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 193]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 192]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 165]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 165]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/52 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 452081 conditions, 21443 events (15973/21442 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 114213 event pairs, 481 based on Foata normal form. 0/22872 useless extension candidates. Maximal degree in co-relation 451881. Up to 20386 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 305 locations, 11 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: 795.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 769.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5687 SdHoareTripleChecker+Valid, 20.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5687 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 17.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51205 IncrementalHoareTripleChecker+Invalid, 51397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 0 mSDtfsCounter, 51205 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 26 SyntacticMatches, 18 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227628occurred in iteration=19, InterpolantAutomatonStates: 396, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 963 NumberOfCodeBlocks, 963 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 943 ConstructedInterpolants, 0 QuantifiedInterpolants, 11758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown