/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:50:56,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:50:56,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:50:56,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:50:56,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:50:56,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:50:56,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:50:56,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:50:56,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:50:56,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:50:56,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:50:56,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:50:56,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:50:56,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:50:56,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:50:56,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:50:56,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:50:56,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:50:56,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:50:56,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:50:56,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:50:56,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:50:56,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:50:56,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:50:56,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:50:56,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:50:56,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:50:56,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:50:56,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:50:56,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:50:56,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:50:56,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:50:56,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:50:56,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:50:56,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:50:56,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:50:56,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:50:56,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:50:56,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:50:56,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:50:56,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:50:56,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:50:56,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:50:56,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:50:56,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:50:56,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:50:56,444 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:50:56,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:50:56,444 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:50:56,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:50:56,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:50:56,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:50:56,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:50:56,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:50:56,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:50:56,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:50:56,447 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:50:56,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:50:56,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:50:56,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:50:56,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:50:56,715 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:50:56,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-13 07:50:57,618 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:50:57,732 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:50:57,733 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-13 07:50:57,747 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0e52619/4a1c011eb4d14e038592a5f4d99f8d59/FLAG85048e5bd [2022-12-13 07:50:57,761 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0e52619/4a1c011eb4d14e038592a5f4d99f8d59 [2022-12-13 07:50:57,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:50:57,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:50:57,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:50:57,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:50:57,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:50:57,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:57,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d092821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57, skipping insertion in model container [2022-12-13 07:50:57,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:57,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:50:57,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:50:57,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:57,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:57,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:57,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:57,925 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/popl20-figure3.wvr.c[2121,2134] [2022-12-13 07:50:57,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:50:57,935 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:50:57,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:57,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:57,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:57,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:57,952 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/popl20-figure3.wvr.c[2121,2134] [2022-12-13 07:50:57,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:50:57,966 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:50:57,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57 WrapperNode [2022-12-13 07:50:57,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:50:57,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:50:57,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:50:57,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:50:57,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:57,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,006 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2022-12-13 07:50:58,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:50:58,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:50:58,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:50:58,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:50:58,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,040 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:50:58,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:50:58,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:50:58,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:50:58,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (1/1) ... [2022-12-13 07:50:58,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:50:58,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:58,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:50:58,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:50:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:50:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:50:58,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:50:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:50:58,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:50:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:50:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:50:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:50:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:50:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:50:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:50:58,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:50:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:50:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:50:58,102 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:50:58,172 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:50:58,174 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:50:58,379 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:50:58,412 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:50:58,413 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 07:50:58,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:50:58 BoogieIcfgContainer [2022-12-13 07:50:58,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:50:58,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:50:58,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:50:58,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:50:58,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:50:57" (1/3) ... [2022-12-13 07:50:58,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a85c4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:50:58, skipping insertion in model container [2022-12-13 07:50:58,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:57" (2/3) ... [2022-12-13 07:50:58,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a85c4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:50:58, skipping insertion in model container [2022-12-13 07:50:58,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:50:58" (3/3) ... [2022-12-13 07:50:58,437 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure3.wvr.c [2022-12-13 07:50:58,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:50:58,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:50:58,468 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:50:58,550 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 07:50:58,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 07:50:58,617 INFO L130 PetriNetUnfolder]: 6/78 cut-off events. [2022-12-13 07:50:58,617 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:50:58,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-13 07:50:58,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 07:50:58,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-12-13 07:50:58,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:58,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 07:50:58,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 152 flow [2022-12-13 07:50:58,687 INFO L130 PetriNetUnfolder]: 6/70 cut-off events. [2022-12-13 07:50:58,687 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:50:58,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 6/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-13 07:50:58,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 07:50:58,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 07:51:00,411 INFO L241 LiptonReduction]: Total number of compositions: 55 [2022-12-13 07:51:00,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:51:00,427 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;@2278327a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:51:00,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 07:51:00,431 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 07:51:00,431 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:51:00,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:00,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:00,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1374975466, now seen corresponding path program 1 times [2022-12-13 07:51:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:00,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260705877] [2022-12-13 07:51:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:00,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260705877] [2022-12-13 07:51:00,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260705877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:00,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:00,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:51:00,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126880753] [2022-12-13 07:51:00,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:00,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:51:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:00,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:51:00,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:51:00,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:51:00,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:00,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:00,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:51:00,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:00,835 INFO L130 PetriNetUnfolder]: 49/94 cut-off events. [2022-12-13 07:51:00,835 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 07:51:00,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 94 events. 49/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 267 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 143. Up to 65 conditions per place. [2022-12-13 07:51:00,837 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-13 07:51:00,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 113 flow [2022-12-13 07:51:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:51:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:51:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 07:51:00,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 07:51:00,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-13 07:51:00,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 24 transitions, 113 flow [2022-12-13 07:51:00,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 20 transitions, 91 flow [2022-12-13 07:51:00,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:00,850 INFO L89 Accepts]: Start accepts. Operand has 22 places, 20 transitions, 91 flow [2022-12-13 07:51:00,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:00,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:00,852 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 20 transitions, 91 flow [2022-12-13 07:51:00,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 20 transitions, 91 flow [2022-12-13 07:51:00,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-13 07:51:00,855 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:00,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:51:00,856 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 91 flow [2022-12-13 07:51:00,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:00,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:00,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:00,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:51:00,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:00,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:00,858 INFO L85 PathProgramCache]: Analyzing trace with hash -867956374, now seen corresponding path program 1 times [2022-12-13 07:51:00,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:00,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407399163] [2022-12-13 07:51:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:00,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:00,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407399163] [2022-12-13 07:51:00,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407399163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:00,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:00,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:51:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157740782] [2022-12-13 07:51:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:00,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:51:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:00,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:51:00,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:51:00,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:00,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:00,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:00,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:00,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:01,040 INFO L130 PetriNetUnfolder]: 58/115 cut-off events. [2022-12-13 07:51:01,041 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 07:51:01,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 115 events. 58/115 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 287 event pairs, 11 based on Foata normal form. 4/97 useless extension candidates. Maximal degree in co-relation 259. Up to 81 conditions per place. [2022-12-13 07:51:01,043 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 32 selfloop transitions, 3 changer transitions 4/39 dead transitions. [2022-12-13 07:51:01,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 39 transitions, 250 flow [2022-12-13 07:51:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 07:51:01,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-13 07:51:01,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-13 07:51:01,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 39 transitions, 250 flow [2022-12-13 07:51:01,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 35 transitions, 228 flow [2022-12-13 07:51:01,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:01,047 INFO L89 Accepts]: Start accepts. Operand has 25 places, 35 transitions, 228 flow [2022-12-13 07:51:01,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:01,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:01,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 35 transitions, 228 flow [2022-12-13 07:51:01,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 35 transitions, 228 flow [2022-12-13 07:51:01,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:01,051 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:01,052 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:51:01,053 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 35 transitions, 228 flow [2022-12-13 07:51:01,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:01,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:01,053 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:01,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:51:01,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash -839264028, now seen corresponding path program 2 times [2022-12-13 07:51:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:01,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663559636] [2022-12-13 07:51:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663559636] [2022-12-13 07:51:01,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663559636] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:01,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193313624] [2022-12-13 07:51:01,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:51:01,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:01,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:01,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:01,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:51:01,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:01,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:01,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:51:01,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:01,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:01,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193313624] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:01,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:51:01,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-13 07:51:01,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075096218] [2022-12-13 07:51:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:01,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:01,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:51:01,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-13 07:51:01,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 35 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:01,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:01,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-13 07:51:01,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:01,381 INFO L130 PetriNetUnfolder]: 63/120 cut-off events. [2022-12-13 07:51:01,381 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 07:51:01,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 120 events. 63/120 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 287 event pairs, 11 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 358. Up to 95 conditions per place. [2022-12-13 07:51:01,382 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2022-12-13 07:51:01,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 42 transitions, 351 flow [2022-12-13 07:51:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-13 07:51:01,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 07:51:01,384 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2022-12-13 07:51:01,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 42 transitions, 351 flow [2022-12-13 07:51:01,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 42 transitions, 351 flow [2022-12-13 07:51:01,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:01,385 INFO L89 Accepts]: Start accepts. Operand has 28 places, 42 transitions, 351 flow [2022-12-13 07:51:01,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:01,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:01,386 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 42 transitions, 351 flow [2022-12-13 07:51:01,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 42 transitions, 351 flow [2022-12-13 07:51:01,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:01,387 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:01,388 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:51:01,388 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 42 transitions, 351 flow [2022-12-13 07:51:01,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:01,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:01,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:01,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:01,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:01,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:01,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1017957770, now seen corresponding path program 3 times [2022-12-13 07:51:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:01,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455417995] [2022-12-13 07:51:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:01,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455417995] [2022-12-13 07:51:01,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455417995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:01,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362130442] [2022-12-13 07:51:01,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:51:01,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:01,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:01,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:01,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:51:01,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:51:01,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:01,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:51:01,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:01,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:01,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362130442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:01,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:01,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-13 07:51:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633464539] [2022-12-13 07:51:01,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:01,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:51:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:51:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:51:01,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:01,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 42 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:01,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:01,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:01,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:01,963 INFO L130 PetriNetUnfolder]: 80/151 cut-off events. [2022-12-13 07:51:01,963 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-13 07:51:01,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 151 events. 80/151 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 415 event pairs, 8 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 635. Up to 125 conditions per place. [2022-12-13 07:51:01,965 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 49 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2022-12-13 07:51:01,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 61 transitions, 632 flow [2022-12-13 07:51:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-12-13 07:51:01,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 07:51:01,966 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 07:51:01,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 61 transitions, 632 flow [2022-12-13 07:51:01,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 61 transitions, 632 flow [2022-12-13 07:51:01,968 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:01,969 INFO L89 Accepts]: Start accepts. Operand has 34 places, 61 transitions, 632 flow [2022-12-13 07:51:01,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:01,969 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:01,969 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 61 transitions, 632 flow [2022-12-13 07:51:01,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 61 transitions, 632 flow [2022-12-13 07:51:01,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:01,971 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:01,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:51:01,972 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 61 transitions, 632 flow [2022-12-13 07:51:01,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:01,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:01,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:01,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:02,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-13 07:51:02,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1396776176, now seen corresponding path program 4 times [2022-12-13 07:51:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:02,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416067792] [2022-12-13 07:51:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416067792] [2022-12-13 07:51:02,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416067792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805060349] [2022-12-13 07:51:02,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:51:02,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:02,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:02,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:02,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:51:02,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:51:02,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:02,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:51:02,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:02,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805060349] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:02,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:02,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:51:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209638508] [2022-12-13 07:51:02,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:02,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:02,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:02,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:02,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 61 transitions, 632 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:02,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:02,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:02,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:02,450 INFO L130 PetriNetUnfolder]: 74/137 cut-off events. [2022-12-13 07:51:02,451 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-13 07:51:02,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 137 events. 74/137 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 352 event pairs, 8 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 691. Up to 111 conditions per place. [2022-12-13 07:51:02,452 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2022-12-13 07:51:02,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 664 flow [2022-12-13 07:51:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-12-13 07:51:02,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2022-12-13 07:51:02,456 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-13 07:51:02,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 54 transitions, 664 flow [2022-12-13 07:51:02,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 54 transitions, 664 flow [2022-12-13 07:51:02,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:02,459 INFO L89 Accepts]: Start accepts. Operand has 37 places, 54 transitions, 664 flow [2022-12-13 07:51:02,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:02,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:02,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 54 transitions, 664 flow [2022-12-13 07:51:02,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 54 transitions, 664 flow [2022-12-13 07:51:02,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:02,463 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:02,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:51:02,464 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 54 transitions, 664 flow [2022-12-13 07:51:02,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:02,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:02,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:02,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:02,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:02,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1943410373, now seen corresponding path program 1 times [2022-12-13 07:51:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:02,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216186488] [2022-12-13 07:51:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216186488] [2022-12-13 07:51:02,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216186488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101235671] [2022-12-13 07:51:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:02,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:02,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:51:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:02,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:51:02,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:02,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:02,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101235671] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:02,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:02,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-13 07:51:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828268480] [2022-12-13 07:51:02,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:02,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:51:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:51:02,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:51:02,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:51:02,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 54 transitions, 664 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:02,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:02,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:51:02,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:02,981 INFO L130 PetriNetUnfolder]: 136/254 cut-off events. [2022-12-13 07:51:02,981 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-12-13 07:51:02,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1769 conditions, 254 events. 136/254 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 870 event pairs, 8 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 1532. Up to 222 conditions per place. [2022-12-13 07:51:02,985 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 59 selfloop transitions, 13 changer transitions 13/90 dead transitions. [2022-12-13 07:51:02,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 90 transitions, 1290 flow [2022-12-13 07:51:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 07:51:02,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2022-12-13 07:51:02,988 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2022-12-13 07:51:02,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 90 transitions, 1290 flow [2022-12-13 07:51:02,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 77 transitions, 1093 flow [2022-12-13 07:51:02,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:02,992 INFO L89 Accepts]: Start accepts. Operand has 40 places, 77 transitions, 1093 flow [2022-12-13 07:51:02,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:02,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:02,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 77 transitions, 1093 flow [2022-12-13 07:51:02,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 77 transitions, 1093 flow [2022-12-13 07:51:02,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:02,997 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:02,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:51:02,997 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 77 transitions, 1093 flow [2022-12-13 07:51:02,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:02,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:02,998 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:03,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 07:51:03,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:03,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 709875323, now seen corresponding path program 2 times [2022-12-13 07:51:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:03,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111546360] [2022-12-13 07:51:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:03,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111546360] [2022-12-13 07:51:03,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111546360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:03,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658605433] [2022-12-13 07:51:03,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:51:03,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:03,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:03,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:03,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:51:03,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:03,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:03,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 07:51:03,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:03,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:03,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658605433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:03,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:03,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-13 07:51:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853171736] [2022-12-13 07:51:03,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:03,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 07:51:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:03,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 07:51:03,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:51:03,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:03,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 77 transitions, 1093 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:03,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:03,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:04,092 INFO L130 PetriNetUnfolder]: 278/591 cut-off events. [2022-12-13 07:51:04,092 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-12-13 07:51:04,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 591 events. 278/591 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2961 event pairs, 4 based on Foata normal form. 6/481 useless extension candidates. Maximal degree in co-relation 4257. Up to 553 conditions per place. [2022-12-13 07:51:04,097 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 170 selfloop transitions, 76 changer transitions 26/272 dead transitions. [2022-12-13 07:51:04,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 272 transitions, 4428 flow [2022-12-13 07:51:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 07:51:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 07:51:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 163 transitions. [2022-12-13 07:51:04,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37471264367816093 [2022-12-13 07:51:04,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 48 predicate places. [2022-12-13 07:51:04,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 272 transitions, 4428 flow [2022-12-13 07:51:04,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 246 transitions, 4010 flow [2022-12-13 07:51:04,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:04,112 INFO L89 Accepts]: Start accepts. Operand has 65 places, 246 transitions, 4010 flow [2022-12-13 07:51:04,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:04,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:04,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 246 transitions, 4010 flow [2022-12-13 07:51:04,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 246 transitions, 4010 flow [2022-12-13 07:51:04,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:04,119 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:04,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:51:04,119 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 246 transitions, 4010 flow [2022-12-13 07:51:04,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:04,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:04,120 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:04,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 07:51:04,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:04,329 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash -489833203, now seen corresponding path program 3 times [2022-12-13 07:51:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:04,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749069898] [2022-12-13 07:51:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:04,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749069898] [2022-12-13 07:51:04,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749069898] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:04,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480175676] [2022-12-13 07:51:04,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:51:04,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:04,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:04,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:51:04,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:51:04,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:04,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 07:51:04,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:04,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:04,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480175676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:04,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:04,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-12-13 07:51:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706225950] [2022-12-13 07:51:04,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:04,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 07:51:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:04,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 07:51:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 07:51:04,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:04,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 246 transitions, 4010 flow. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:04,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:04,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:04,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:04,850 INFO L130 PetriNetUnfolder]: 293/574 cut-off events. [2022-12-13 07:51:04,851 INFO L131 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2022-12-13 07:51:04,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 574 events. 293/574 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2676 event pairs, 6 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 4686. Up to 540 conditions per place. [2022-12-13 07:51:04,858 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 240 selfloop transitions, 38 changer transitions 0/278 dead transitions. [2022-12-13 07:51:04,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 278 transitions, 5090 flow [2022-12-13 07:51:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:51:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:51:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-12-13 07:51:04,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46 [2022-12-13 07:51:04,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 54 predicate places. [2022-12-13 07:51:04,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 278 transitions, 5090 flow [2022-12-13 07:51:04,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 278 transitions, 5090 flow [2022-12-13 07:51:04,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:04,871 INFO L89 Accepts]: Start accepts. Operand has 74 places, 278 transitions, 5090 flow [2022-12-13 07:51:04,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:04,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:04,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 278 transitions, 5090 flow [2022-12-13 07:51:04,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 278 transitions, 5090 flow [2022-12-13 07:51:04,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:04,879 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:04,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:51:04,880 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 278 transitions, 5090 flow [2022-12-13 07:51:04,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:04,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:04,881 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:04,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:05,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:05,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1625350405, now seen corresponding path program 4 times [2022-12-13 07:51:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:05,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712272757] [2022-12-13 07:51:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:05,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712272757] [2022-12-13 07:51:05,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712272757] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:05,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089553895] [2022-12-13 07:51:05,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:51:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:05,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:05,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:51:05,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:51:05,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:05,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 07:51:05,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:05,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:05,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089553895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:05,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:05,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-13 07:51:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660721062] [2022-12-13 07:51:05,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:05,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:51:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:51:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:51:05,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:05,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 278 transitions, 5090 flow. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:05,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:05,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:05,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:05,878 INFO L130 PetriNetUnfolder]: 295/578 cut-off events. [2022-12-13 07:51:05,879 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-13 07:51:05,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5802 conditions, 578 events. 295/578 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2682 event pairs, 0 based on Foata normal form. 8/482 useless extension candidates. Maximal degree in co-relation 5270. Up to 544 conditions per place. [2022-12-13 07:51:05,885 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 212 selfloop transitions, 65 changer transitions 8/285 dead transitions. [2022-12-13 07:51:05,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 285 transitions, 5792 flow [2022-12-13 07:51:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 07:51:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 07:51:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 118 transitions. [2022-12-13 07:51:05,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2022-12-13 07:51:05,887 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 73 predicate places. [2022-12-13 07:51:05,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 285 transitions, 5792 flow [2022-12-13 07:51:05,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 277 transitions, 5626 flow [2022-12-13 07:51:05,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:05,900 INFO L89 Accepts]: Start accepts. Operand has 92 places, 277 transitions, 5626 flow [2022-12-13 07:51:05,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:05,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:05,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 277 transitions, 5626 flow [2022-12-13 07:51:05,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 277 transitions, 5626 flow [2022-12-13 07:51:05,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:05,911 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:05,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:51:05,911 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 277 transitions, 5626 flow [2022-12-13 07:51:05,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:05,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:05,912 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:05,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:06,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:06,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1869721497, now seen corresponding path program 5 times [2022-12-13 07:51:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:06,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091314114] [2022-12-13 07:51:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:06,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:06,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091314114] [2022-12-13 07:51:06,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091314114] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:06,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011877702] [2022-12-13 07:51:06,243 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:51:06,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:06,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:06,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:06,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:51:06,283 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:06,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:06,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 07:51:06,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:06,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:06,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011877702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:06,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:06,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 07:51:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566527500] [2022-12-13 07:51:06,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:06,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:51:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:51:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:51:06,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:06,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 277 transitions, 5626 flow. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:06,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:06,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:06,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:06,715 INFO L130 PetriNetUnfolder]: 401/782 cut-off events. [2022-12-13 07:51:06,715 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2022-12-13 07:51:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8630 conditions, 782 events. 401/782 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4004 event pairs, 2 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 7861. Up to 740 conditions per place. [2022-12-13 07:51:06,722 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 307 selfloop transitions, 88 changer transitions 0/395 dead transitions. [2022-12-13 07:51:06,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 395 transitions, 8831 flow [2022-12-13 07:51:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:51:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:51:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-12-13 07:51:06,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2022-12-13 07:51:06,724 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 82 predicate places. [2022-12-13 07:51:06,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 395 transitions, 8831 flow [2022-12-13 07:51:06,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 395 transitions, 8831 flow [2022-12-13 07:51:06,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:06,738 INFO L89 Accepts]: Start accepts. Operand has 102 places, 395 transitions, 8831 flow [2022-12-13 07:51:06,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:06,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:06,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 395 transitions, 8831 flow [2022-12-13 07:51:06,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 395 transitions, 8831 flow [2022-12-13 07:51:06,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:06,747 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:06,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:51:06,747 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 395 transitions, 8831 flow [2022-12-13 07:51:06,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:06,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:06,748 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:06,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 07:51:06,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 07:51:06,952 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:06,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1758003893, now seen corresponding path program 6 times [2022-12-13 07:51:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:06,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548792340] [2022-12-13 07:51:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:07,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548792340] [2022-12-13 07:51:07,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548792340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:07,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764570782] [2022-12-13 07:51:07,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:51:07,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:07,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:07,057 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:07,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:51:07,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:51:07,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:07,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 07:51:07,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:07,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:07,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764570782] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:07,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:07,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-13 07:51:07,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815598352] [2022-12-13 07:51:07,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:07,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:51:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:51:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:51:07,221 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:07,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 395 transitions, 8831 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:07,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:07,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:07,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:07,967 INFO L130 PetriNetUnfolder]: 640/1237 cut-off events. [2022-12-13 07:51:07,967 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-12-13 07:51:07,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14916 conditions, 1237 events. 640/1237 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7146 event pairs, 0 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 13953. Up to 1195 conditions per place. [2022-12-13 07:51:07,976 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 509 selfloop transitions, 135 changer transitions 0/644 dead transitions. [2022-12-13 07:51:07,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 644 transitions, 15714 flow [2022-12-13 07:51:07,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 07:51:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 07:51:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 155 transitions. [2022-12-13 07:51:07,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 07:51:07,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2022-12-13 07:51:07,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 644 transitions, 15714 flow [2022-12-13 07:51:07,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 644 transitions, 15714 flow [2022-12-13 07:51:07,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:08,000 INFO L89 Accepts]: Start accepts. Operand has 125 places, 644 transitions, 15714 flow [2022-12-13 07:51:08,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:08,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:08,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 644 transitions, 15714 flow [2022-12-13 07:51:08,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 644 transitions, 15714 flow [2022-12-13 07:51:08,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:08,016 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:08,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 07:51:08,017 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 644 transitions, 15714 flow [2022-12-13 07:51:08,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:08,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:08,017 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:08,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:08,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:08,222 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1861733983, now seen corresponding path program 7 times [2022-12-13 07:51:08,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:08,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625744496] [2022-12-13 07:51:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:08,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:08,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625744496] [2022-12-13 07:51:08,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625744496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:08,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940983436] [2022-12-13 07:51:08,297 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:51:08,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:08,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:08,298 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:08,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 07:51:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:08,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 07:51:08,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:08,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:08,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940983436] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:08,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:08,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-13 07:51:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734319828] [2022-12-13 07:51:08,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:08,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 07:51:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 07:51:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-13 07:51:08,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:08,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 644 transitions, 15714 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:08,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:08,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:08,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:09,161 INFO L130 PetriNetUnfolder]: 735/1446 cut-off events. [2022-12-13 07:51:09,161 INFO L131 PetriNetUnfolder]: For 372/372 co-relation queries the response was YES. [2022-12-13 07:51:09,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18897 conditions, 1446 events. 735/1446 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8825 event pairs, 10 based on Foata normal form. 6/1212 useless extension candidates. Maximal degree in co-relation 17666. Up to 1404 conditions per place. [2022-12-13 07:51:09,171 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 558 selfloop transitions, 200 changer transitions 6/764 dead transitions. [2022-12-13 07:51:09,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 764 transitions, 20179 flow [2022-12-13 07:51:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:51:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 07:51:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2022-12-13 07:51:09,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2022-12-13 07:51:09,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 126 predicate places. [2022-12-13 07:51:09,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 764 transitions, 20179 flow [2022-12-13 07:51:09,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 758 transitions, 20023 flow [2022-12-13 07:51:09,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:09,196 INFO L89 Accepts]: Start accepts. Operand has 145 places, 758 transitions, 20023 flow [2022-12-13 07:51:09,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:09,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:09,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 758 transitions, 20023 flow [2022-12-13 07:51:09,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 758 transitions, 20023 flow [2022-12-13 07:51:09,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:09,218 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:09,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 07:51:09,218 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 758 transitions, 20023 flow [2022-12-13 07:51:09,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:09,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:09,219 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:09,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:09,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 07:51:09,423 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1517758231, now seen corresponding path program 8 times [2022-12-13 07:51:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:09,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644045531] [2022-12-13 07:51:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644045531] [2022-12-13 07:51:09,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644045531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071216390] [2022-12-13 07:51:09,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:51:09,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:09,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:09,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:09,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 07:51:09,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:09,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:09,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 07:51:09,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:09,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:09,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071216390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:09,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:09,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-13 07:51:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124731567] [2022-12-13 07:51:09,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:09,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:51:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:09,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:51:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:51:09,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:09,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 758 transitions, 20023 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:09,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:09,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:09,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:10,217 INFO L130 PetriNetUnfolder]: 714/1397 cut-off events. [2022-12-13 07:51:10,218 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2022-12-13 07:51:10,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19653 conditions, 1397 events. 714/1397 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8401 event pairs, 2 based on Foata normal form. 8/1177 useless extension candidates. Maximal degree in co-relation 18416. Up to 1355 conditions per place. [2022-12-13 07:51:10,227 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 575 selfloop transitions, 155 changer transitions 8/738 dead transitions. [2022-12-13 07:51:10,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 738 transitions, 20970 flow [2022-12-13 07:51:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:51:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:51:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-12-13 07:51:10,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39487179487179486 [2022-12-13 07:51:10,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 136 predicate places. [2022-12-13 07:51:10,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 738 transitions, 20970 flow [2022-12-13 07:51:10,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 730 transitions, 20740 flow [2022-12-13 07:51:10,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:10,251 INFO L89 Accepts]: Start accepts. Operand has 155 places, 730 transitions, 20740 flow [2022-12-13 07:51:10,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:10,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:10,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 730 transitions, 20740 flow [2022-12-13 07:51:10,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 730 transitions, 20740 flow [2022-12-13 07:51:10,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:10,274 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:10,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 07:51:10,274 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 730 transitions, 20740 flow [2022-12-13 07:51:10,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:10,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:10,276 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:10,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:10,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 07:51:10,481 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1911437604, now seen corresponding path program 9 times [2022-12-13 07:51:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:10,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778229158] [2022-12-13 07:51:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:10,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:10,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778229158] [2022-12-13 07:51:10,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778229158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:10,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425771143] [2022-12-13 07:51:10,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:51:10,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:10,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:10,580 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:10,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 07:51:10,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:51:10,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 07:51:10,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:51:10,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:51:10,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425771143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:10,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:10,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 07:51:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51261995] [2022-12-13 07:51:10,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:10,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:51:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:10,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:51:10,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:51:10,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 07:51:10,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 730 transitions, 20740 flow. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:10,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:10,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 07:51:10,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:11,161 INFO L130 PetriNetUnfolder]: 880/1768 cut-off events. [2022-12-13 07:51:11,161 INFO L131 PetriNetUnfolder]: For 564/564 co-relation queries the response was YES. [2022-12-13 07:51:11,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26633 conditions, 1768 events. 880/1768 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 11513 event pairs, 4 based on Foata normal form. 13/1515 useless extension candidates. Maximal degree in co-relation 25142. Up to 1726 conditions per place. [2022-12-13 07:51:11,172 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 649 selfloop transitions, 101 changer transitions 171/930 dead transitions. [2022-12-13 07:51:11,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 930 transitions, 28298 flow [2022-12-13 07:51:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 07:51:11,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2022-12-13 07:51:11,174 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 139 predicate places. [2022-12-13 07:51:11,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 930 transitions, 28298 flow [2022-12-13 07:51:11,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 759 transitions, 23039 flow [2022-12-13 07:51:11,199 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:11,199 INFO L89 Accepts]: Start accepts. Operand has 152 places, 759 transitions, 23039 flow [2022-12-13 07:51:11,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:11,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:11,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 759 transitions, 23039 flow [2022-12-13 07:51:11,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 759 transitions, 23039 flow [2022-12-13 07:51:11,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:11,220 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:11,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 07:51:11,221 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 759 transitions, 23039 flow [2022-12-13 07:51:11,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:11,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:11,221 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:11,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:11,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 07:51:11,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1355798280, now seen corresponding path program 10 times [2022-12-13 07:51:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533444774] [2022-12-13 07:51:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533444774] [2022-12-13 07:51:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533444774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157203610] [2022-12-13 07:51:11,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:51:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:11,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:11,599 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:11,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 07:51:11,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:51:11,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:11,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:11,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:11,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:11,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157203610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:11,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:11,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-13 07:51:11,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235600909] [2022-12-13 07:51:11,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:11,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 07:51:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:11,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 07:51:11,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-13 07:51:11,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:11,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 759 transitions, 23039 flow. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:11,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:11,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:11,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:12,910 INFO L130 PetriNetUnfolder]: 1583/3164 cut-off events. [2022-12-13 07:51:12,910 INFO L131 PetriNetUnfolder]: For 869/869 co-relation queries the response was YES. [2022-12-13 07:51:12,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50834 conditions, 3164 events. 1583/3164 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 22876 event pairs, 20 based on Foata normal form. 0/2712 useless extension candidates. Maximal degree in co-relation 48111. Up to 3110 conditions per place. [2022-12-13 07:51:12,960 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 1487 selfloop transitions, 194 changer transitions 0/1681 dead transitions. [2022-12-13 07:51:12,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1681 transitions, 54490 flow [2022-12-13 07:51:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 07:51:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 07:51:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-13 07:51:12,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4627450980392157 [2022-12-13 07:51:12,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 148 predicate places. [2022-12-13 07:51:12,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 1681 transitions, 54490 flow [2022-12-13 07:51:13,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 1681 transitions, 54490 flow [2022-12-13 07:51:13,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:13,024 INFO L89 Accepts]: Start accepts. Operand has 168 places, 1681 transitions, 54490 flow [2022-12-13 07:51:13,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:13,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:13,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 1681 transitions, 54490 flow [2022-12-13 07:51:13,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 1681 transitions, 54490 flow [2022-12-13 07:51:13,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:13,094 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:13,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 07:51:13,094 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 1681 transitions, 54490 flow [2022-12-13 07:51:13,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:13,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:13,095 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:13,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:13,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:51:13,300 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1332166296, now seen corresponding path program 11 times [2022-12-13 07:51:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:13,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300685169] [2022-12-13 07:51:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:13,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300685169] [2022-12-13 07:51:13,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300685169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:13,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428441398] [2022-12-13 07:51:13,408 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:51:13,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:13,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:13,410 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:13,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 07:51:13,457 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:13,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:13,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 07:51:13,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:13,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:13,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428441398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:13,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:13,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-12-13 07:51:13,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753939756] [2022-12-13 07:51:13,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:13,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:51:13,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:13,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:51:13,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:51:13,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:13,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 1681 transitions, 54490 flow. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:13,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:13,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:13,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:15,941 INFO L130 PetriNetUnfolder]: 1717/3416 cut-off events. [2022-12-13 07:51:15,941 INFO L131 PetriNetUnfolder]: For 908/908 co-relation queries the response was YES. [2022-12-13 07:51:15,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58306 conditions, 3416 events. 1717/3416 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 25008 event pairs, 16 based on Foata normal form. 0/2938 useless extension candidates. Maximal degree in co-relation 55415. Up to 3362 conditions per place. [2022-12-13 07:51:15,965 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 1419 selfloop transitions, 406 changer transitions 0/1825 dead transitions. [2022-12-13 07:51:15,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1825 transitions, 62817 flow [2022-12-13 07:51:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:51:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 07:51:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 120 transitions. [2022-12-13 07:51:15,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 07:51:15,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 168 predicate places. [2022-12-13 07:51:15,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 1825 transitions, 62817 flow [2022-12-13 07:51:16,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 1825 transitions, 62817 flow [2022-12-13 07:51:16,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:16,033 INFO L89 Accepts]: Start accepts. Operand has 188 places, 1825 transitions, 62817 flow [2022-12-13 07:51:16,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:16,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:16,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 1825 transitions, 62817 flow [2022-12-13 07:51:16,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 1825 transitions, 62817 flow [2022-12-13 07:51:16,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:16,088 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:16,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 07:51:16,088 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 1825 transitions, 62817 flow [2022-12-13 07:51:16,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:16,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:16,089 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:16,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 07:51:16,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:16,293 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 722813386, now seen corresponding path program 12 times [2022-12-13 07:51:16,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:16,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164863817] [2022-12-13 07:51:16,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:16,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164863817] [2022-12-13 07:51:16,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164863817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:16,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828912014] [2022-12-13 07:51:16,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:51:16,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:16,458 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:16,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 07:51:16,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:51:16,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:16,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:16,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:16,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:16,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828912014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:16,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:16,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-13 07:51:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523481444] [2022-12-13 07:51:16,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:16,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:51:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:51:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:51:16,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:16,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1825 transitions, 62817 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:16,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:16,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:16,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:19,722 INFO L130 PetriNetUnfolder]: 1873/3746 cut-off events. [2022-12-13 07:51:19,723 INFO L131 PetriNetUnfolder]: For 969/969 co-relation queries the response was YES. [2022-12-13 07:51:19,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67696 conditions, 3746 events. 1873/3746 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 28168 event pairs, 20 based on Foata normal form. 48/3274 useless extension candidates. Maximal degree in co-relation 64637. Up to 3692 conditions per place. [2022-12-13 07:51:19,749 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 1619 selfloop transitions, 338 changer transitions 72/2029 dead transitions. [2022-12-13 07:51:19,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 2029 transitions, 73910 flow [2022-12-13 07:51:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 07:51:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 07:51:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 213 transitions. [2022-12-13 07:51:19,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4057142857142857 [2022-12-13 07:51:19,751 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 202 predicate places. [2022-12-13 07:51:19,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 2029 transitions, 73910 flow [2022-12-13 07:51:19,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 1957 transitions, 71264 flow [2022-12-13 07:51:19,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:19,817 INFO L89 Accepts]: Start accepts. Operand has 222 places, 1957 transitions, 71264 flow [2022-12-13 07:51:19,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:19,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:19,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 1957 transitions, 71264 flow [2022-12-13 07:51:19,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 1957 transitions, 71264 flow [2022-12-13 07:51:19,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:19,873 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:19,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 07:51:19,873 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 1957 transitions, 71264 flow [2022-12-13 07:51:19,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:19,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:19,874 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:19,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:20,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 07:51:20,076 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1127906678, now seen corresponding path program 13 times [2022-12-13 07:51:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:20,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11924038] [2022-12-13 07:51:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:20,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11924038] [2022-12-13 07:51:20,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11924038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:20,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750154541] [2022-12-13 07:51:20,240 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:51:20,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:20,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:20,242 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:20,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 07:51:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:20,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:20,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:20,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:20,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750154541] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:20,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:20,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-12-13 07:51:20,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375404840] [2022-12-13 07:51:20,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:51:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:51:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:51:20,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:20,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1957 transitions, 71264 flow. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:20,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:20,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:20,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:24,664 INFO L130 PetriNetUnfolder]: 2255/4476 cut-off events. [2022-12-13 07:51:24,665 INFO L131 PetriNetUnfolder]: For 1059/1059 co-relation queries the response was YES. [2022-12-13 07:51:24,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85379 conditions, 4476 events. 2255/4476 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 34552 event pairs, 32 based on Foata normal form. 10/3830 useless extension candidates. Maximal degree in co-relation 81372. Up to 4422 conditions per place. [2022-12-13 07:51:24,704 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1591 selfloop transitions, 803 changer transitions 10/2404 dead transitions. [2022-12-13 07:51:24,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 2404 transitions, 92356 flow [2022-12-13 07:51:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-13 07:51:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-12-13 07:51:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 324 transitions. [2022-12-13 07:51:24,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36610169491525424 [2022-12-13 07:51:24,706 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 260 predicate places. [2022-12-13 07:51:24,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 2404 transitions, 92356 flow [2022-12-13 07:51:24,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 2394 transitions, 91976 flow [2022-12-13 07:51:24,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:24,792 INFO L89 Accepts]: Start accepts. Operand has 279 places, 2394 transitions, 91976 flow [2022-12-13 07:51:24,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:24,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:24,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 2394 transitions, 91976 flow [2022-12-13 07:51:24,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 2394 transitions, 91976 flow [2022-12-13 07:51:24,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:24,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:24,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 07:51:24,858 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 2394 transitions, 91976 flow [2022-12-13 07:51:24,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:24,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:24,858 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:24,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:25,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 07:51:25,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:25,063 INFO L85 PathProgramCache]: Analyzing trace with hash -267842856, now seen corresponding path program 14 times [2022-12-13 07:51:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:25,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517160838] [2022-12-13 07:51:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:25,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517160838] [2022-12-13 07:51:25,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517160838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:25,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532447263] [2022-12-13 07:51:25,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:51:25,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:25,256 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:25,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 07:51:25,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:25,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:25,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:25,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:25,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532447263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:25,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:25,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-12-13 07:51:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755511293] [2022-12-13 07:51:25,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:25,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:51:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:51:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:51:25,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:25,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 2394 transitions, 91976 flow. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:25,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:25,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:25,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:29,706 INFO L130 PetriNetUnfolder]: 2292/4557 cut-off events. [2022-12-13 07:51:29,706 INFO L131 PetriNetUnfolder]: For 1100/1100 co-relation queries the response was YES. [2022-12-13 07:51:29,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91491 conditions, 4557 events. 2292/4557 cut-off events. For 1100/1100 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 35345 event pairs, 26 based on Foata normal form. 12/3905 useless extension candidates. Maximal degree in co-relation 87235. Up to 4503 conditions per place. [2022-12-13 07:51:29,751 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 1837 selfloop transitions, 598 changer transitions 12/2447 dead transitions. [2022-12-13 07:51:29,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 2447 transitions, 98926 flow [2022-12-13 07:51:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 07:51:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-13 07:51:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 264 transitions. [2022-12-13 07:51:29,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 07:51:29,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 302 predicate places. [2022-12-13 07:51:29,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 2447 transitions, 98926 flow [2022-12-13 07:51:29,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 322 places, 2435 transitions, 98437 flow [2022-12-13 07:51:29,880 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:29,881 INFO L89 Accepts]: Start accepts. Operand has 322 places, 2435 transitions, 98437 flow [2022-12-13 07:51:29,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:29,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:29,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 322 places, 2435 transitions, 98437 flow [2022-12-13 07:51:29,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 322 places, 2435 transitions, 98437 flow [2022-12-13 07:51:29,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:29,973 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:29,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 07:51:29,974 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 2435 transitions, 98437 flow [2022-12-13 07:51:29,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:29,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:29,974 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:29,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:30,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:30,175 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 780578572, now seen corresponding path program 15 times [2022-12-13 07:51:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:30,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150034563] [2022-12-13 07:51:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:30,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:30,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150034563] [2022-12-13 07:51:30,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150034563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:30,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133844823] [2022-12-13 07:51:30,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:51:30,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:30,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:30,309 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:30,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 07:51:30,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:51:30,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:30,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:30,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:30,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:30,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133844823] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:30,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:30,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-13 07:51:30,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129088313] [2022-12-13 07:51:30,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:30,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:51:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:51:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:51:30,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:30,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 2435 transitions, 98437 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:30,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:30,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:30,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:35,212 INFO L130 PetriNetUnfolder]: 2781/5486 cut-off events. [2022-12-13 07:51:35,212 INFO L131 PetriNetUnfolder]: For 1259/1259 co-relation queries the response was YES. [2022-12-13 07:51:35,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115649 conditions, 5486 events. 2781/5486 cut-off events. For 1259/1259 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 43808 event pairs, 24 based on Foata normal form. 0/4682 useless extension candidates. Maximal degree in co-relation 110710. Up to 5432 conditions per place. [2022-12-13 07:51:35,254 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2629 selfloop transitions, 316 changer transitions 0/2945 dead transitions. [2022-12-13 07:51:35,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 2945 transitions, 124976 flow [2022-12-13 07:51:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 07:51:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 07:51:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 231 transitions. [2022-12-13 07:51:35,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39487179487179486 [2022-12-13 07:51:35,256 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 340 predicate places. [2022-12-13 07:51:35,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 360 places, 2945 transitions, 124976 flow [2022-12-13 07:51:35,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 360 places, 2945 transitions, 124976 flow [2022-12-13 07:51:35,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:35,367 INFO L89 Accepts]: Start accepts. Operand has 360 places, 2945 transitions, 124976 flow [2022-12-13 07:51:35,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:35,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:35,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 360 places, 2945 transitions, 124976 flow [2022-12-13 07:51:35,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 360 places, 2945 transitions, 124976 flow [2022-12-13 07:51:35,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:35,449 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:35,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 07:51:35,450 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 2945 transitions, 124976 flow [2022-12-13 07:51:35,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:35,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:35,450 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:35,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:35,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:35,653 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:35,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1700657404, now seen corresponding path program 16 times [2022-12-13 07:51:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:35,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774751248] [2022-12-13 07:51:35,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:35,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:35,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774751248] [2022-12-13 07:51:35,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774751248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034918662] [2022-12-13 07:51:35,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:51:35,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:35,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:35,748 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:35,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 07:51:35,803 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:51:35,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:35,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:35,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:35,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034918662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:35,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:35,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 07:51:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120027194] [2022-12-13 07:51:35,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:35,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:51:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:51:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:51:35,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:35,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 2945 transitions, 124976 flow. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:35,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:35,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:35,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:43,859 INFO L130 PetriNetUnfolder]: 3161/6252 cut-off events. [2022-12-13 07:51:43,860 INFO L131 PetriNetUnfolder]: For 1392/1392 co-relation queries the response was YES. [2022-12-13 07:51:43,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138067 conditions, 6252 events. 3161/6252 cut-off events. For 1392/1392 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 51266 event pairs, 20 based on Foata normal form. 40/5368 useless extension candidates. Maximal degree in co-relation 132491. Up to 6198 conditions per place. [2022-12-13 07:51:43,908 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2861 selfloop transitions, 452 changer transitions 60/3373 dead transitions. [2022-12-13 07:51:43,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 3373 transitions, 149908 flow [2022-12-13 07:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 07:51:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-13 07:51:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 216 transitions. [2022-12-13 07:51:43,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35121951219512193 [2022-12-13 07:51:43,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 380 predicate places. [2022-12-13 07:51:43,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 400 places, 3373 transitions, 149908 flow [2022-12-13 07:51:43,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 398 places, 3313 transitions, 147223 flow [2022-12-13 07:51:44,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:44,037 INFO L89 Accepts]: Start accepts. Operand has 398 places, 3313 transitions, 147223 flow [2022-12-13 07:51:44,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:44,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:44,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 398 places, 3313 transitions, 147223 flow [2022-12-13 07:51:44,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 398 places, 3313 transitions, 147223 flow [2022-12-13 07:51:44,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:44,130 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:44,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 07:51:44,131 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 3313 transitions, 147223 flow [2022-12-13 07:51:44,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:44,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:44,131 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:44,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 07:51:44,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:44,333 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -454921572, now seen corresponding path program 17 times [2022-12-13 07:51:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:44,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013244023] [2022-12-13 07:51:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:44,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013244023] [2022-12-13 07:51:44,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013244023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:44,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904275050] [2022-12-13 07:51:44,429 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:51:44,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:44,431 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:44,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 07:51:44,499 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:51:44,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:44,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:44,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:44,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:44,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904275050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:44,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:44,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-13 07:51:44,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487053711] [2022-12-13 07:51:44,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:44,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:51:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:44,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:51:44,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:51:44,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:44,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 3313 transitions, 147223 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:44,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:44,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:44,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:53,427 INFO L130 PetriNetUnfolder]: 3497/6834 cut-off events. [2022-12-13 07:51:53,428 INFO L131 PetriNetUnfolder]: For 1467/1467 co-relation queries the response was YES. [2022-12-13 07:51:53,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157749 conditions, 6834 events. 3497/6834 cut-off events. For 1467/1467 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 56189 event pairs, 20 based on Foata normal form. 0/5850 useless extension candidates. Maximal degree in co-relation 151876. Up to 6780 conditions per place. [2022-12-13 07:51:53,489 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3422 selfloop transitions, 268 changer transitions 0/3690 dead transitions. [2022-12-13 07:51:53,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 3690 transitions, 171362 flow [2022-12-13 07:51:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 07:51:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 07:51:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 217 transitions. [2022-12-13 07:51:53,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40185185185185185 [2022-12-13 07:51:53,491 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 413 predicate places. [2022-12-13 07:51:53,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 433 places, 3690 transitions, 171362 flow [2022-12-13 07:51:53,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 433 places, 3690 transitions, 171362 flow [2022-12-13 07:51:53,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:53,654 INFO L89 Accepts]: Start accepts. Operand has 433 places, 3690 transitions, 171362 flow [2022-12-13 07:51:53,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:53,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:53,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 433 places, 3690 transitions, 171362 flow [2022-12-13 07:51:53,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 433 places, 3690 transitions, 171362 flow [2022-12-13 07:51:53,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:53,880 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:53,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-13 07:51:53,881 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 3690 transitions, 171362 flow [2022-12-13 07:51:53,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:53,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:53,881 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:53,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:54,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 07:51:54,084 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:51:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1245278262, now seen corresponding path program 18 times [2022-12-13 07:51:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:54,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448029991] [2022-12-13 07:51:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:54,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448029991] [2022-12-13 07:51:54,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448029991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:54,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745882154] [2022-12-13 07:51:54,202 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:51:54,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:54,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:54,203 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:54,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 07:51:54,267 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:51:54,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:54,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:51:54,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:54,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:54,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745882154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:54,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:54,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-13 07:51:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471430562] [2022-12-13 07:51:54,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:54,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:51:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:51:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:51:54,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:51:54,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 3690 transitions, 171362 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:54,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:54,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:51:54,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:04,122 INFO L130 PetriNetUnfolder]: 3718/7265 cut-off events. [2022-12-13 07:52:04,122 INFO L131 PetriNetUnfolder]: For 1531/1531 co-relation queries the response was YES. [2022-12-13 07:52:04,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174966 conditions, 7265 events. 3718/7265 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 60228 event pairs, 24 based on Foata normal form. 40/6259 useless extension candidates. Maximal degree in co-relation 168841. Up to 7211 conditions per place. [2022-12-13 07:52:04,186 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 3545 selfloop transitions, 325 changer transitions 80/3950 dead transitions. [2022-12-13 07:52:04,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 3950 transitions, 191336 flow [2022-12-13 07:52:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 07:52:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 07:52:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 163 transitions. [2022-12-13 07:52:04,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4024691358024691 [2022-12-13 07:52:04,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 439 predicate places. [2022-12-13 07:52:04,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 459 places, 3950 transitions, 191336 flow [2022-12-13 07:52:04,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 458 places, 3870 transitions, 187439 flow [2022-12-13 07:52:04,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:04,363 INFO L89 Accepts]: Start accepts. Operand has 458 places, 3870 transitions, 187439 flow [2022-12-13 07:52:04,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:04,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:04,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 3870 transitions, 187439 flow [2022-12-13 07:52:04,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 458 places, 3870 transitions, 187439 flow [2022-12-13 07:52:04,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:04,507 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:04,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 07:52:04,508 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 3870 transitions, 187439 flow [2022-12-13 07:52:04,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:04,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:04,508 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:04,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 07:52:04,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 07:52:04,711 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:52:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash -565815316, now seen corresponding path program 19 times [2022-12-13 07:52:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:04,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205507344] [2022-12-13 07:52:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:04,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:04,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205507344] [2022-12-13 07:52:04,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205507344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:04,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655577241] [2022-12-13 07:52:04,813 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:52:04,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:04,825 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:52:04,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 07:52:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:04,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:52:04,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:04,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:05,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655577241] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:05,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:05,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-13 07:52:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340968884] [2022-12-13 07:52:05,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:05,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:52:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:05,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:52:05,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:52:05,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:52:05,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 3870 transitions, 187439 flow. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:05,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:05,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:52:05,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:16,107 INFO L130 PetriNetUnfolder]: 3885/7538 cut-off events. [2022-12-13 07:52:16,107 INFO L131 PetriNetUnfolder]: For 1569/1569 co-relation queries the response was YES. [2022-12-13 07:52:16,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189073 conditions, 7538 events. 3885/7538 cut-off events. For 1569/1569 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 62481 event pairs, 24 based on Foata normal form. 0/6478 useless extension candidates. Maximal degree in co-relation 182696. Up to 7484 conditions per place. [2022-12-13 07:52:16,173 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3895 selfloop transitions, 200 changer transitions 0/4095 dead transitions. [2022-12-13 07:52:16,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 4095 transitions, 206534 flow [2022-12-13 07:52:16,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 07:52:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 07:52:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 205 transitions. [2022-12-13 07:52:16,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2022-12-13 07:52:16,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 473 predicate places. [2022-12-13 07:52:16,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 4095 transitions, 206534 flow [2022-12-13 07:52:16,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 493 places, 4095 transitions, 206534 flow [2022-12-13 07:52:16,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:16,368 INFO L89 Accepts]: Start accepts. Operand has 493 places, 4095 transitions, 206534 flow [2022-12-13 07:52:16,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:16,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:16,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 493 places, 4095 transitions, 206534 flow [2022-12-13 07:52:16,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 493 places, 4095 transitions, 206534 flow [2022-12-13 07:52:16,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:16,554 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:16,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-13 07:52:16,555 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 4095 transitions, 206534 flow [2022-12-13 07:52:16,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:16,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:16,555 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:16,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 07:52:16,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:16,762 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:52:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1175168226, now seen corresponding path program 20 times [2022-12-13 07:52:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:16,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421325822] [2022-12-13 07:52:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:16,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421325822] [2022-12-13 07:52:16,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421325822] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:16,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875329094] [2022-12-13 07:52:16,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:52:16,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:16,858 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:52:16,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 07:52:16,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:52:16,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:52:16,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:16,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:17,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875329094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:17,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:17,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-13 07:52:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545967235] [2022-12-13 07:52:17,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:52:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:52:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:52:17,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:52:17,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 4095 transitions, 206534 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:17,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:17,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:52:17,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:30,526 INFO L130 PetriNetUnfolder]: 4275/8316 cut-off events. [2022-12-13 07:52:30,527 INFO L131 PetriNetUnfolder]: For 1677/1677 co-relation queries the response was YES. [2022-12-13 07:52:30,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216916 conditions, 8316 events. 4275/8316 cut-off events. For 1677/1677 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 70122 event pairs, 18 based on Foata normal form. 40/7160 useless extension candidates. Maximal degree in co-relation 209757. Up to 8262 conditions per place. [2022-12-13 07:52:30,607 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 3951 selfloop transitions, 505 changer transitions 61/4517 dead transitions. [2022-12-13 07:52:30,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 4517 transitions, 236872 flow [2022-12-13 07:52:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:52:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 07:52:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 189 transitions. [2022-12-13 07:52:30,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-13 07:52:30,608 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 502 predicate places. [2022-12-13 07:52:30,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 522 places, 4517 transitions, 236872 flow [2022-12-13 07:52:30,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 522 places, 4456 transitions, 233655 flow [2022-12-13 07:52:30,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:30,941 INFO L89 Accepts]: Start accepts. Operand has 522 places, 4456 transitions, 233655 flow [2022-12-13 07:52:30,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:30,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:30,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 522 places, 4456 transitions, 233655 flow [2022-12-13 07:52:31,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 522 places, 4456 transitions, 233655 flow [2022-12-13 07:52:31,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:31,104 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:31,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 07:52:31,104 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 4456 transitions, 233655 flow [2022-12-13 07:52:31,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:31,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:31,105 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:31,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 07:52:31,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:31,309 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:52:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1269079006, now seen corresponding path program 21 times [2022-12-13 07:52:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:31,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866242811] [2022-12-13 07:52:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:31,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866242811] [2022-12-13 07:52:31,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866242811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:31,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823272653] [2022-12-13 07:52:31,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:52:31,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:31,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:31,469 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:52:31,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 07:52:31,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 07:52:31,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:31,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:52:31,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:31,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:31,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823272653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:31,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:31,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-12-13 07:52:31,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170628138] [2022-12-13 07:52:31,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:31,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:52:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:31,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:52:31,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-12-13 07:52:31,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:52:31,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 4456 transitions, 233655 flow. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:31,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:31,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:52:31,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:50,242 INFO L130 PetriNetUnfolder]: 4501/8774 cut-off events. [2022-12-13 07:52:50,242 INFO L131 PetriNetUnfolder]: For 1767/1767 co-relation queries the response was YES. [2022-12-13 07:52:50,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237643 conditions, 8774 events. 4501/8774 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 74828 event pairs, 48 based on Foata normal form. 12/7524 useless extension candidates. Maximal degree in co-relation 229442. Up to 8720 conditions per place. [2022-12-13 07:52:50,328 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3306 selfloop transitions, 1477 changer transitions 12/4795 dead transitions. [2022-12-13 07:52:50,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 4795 transitions, 261008 flow [2022-12-13 07:52:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-13 07:52:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-13 07:52:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 256 transitions. [2022-12-13 07:52:50,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3413333333333333 [2022-12-13 07:52:50,330 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 551 predicate places. [2022-12-13 07:52:50,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 571 places, 4795 transitions, 261008 flow [2022-12-13 07:52:50,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 570 places, 4783 transitions, 260360 flow [2022-12-13 07:52:50,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:50,579 INFO L89 Accepts]: Start accepts. Operand has 570 places, 4783 transitions, 260360 flow [2022-12-13 07:52:50,644 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:50,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:50,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 570 places, 4783 transitions, 260360 flow [2022-12-13 07:52:50,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 570 places, 4783 transitions, 260360 flow [2022-12-13 07:52:50,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:50,797 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:50,797 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-13 07:52:50,798 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 4783 transitions, 260360 flow [2022-12-13 07:52:50,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:50,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:50,798 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:50,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 07:52:51,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 07:52:51,001 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:52:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2110413208, now seen corresponding path program 22 times [2022-12-13 07:52:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:51,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145115298] [2022-12-13 07:52:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:51,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:51,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145115298] [2022-12-13 07:52:51,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145115298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:51,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119382314] [2022-12-13 07:52:51,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:52:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:51,162 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:52:51,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 07:52:51,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:52:51,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:51,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 07:52:51,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:51,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:51,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119382314] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:51,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:51,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-12-13 07:52:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822522244] [2022-12-13 07:52:51,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:51,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:52:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:52:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-12-13 07:52:51,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:52:51,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 4783 transitions, 260360 flow. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:51,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:51,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:52:51,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:11,639 INFO L130 PetriNetUnfolder]: 4518/8815 cut-off events. [2022-12-13 07:53:11,639 INFO L131 PetriNetUnfolder]: For 1808/1808 co-relation queries the response was YES. [2022-12-13 07:53:11,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247577 conditions, 8815 events. 4518/8815 cut-off events. For 1808/1808 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 75359 event pairs, 42 based on Foata normal form. 28/7581 useless extension candidates. Maximal degree in co-relation 239190. Up to 8761 conditions per place. [2022-12-13 07:53:11,729 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 3732 selfloop transitions, 1056 changer transitions 28/4816 dead transitions. [2022-12-13 07:53:11,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 4816 transitions, 271807 flow [2022-12-13 07:53:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 07:53:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 07:53:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 207 transitions. [2022-12-13 07:53:11,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40588235294117647 [2022-12-13 07:53:11,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 582 predicate places. [2022-12-13 07:53:11,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 602 places, 4816 transitions, 271807 flow [2022-12-13 07:53:11,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 602 places, 4788 transitions, 270218 flow [2022-12-13 07:53:11,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:11,973 INFO L89 Accepts]: Start accepts. Operand has 602 places, 4788 transitions, 270218 flow [2022-12-13 07:53:12,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:12,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:12,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 602 places, 4788 transitions, 270218 flow [2022-12-13 07:53:12,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 602 places, 4788 transitions, 270218 flow [2022-12-13 07:53:12,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:53:12,230 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:12,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-13 07:53:12,231 INFO L495 AbstractCegarLoop]: Abstraction has has 602 places, 4788 transitions, 270218 flow [2022-12-13 07:53:12,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:12,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:12,231 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:12,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 07:53:12,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 07:53:12,432 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:53:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1200296397, now seen corresponding path program 23 times [2022-12-13 07:53:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:12,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787678580] [2022-12-13 07:53:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787678580] [2022-12-13 07:53:12,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787678580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:53:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222089103] [2022-12-13 07:53:12,546 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:53:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:53:12,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:53:12,548 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:53:12,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 07:53:12,628 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 07:53:12,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:53:12,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 07:53:12,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:53:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:53:12,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:53:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:53:12,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222089103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:53:12,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:53:12,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2022-12-13 07:53:12,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821933276] [2022-12-13 07:53:12,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:53:12,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:53:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:53:12,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:53:12,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-13 07:53:12,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 4788 transitions, 270218 flow. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:12,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:12,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-13 07:53:12,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:41,485 INFO L130 PetriNetUnfolder]: 5721/11267 cut-off events. [2022-12-13 07:53:41,486 INFO L131 PetriNetUnfolder]: For 2302/2302 co-relation queries the response was YES. [2022-12-13 07:53:41,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327772 conditions, 11267 events. 5721/11267 cut-off events. For 2302/2302 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 100929 event pairs, 40 based on Foata normal form. 39/9708 useless extension candidates. Maximal degree in co-relation 317036. Up to 11213 conditions per place. [2022-12-13 07:53:41,600 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 4726 selfloop transitions, 857 changer transitions 523/6108 dead transitions. [2022-12-13 07:53:41,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 6108 transitions, 357043 flow [2022-12-13 07:53:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:53:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:53:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-12-13 07:53:41,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-13 07:53:41,601 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 592 predicate places. [2022-12-13 07:53:41,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 612 places, 6108 transitions, 357043 flow [2022-12-13 07:53:41,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 598 places, 5585 transitions, 326295 flow [2022-12-13 07:53:41,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:41,902 INFO L89 Accepts]: Start accepts. Operand has 598 places, 5585 transitions, 326295 flow [2022-12-13 07:53:42,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:42,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:42,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 598 places, 5585 transitions, 326295 flow [2022-12-13 07:53:42,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 598 places, 5585 transitions, 326295 flow [2022-12-13 07:53:42,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:53:42,232 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:42,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-13 07:53:42,233 INFO L495 AbstractCegarLoop]: Abstraction has has 598 places, 5585 transitions, 326295 flow [2022-12-13 07:53:42,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:42,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:42,233 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:42,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 07:53:42,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 07:53:42,438 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:53:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1701225239, now seen corresponding path program 24 times [2022-12-13 07:53:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:42,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794613825] [2022-12-13 07:53:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:42,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:42,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794613825] [2022-12-13 07:53:42,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794613825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:53:42,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408407291] [2022-12-13 07:53:42,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:53:42,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:53:42,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:53:42,573 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:53:42,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 07:53:42,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 07:53:42,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:53:42,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 07:53:42,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:53:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:42,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:53:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:42,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408407291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:53:42,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:53:42,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2022-12-13 07:53:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990205474] [2022-12-13 07:53:42,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:53:42,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:53:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:42,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:53:42,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:53:42,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:53:42,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 5585 transitions, 326295 flow. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:42,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:42,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:53:42,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:35,550 INFO L130 PetriNetUnfolder]: 9414/18503 cut-off events. [2022-12-13 07:54:35,550 INFO L131 PetriNetUnfolder]: For 3559/3559 co-relation queries the response was YES. [2022-12-13 07:54:35,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556766 conditions, 18503 events. 9414/18503 cut-off events. For 3559/3559 co-relation queries the response was YES. Maximal size of possible extension queue 1439. Compared 177045 event pairs, 98 based on Foata normal form. 0/15977 useless extension candidates. Maximal degree in co-relation 538867. Up to 18437 conditions per place. [2022-12-13 07:54:35,743 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 9186 selfloop transitions, 939 changer transitions 0/10125 dead transitions. [2022-12-13 07:54:35,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 10125 transitions, 612037 flow [2022-12-13 07:54:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 07:54:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 07:54:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 179 transitions. [2022-12-13 07:54:35,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45897435897435895 [2022-12-13 07:54:35,745 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 603 predicate places. [2022-12-13 07:54:35,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 623 places, 10125 transitions, 612037 flow [2022-12-13 07:54:36,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 623 places, 10125 transitions, 612037 flow [2022-12-13 07:54:36,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:36,375 INFO L89 Accepts]: Start accepts. Operand has 623 places, 10125 transitions, 612037 flow [2022-12-13 07:54:36,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:36,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:36,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 623 places, 10125 transitions, 612037 flow [2022-12-13 07:54:36,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 623 places, 10125 transitions, 612037 flow [2022-12-13 07:54:36,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:54:36,956 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:54:36,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 582 [2022-12-13 07:54:36,957 INFO L495 AbstractCegarLoop]: Abstraction has has 623 places, 10125 transitions, 612037 flow [2022-12-13 07:54:36,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:36,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:36,957 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:54:36,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 07:54:37,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 07:54:37,162 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:54:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 968633735, now seen corresponding path program 25 times [2022-12-13 07:54:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:37,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332313153] [2022-12-13 07:54:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:37,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:37,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332313153] [2022-12-13 07:54:37,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332313153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:54:37,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748408827] [2022-12-13 07:54:37,296 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:54:37,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:54:37,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:54:37,297 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:54:37,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 07:54:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:37,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 07:54:37,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:54:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:37,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:54:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:37,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748408827] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:54:37,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:54:37,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-12-13 07:54:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620303581] [2022-12-13 07:54:37,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:54:37,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:54:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:54:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:54:37,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:54:37,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 10125 transitions, 612037 flow. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:37,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:37,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:54:37,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:56:20,274 INFO L130 PetriNetUnfolder]: 9866/19353 cut-off events. [2022-12-13 07:56:20,274 INFO L131 PetriNetUnfolder]: For 3698/3698 co-relation queries the response was YES. [2022-12-13 07:56:20,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601697 conditions, 19353 events. 9866/19353 cut-off events. For 3698/3698 co-relation queries the response was YES. Maximal size of possible extension queue 1531. Compared 186690 event pairs, 88 based on Foata normal form. 0/16749 useless extension candidates. Maximal degree in co-relation 583335. Up to 19287 conditions per place. [2022-12-13 07:56:20,478 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 9531 selfloop transitions, 1084 changer transitions 0/10615 dead transitions. [2022-12-13 07:56:20,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 10615 transitions, 662904 flow [2022-12-13 07:56:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-13 07:56:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-13 07:56:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 358 transitions. [2022-12-13 07:56:20,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4114942528735632 [2022-12-13 07:56:20,480 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 660 predicate places. [2022-12-13 07:56:20,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 680 places, 10615 transitions, 662904 flow [2022-12-13 07:56:20,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 680 places, 10615 transitions, 662904 flow [2022-12-13 07:56:21,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:56:21,172 INFO L89 Accepts]: Start accepts. Operand has 680 places, 10615 transitions, 662904 flow [2022-12-13 07:56:21,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:56:21,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:56:21,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 680 places, 10615 transitions, 662904 flow [2022-12-13 07:56:21,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 680 places, 10615 transitions, 662904 flow [2022-12-13 07:56:21,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:56:21,728 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:56:21,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 557 [2022-12-13 07:56:21,729 INFO L495 AbstractCegarLoop]: Abstraction has has 680 places, 10615 transitions, 662904 flow [2022-12-13 07:56:21,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:56:21,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:56:21,729 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:56:21,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 07:56:21,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:56:21,934 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:56:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:56:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -461303443, now seen corresponding path program 26 times [2022-12-13 07:56:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:56:21,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645851994] [2022-12-13 07:56:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:56:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:56:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:56:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:56:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:56:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645851994] [2022-12-13 07:56:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645851994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:56:22,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712132315] [2022-12-13 07:56:22,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:56:22,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:56:22,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:56:22,081 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:56:22,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 07:56:22,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:56:22,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:56:22,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 07:56:22,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:56:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:56:22,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:56:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:56:22,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712132315] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:56:22,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:56:22,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-12-13 07:56:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390482543] [2022-12-13 07:56:22,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:56:22,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:56:22,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:56:22,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:56:22,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-12-13 07:56:22,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:56:22,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 10615 transitions, 662904 flow. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:56:22,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:56:22,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:56:22,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:25,752 INFO L130 PetriNetUnfolder]: 10372/20275 cut-off events. [2022-12-13 07:58:25,752 INFO L131 PetriNetUnfolder]: For 3794/3794 co-relation queries the response was YES. [2022-12-13 07:58:25,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650625 conditions, 20275 events. 10372/20275 cut-off events. For 3794/3794 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 196600 event pairs, 86 based on Foata normal form. 48/17603 useless extension candidates. Maximal degree in co-relation 632068. Up to 20209 conditions per place. [2022-12-13 07:58:25,985 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 9612 selfloop transitions, 1401 changer transitions 152/11165 dead transitions. [2022-12-13 07:58:25,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 11165 transitions, 719562 flow [2022-12-13 07:58:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-13 07:58:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-12-13 07:58:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 392 transitions. [2022-12-13 07:58:25,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-13 07:58:25,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 723 predicate places. [2022-12-13 07:58:25,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 743 places, 11165 transitions, 719562 flow [2022-12-13 07:58:26,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 743 places, 11013 transitions, 709726 flow [2022-12-13 07:58:26,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:26,792 INFO L89 Accepts]: Start accepts. Operand has 743 places, 11013 transitions, 709726 flow [2022-12-13 07:58:26,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:26,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:26,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 743 places, 11013 transitions, 709726 flow [2022-12-13 07:58:27,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 743 places, 11013 transitions, 709726 flow [2022-12-13 07:58:27,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:58:27,424 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:58:27,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-13 07:58:27,425 INFO L495 AbstractCegarLoop]: Abstraction has has 743 places, 11013 transitions, 709726 flow [2022-12-13 07:58:27,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:27,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:27,425 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:58:27,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 07:58:27,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:58:27,632 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:58:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1251660133, now seen corresponding path program 27 times [2022-12-13 07:58:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:27,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096986292] [2022-12-13 07:58:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:27,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:27,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096986292] [2022-12-13 07:58:27,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096986292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:58:27,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785391297] [2022-12-13 07:58:27,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:58:27,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:58:27,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:58:27,755 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:58:27,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 07:58:27,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 07:58:27,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:58:27,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 07:58:27,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:58:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:27,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:58:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:28,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785391297] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:58:28,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:58:28,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-12-13 07:58:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657246878] [2022-12-13 07:58:28,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:58:28,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:58:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:58:28,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:58:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:58:28,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 07:58:28,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 11013 transitions, 709726 flow. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:28,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:58:28,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 07:58:28,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:01:19,268 INFO L130 PetriNetUnfolder]: 12219/24280 cut-off events. [2022-12-13 08:01:19,269 INFO L131 PetriNetUnfolder]: For 4662/4662 co-relation queries the response was YES. [2022-12-13 08:01:19,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803532 conditions, 24280 events. 12219/24280 cut-off events. For 4662/4662 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 244589 event pairs, 140 based on Foata normal form. 176/21150 useless extension candidates. Maximal degree in co-relation 778238. Up to 24214 conditions per place. [2022-12-13 08:01:19,540 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 10501 selfloop transitions, 2515 changer transitions 324/13340 dead transitions. [2022-12-13 08:01:19,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 817 places, 13340 transitions, 886564 flow [2022-12-13 08:01:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-12-13 08:01:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-12-13 08:01:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 461 transitions. [2022-12-13 08:01:19,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4097777777777778 [2022-12-13 08:01:19,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 797 predicate places. [2022-12-13 08:01:19,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 817 places, 13340 transitions, 886564 flow [2022-12-13 08:01:20,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 817 places, 13016 transitions, 864946 flow [2022-12-13 08:01:20,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:01:20,536 INFO L89 Accepts]: Start accepts. Operand has 817 places, 13016 transitions, 864946 flow [2022-12-13 08:01:20,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:01:20,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:01:20,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 817 places, 13016 transitions, 864946 flow [2022-12-13 08:01:21,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 817 places, 13016 transitions, 864946 flow [2022-12-13 08:01:21,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:01:21,450 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:01:21,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 915 [2022-12-13 08:01:21,451 INFO L495 AbstractCegarLoop]: Abstraction has has 817 places, 13016 transitions, 864946 flow [2022-12-13 08:01:21,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:01:21,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:01:21,451 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:01:21,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 08:01:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 08:01:21,652 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:01:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:01:21,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1192587099, now seen corresponding path program 28 times [2022-12-13 08:01:21,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:01:21,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253548173] [2022-12-13 08:01:21,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:01:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:01:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:01:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:01:21,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253548173] [2022-12-13 08:01:21,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253548173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:01:21,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268191416] [2022-12-13 08:01:21,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:01:21,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:01:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:01:21,798 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:01:21,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 08:01:21,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:01:21,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:01:21,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:01:21,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:01:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:21,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:01:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:22,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268191416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:01:22,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:01:22,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-12-13 08:01:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800591296] [2022-12-13 08:01:22,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:01:22,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 08:01:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:01:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 08:01:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-12-13 08:01:22,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:01:22,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 817 places, 13016 transitions, 864946 flow. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:01:22,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:01:22,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:01:22,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:01:46,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 08:02:08,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-12-13 08:05:09,986 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-13 08:05:09,986 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:05:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-12-13 08:05:09,996 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 08:05:10,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 08:05:10,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:05:10,201 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (23states, 0/15 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 704750 conditions, 20683 events (11037/20682 cut-off events. For 3854/3854 co-relation queries the response was YES. Maximal size of possible extension queue 2023. Compared 206564 event pairs, 88 based on Foata normal form. 21/18709 useless extension candidates. Maximal degree in co-relation 700692. Up to 20616 conditions per place.). [2022-12-13 08:05:10,203 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 08:05:10,203 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 08:05:10,203 INFO L445 BasicCegarLoop]: Path program histogram: [28, 4, 1] [2022-12-13 08:05:10,205 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:05:10,205 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:05:10,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:05:10 BasicIcfg [2022-12-13 08:05:10,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:05:10,207 INFO L158 Benchmark]: Toolchain (without parser) took 852441.43ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 138.0MB in the beginning and 178.5MB in the end (delta: -40.6MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 08:05:10,207 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:05:10,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.15ms. Allocated memory is still 176.2MB. Free memory was 138.0MB in the beginning and 126.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 08:05:10,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.94ms. Allocated memory is still 176.2MB. Free memory was 126.9MB in the beginning and 125.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:05:10,207 INFO L158 Benchmark]: Boogie Preprocessor took 34.57ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 123.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:05:10,208 INFO L158 Benchmark]: RCFGBuilder took 371.87ms. Allocated memory is still 176.2MB. Free memory was 123.8MB in the beginning and 110.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 08:05:10,208 INFO L158 Benchmark]: TraceAbstraction took 851790.41ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 108.6MB in the beginning and 178.5MB in the end (delta: -70.0MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 08:05:10,209 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.15ms. Allocated memory is still 176.2MB. Free memory was 138.0MB in the beginning and 126.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.94ms. Allocated memory is still 176.2MB. Free memory was 126.9MB in the beginning and 125.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.57ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 123.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 371.87ms. Allocated memory is still 176.2MB. Free memory was 123.8MB in the beginning and 110.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 851790.41ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 108.6MB in the beginning and 178.5MB in the end (delta: -70.0MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 71 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 55 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 266, unknown conditional: 0, unknown unconditional: 266] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 22 PlacesBefore, 22 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 24 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, 25 PlacesBefore, 25 PlacesAfterwards, 35 TransitionsBefore, 35 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, 28 PlacesBefore, 28 PlacesAfterwards, 42 TransitionsBefore, 42 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, 34 PlacesBefore, 34 PlacesAfterwards, 61 TransitionsBefore, 61 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, 37 PlacesBefore, 37 PlacesAfterwards, 54 TransitionsBefore, 54 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, 40 PlacesBefore, 40 PlacesAfterwards, 77 TransitionsBefore, 77 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, 65 PlacesBefore, 65 PlacesAfterwards, 246 TransitionsBefore, 246 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 278 TransitionsBefore, 278 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, 92 PlacesBefore, 92 PlacesAfterwards, 277 TransitionsBefore, 277 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, 102 PlacesBefore, 102 PlacesAfterwards, 395 TransitionsBefore, 395 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, 125 PlacesBefore, 125 PlacesAfterwards, 644 TransitionsBefore, 644 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, 145 PlacesBefore, 145 PlacesAfterwards, 758 TransitionsBefore, 758 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, 155 PlacesBefore, 155 PlacesAfterwards, 730 TransitionsBefore, 730 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, 152 PlacesBefore, 152 PlacesAfterwards, 759 TransitionsBefore, 759 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, 168 PlacesBefore, 168 PlacesAfterwards, 1681 TransitionsBefore, 1681 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, 188 PlacesBefore, 188 PlacesAfterwards, 1825 TransitionsBefore, 1825 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, 222 PlacesBefore, 222 PlacesAfterwards, 1957 TransitionsBefore, 1957 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, 279 PlacesBefore, 279 PlacesAfterwards, 2394 TransitionsBefore, 2394 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, 322 PlacesBefore, 322 PlacesAfterwards, 2435 TransitionsBefore, 2435 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, 360 PlacesBefore, 360 PlacesAfterwards, 2945 TransitionsBefore, 2945 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, 398 PlacesBefore, 398 PlacesAfterwards, 3313 TransitionsBefore, 3313 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, 433 PlacesBefore, 433 PlacesAfterwards, 3690 TransitionsBefore, 3690 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, 458 PlacesBefore, 458 PlacesAfterwards, 3870 TransitionsBefore, 3870 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, 493 PlacesBefore, 493 PlacesAfterwards, 4095 TransitionsBefore, 4095 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, 522 PlacesBefore, 522 PlacesAfterwards, 4456 TransitionsBefore, 4456 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, 570 PlacesBefore, 570 PlacesAfterwards, 4783 TransitionsBefore, 4783 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, 602 PlacesBefore, 602 PlacesAfterwards, 4788 TransitionsBefore, 4788 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, 598 PlacesBefore, 598 PlacesAfterwards, 5585 TransitionsBefore, 5585 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, 623 PlacesBefore, 623 PlacesAfterwards, 10125 TransitionsBefore, 10125 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, 680 PlacesBefore, 680 PlacesAfterwards, 10615 TransitionsBefore, 10615 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, 743 PlacesBefore, 743 PlacesAfterwards, 11013 TransitionsBefore, 11013 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, 817 PlacesBefore, 817 PlacesAfterwards, 13016 TransitionsBefore, 13016 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: 76]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (23states, 0/15 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 704750 conditions, 20683 events (11037/20682 cut-off events. For 3854/3854 co-relation queries the response was YES. Maximal size of possible extension queue 2023. Compared 206564 event pairs, 88 based on Foata normal form. 21/18709 useless extension candidates. Maximal degree in co-relation 700692. Up to 20616 conditions per place.). - TimeoutResultAtElement [Line: 70]: 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 (23states, 0/15 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 704750 conditions, 20683 events (11037/20682 cut-off events. For 3854/3854 co-relation queries the response was YES. Maximal size of possible extension queue 2023. Compared 206564 event pairs, 88 based on Foata normal form. 21/18709 useless extension candidates. Maximal degree in co-relation 700692. Up to 20616 conditions per place.). - TimeoutResultAtElement [Line: 71]: 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 (23states, 0/15 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 704750 conditions, 20683 events (11037/20682 cut-off events. For 3854/3854 co-relation queries the response was YES. Maximal size of possible extension queue 2023. Compared 206564 event pairs, 88 based on Foata normal form. 21/18709 useless extension candidates. Maximal degree in co-relation 700692. Up to 20616 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 95 locations, 3 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: 851.6s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.0s, AutomataDifference: 822.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6167 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6167 mSDsluCounter, 559 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 963 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18877 IncrementalHoareTripleChecker+Invalid, 19840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 963 mSolverCounterUnsat, 138 mSDtfsCounter, 18877 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2701 GetRequests, 1488 SyntacticMatches, 58 SemanticMatches, 1155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19537 ImplicationChecksByTransitivity, 90.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864946occurred in iteration=32, InterpolantAutomatonStates: 865, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1105 NumberOfCodeBlocks, 1083 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 9122 SizeOfPredicates, 94 NumberOfNonLiveVariables, 4129 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 95 InterpolantComputations, 3 PerfectInterpolantSequences, 119/745 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