/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:39:58,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:39:58,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:39:58,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:39:58,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:39:58,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:39:58,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:39:58,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:39:58,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:39:58,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:39:58,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:39:58,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:39:58,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:39:58,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:39:58,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:39:58,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:39:58,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:39:58,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:39:58,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:39:58,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:39:58,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:39:58,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:39:58,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:39:58,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:39:58,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:39:58,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:39:58,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:39:58,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:39:58,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:39:58,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:39:58,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:39:58,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:39:58,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:39:58,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:39:58,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:39:58,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:39:58,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:39:58,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:39:58,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:39:58,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:39:58,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:39:58,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:39:58,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:39:58,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:39:58,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:39:58,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:39:58,793 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:39:58,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:39:58,794 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:39:58,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:39:58,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:39:58,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:39:58,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:39:58,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:39:58,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:39:58,795 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:39:58,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:39:58,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:39:58,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:39:58,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:39:58,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:39:58,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:39:58,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:39:58,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:39:58,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:39:58,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:39:58,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:39:58,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:39:58,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:39:58,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:39:58,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:39:59,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:39:59,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:39:59,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:39:59,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:39:59,217 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:39:59,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2022-12-06 02:40:00,317 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:40:00,563 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:40:00,563 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2022-12-06 02:40:00,568 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c5c8e2c/433b5e1d93904acaaf5ac2e3b472fc66/FLAGfe12e16aa [2022-12-06 02:40:00,595 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c5c8e2c/433b5e1d93904acaaf5ac2e3b472fc66 [2022-12-06 02:40:00,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:40:00,598 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:40:00,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:40:00,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:40:00,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:40:00,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad67cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00, skipping insertion in model container [2022-12-06 02:40:00,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:40:00,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:40:00,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:40:00,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:40:00,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:40:00,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:40:00,837 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-figure1-alt.wvr.c[2087,2100] [2022-12-06 02:40:00,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:40:00,851 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:40:00,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:40:00,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:40:00,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:40:00,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:40:00,878 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-figure1-alt.wvr.c[2087,2100] [2022-12-06 02:40:00,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:40:00,895 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:40:00,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00 WrapperNode [2022-12-06 02:40:00,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:40:00,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:40:00,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:40:00,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:40:00,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,930 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2022-12-06 02:40:00,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:40:00,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:40:00,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:40:00,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:40:00,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,959 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:40:00,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:40:00,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:40:00,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:40:00,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (1/1) ... [2022-12-06 02:40:00,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:40:00,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:00,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:40:01,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:40:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:40:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:40:01,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:40:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:40:01,030 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:40:01,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:40:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:40:01,031 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:40:01,122 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:40:01,123 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:40:01,294 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:40:01,342 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:40:01,343 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 02:40:01,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:40:01 BoogieIcfgContainer [2022-12-06 02:40:01,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:40:01,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:40:01,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:40:01,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:40:01,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:40:00" (1/3) ... [2022-12-06 02:40:01,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438bc890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:40:01, skipping insertion in model container [2022-12-06 02:40:01,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:40:00" (2/3) ... [2022-12-06 02:40:01,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438bc890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:40:01, skipping insertion in model container [2022-12-06 02:40:01,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:40:01" (3/3) ... [2022-12-06 02:40:01,350 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2022-12-06 02:40:01,363 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:40:01,363 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:40:01,363 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:40:01,402 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 02:40:01,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 180 flow [2022-12-06 02:40:01,481 INFO L130 PetriNetUnfolder]: 6/80 cut-off events. [2022-12-06 02:40:01,481 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:40:01,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 6/80 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/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 02:40:01,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 180 flow [2022-12-06 02:40:01,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 72 transitions, 156 flow [2022-12-06 02:40:01,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:01,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 72 transitions, 156 flow [2022-12-06 02:40:01,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 72 transitions, 156 flow [2022-12-06 02:40:01,529 INFO L130 PetriNetUnfolder]: 6/72 cut-off events. [2022-12-06 02:40:01,529 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:40:01,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 6/72 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/66 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 02:40:01,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 72 transitions, 156 flow [2022-12-06 02:40:01,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 02:40:03,634 INFO L203 LiptonReduction]: Total number of compositions: 57 [2022-12-06 02:40:03,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:40:03,653 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;@25c6c00e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:40:03,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 02:40:03,662 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 02:40:03,662 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:40:03,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:03,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:03,663 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-06 02:40:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1479609409, now seen corresponding path program 1 times [2022-12-06 02:40:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:03,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357254568] [2022-12-06 02:40:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:04,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:04,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357254568] [2022-12-06 02:40:04,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357254568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:40:04,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:40:04,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:40:04,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303595635] [2022-12-06 02:40:04,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:40:04,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:40:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:40:04,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:40:04,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:04,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:04,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:04,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:04,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:04,347 INFO L130 PetriNetUnfolder]: 76/144 cut-off events. [2022-12-06 02:40:04,348 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 02:40:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 144 events. 76/144 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 405 event pairs, 14 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 232. Up to 81 conditions per place. [2022-12-06 02:40:04,350 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 33 selfloop transitions, 9 changer transitions 5/47 dead transitions. [2022-12-06 02:40:04,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 47 transitions, 221 flow [2022-12-06 02:40:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:40:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:40:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-12-06 02:40:04,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-06 02:40:04,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-06 02:40:04,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:04,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 47 transitions, 221 flow [2022-12-06 02:40:04,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 47 transitions, 221 flow [2022-12-06 02:40:04,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:04,365 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:04,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:40:04,366 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 47 transitions, 221 flow [2022-12-06 02:40:04,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:04,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:04,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:04,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:40:04,367 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-06 02:40:04,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash -239231791, now seen corresponding path program 2 times [2022-12-06 02:40:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:04,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968377566] [2022-12-06 02:40:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:04,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968377566] [2022-12-06 02:40:04,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968377566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:40:04,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:40:04,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:40:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723019144] [2022-12-06 02:40:04,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:40:04,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:40:04,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:40:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:40:04,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:04,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 47 transitions, 221 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:04,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:04,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:04,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:04,682 INFO L130 PetriNetUnfolder]: 88/175 cut-off events. [2022-12-06 02:40:04,682 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 02:40:04,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 175 events. 88/175 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 572 event pairs, 8 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 446. Up to 101 conditions per place. [2022-12-06 02:40:04,684 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 52 selfloop transitions, 17 changer transitions 10/79 dead transitions. [2022-12-06 02:40:04,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 79 transitions, 528 flow [2022-12-06 02:40:04,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:40:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:40:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-06 02:40:04,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 02:40:04,686 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-06 02:40:04,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:04,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 79 transitions, 528 flow [2022-12-06 02:40:04,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 79 transitions, 528 flow [2022-12-06 02:40:04,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:04,688 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:04,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 02:40:04,689 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 79 transitions, 528 flow [2022-12-06 02:40:04,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:04,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:04,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:04,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:40:04,690 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-06 02:40:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 109443869, now seen corresponding path program 3 times [2022-12-06 02:40:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:04,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718060379] [2022-12-06 02:40:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:04,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718060379] [2022-12-06 02:40:04,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718060379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:40:04,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:40:04,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:40:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047253807] [2022-12-06 02:40:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:40:04,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:40:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:40:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:40:04,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:04,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 79 transitions, 528 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:04,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:04,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:04,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:05,095 INFO L130 PetriNetUnfolder]: 103/209 cut-off events. [2022-12-06 02:40:05,095 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 02:40:05,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 209 events. 103/209 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 746 event pairs, 8 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 718. Up to 111 conditions per place. [2022-12-06 02:40:05,097 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 66 selfloop transitions, 20 changer transitions 15/101 dead transitions. [2022-12-06 02:40:05,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 101 transitions, 877 flow [2022-12-06 02:40:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:40:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:40:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-06 02:40:05,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 02:40:05,099 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2022-12-06 02:40:05,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:05,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 101 transitions, 877 flow [2022-12-06 02:40:05,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 101 transitions, 877 flow [2022-12-06 02:40:05,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:05,111 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:05,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 02:40:05,113 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 101 transitions, 877 flow [2022-12-06 02:40:05,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:05,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:05,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:05,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:40:05,113 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-06 02:40:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:05,114 INFO L85 PathProgramCache]: Analyzing trace with hash 142713689, now seen corresponding path program 4 times [2022-12-06 02:40:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:05,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836440314] [2022-12-06 02:40:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:05,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:05,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:05,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836440314] [2022-12-06 02:40:05,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836440314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:40:05,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:40:05,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:40:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939433207] [2022-12-06 02:40:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:40:05,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:40:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:40:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:40:05,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:05,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 101 transitions, 877 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:05,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:05,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:05,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:05,381 INFO L130 PetriNetUnfolder]: 119/238 cut-off events. [2022-12-06 02:40:05,381 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 02:40:05,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 238 events. 119/238 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 880 event pairs, 12 based on Foata normal form. 1/177 useless extension candidates. Maximal degree in co-relation 1036. Up to 141 conditions per place. [2022-12-06 02:40:05,383 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 67 selfloop transitions, 22 changer transitions 20/109 dead transitions. [2022-12-06 02:40:05,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 109 transitions, 1165 flow [2022-12-06 02:40:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:40:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:40:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-06 02:40:05,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2022-12-06 02:40:05,384 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2022-12-06 02:40:05,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:05,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 109 transitions, 1165 flow [2022-12-06 02:40:05,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 109 transitions, 1165 flow [2022-12-06 02:40:05,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:05,387 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:05,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:40:05,388 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 109 transitions, 1165 flow [2022-12-06 02:40:05,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:05,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:05,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:05,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:40:05,389 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-06 02:40:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 105845637, now seen corresponding path program 5 times [2022-12-06 02:40:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:05,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240776582] [2022-12-06 02:40:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:05,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:05,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240776582] [2022-12-06 02:40:05,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240776582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:40:05,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:40:05,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:40:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231095201] [2022-12-06 02:40:05,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:40:05,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:40:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:05,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:40:05,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:40:05,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:05,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 109 transitions, 1165 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:05,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:05,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:05,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:05,615 INFO L130 PetriNetUnfolder]: 118/242 cut-off events. [2022-12-06 02:40:05,615 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 02:40:05,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 242 events. 118/242 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 929 event pairs, 12 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 1259. Up to 141 conditions per place. [2022-12-06 02:40:05,617 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 68 selfloop transitions, 20 changer transitions 25/113 dead transitions. [2022-12-06 02:40:05,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 113 transitions, 1437 flow [2022-12-06 02:40:05,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:40:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:40:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-06 02:40:05,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-06 02:40:05,618 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 30 predicate places. [2022-12-06 02:40:05,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:05,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 113 transitions, 1437 flow [2022-12-06 02:40:05,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 113 transitions, 1437 flow [2022-12-06 02:40:05,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:05,643 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:05,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 02:40:05,644 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 113 transitions, 1437 flow [2022-12-06 02:40:05,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:05,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:05,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:05,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:40:05,645 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-06 02:40:05,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash 72575817, now seen corresponding path program 6 times [2022-12-06 02:40:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:05,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780742555] [2022-12-06 02:40:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:05,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780742555] [2022-12-06 02:40:05,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780742555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:40:05,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:40:05,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:40:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794018559] [2022-12-06 02:40:05,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:40:05,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:40:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:40:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:40:05,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:05,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 113 transitions, 1437 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:05,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:05,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:05,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:05,927 INFO L130 PetriNetUnfolder]: 118/241 cut-off events. [2022-12-06 02:40:05,928 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 02:40:05,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 241 events. 118/241 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 924 event pairs, 12 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 1466. Up to 141 conditions per place. [2022-12-06 02:40:05,930 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 63 selfloop transitions, 19 changer transitions 30/112 dead transitions. [2022-12-06 02:40:05,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 1649 flow [2022-12-06 02:40:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:40:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:40:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-12-06 02:40:05,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 02:40:05,931 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-06 02:40:05,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:05,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 112 transitions, 1649 flow [2022-12-06 02:40:05,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 112 transitions, 1649 flow [2022-12-06 02:40:05,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:05,935 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:05,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:40:05,935 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 112 transitions, 1649 flow [2022-12-06 02:40:05,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:05,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:05,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:05,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:40:05,936 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-06 02:40:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1055457702, now seen corresponding path program 1 times [2022-12-06 02:40:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:05,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705428298] [2022-12-06 02:40:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:05,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:06,058 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-06 02:40:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705428298] [2022-12-06 02:40:06,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705428298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017831449] [2022-12-06 02:40:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:06,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:06,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:06,062 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-06 02:40:06,102 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-06 02:40:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:06,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:06,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:06,267 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-06 02:40:06,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:06,439 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-06 02:40:06,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017831449] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:06,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:06,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206854313] [2022-12-06 02:40:06,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:06,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:06,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:06,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 112 transitions, 1649 flow. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:06,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:06,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:06,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:07,097 INFO L130 PetriNetUnfolder]: 162/357 cut-off events. [2022-12-06 02:40:07,097 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 02:40:07,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 357 events. 162/357 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1688 event pairs, 0 based on Foata normal form. 2/283 useless extension candidates. Maximal degree in co-relation 2421. Up to 257 conditions per place. [2022-12-06 02:40:07,100 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 83 selfloop transitions, 29 changer transitions 58/170 dead transitions. [2022-12-06 02:40:07,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 170 transitions, 2852 flow [2022-12-06 02:40:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:40:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:40:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 129 transitions. [2022-12-06 02:40:07,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-06 02:40:07,102 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 55 predicate places. [2022-12-06 02:40:07,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:07,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 170 transitions, 2852 flow [2022-12-06 02:40:07,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 170 transitions, 2852 flow [2022-12-06 02:40:07,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:07,108 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:07,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:40:07,109 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 170 transitions, 2852 flow [2022-12-06 02:40:07,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:07,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:07,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:07,116 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-06 02:40:07,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:07,314 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-06 02:40:07,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 644694710, now seen corresponding path program 2 times [2022-12-06 02:40:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:07,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273505545] [2022-12-06 02:40:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:07,458 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-06 02:40:07,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:07,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273505545] [2022-12-06 02:40:07,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273505545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:07,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915247170] [2022-12-06 02:40:07,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:40:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:07,461 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-06 02:40:07,498 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-06 02:40:07,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:07,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:07,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:07,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:07,670 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-06 02:40:07,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:07,836 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-06 02:40:07,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915247170] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:07,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:07,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:07,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597069225] [2022-12-06 02:40:07,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:07,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:07,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:07,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 170 transitions, 2852 flow. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:07,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:07,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:08,518 INFO L130 PetriNetUnfolder]: 194/437 cut-off events. [2022-12-06 02:40:08,518 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-06 02:40:08,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 437 events. 194/437 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2239 event pairs, 0 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 3376. Up to 337 conditions per place. [2022-12-06 02:40:08,521 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 108 selfloop transitions, 44 changer transitions 68/220 dead transitions. [2022-12-06 02:40:08,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 220 transitions, 4128 flow [2022-12-06 02:40:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:40:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:40:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 140 transitions. [2022-12-06 02:40:08,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2022-12-06 02:40:08,529 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2022-12-06 02:40:08,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:08,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 220 transitions, 4128 flow [2022-12-06 02:40:08,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 220 transitions, 4128 flow [2022-12-06 02:40:08,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:08,535 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:08,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:40:08,535 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 220 transitions, 4128 flow [2022-12-06 02:40:08,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:08,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:08,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:08,554 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-06 02:40:08,740 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,SelfDestructingSolverStorable7 [2022-12-06 02:40:08,741 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-06 02:40:08,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash 611424890, now seen corresponding path program 3 times [2022-12-06 02:40:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:08,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475973030] [2022-12-06 02:40:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:08,902 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-06 02:40:08,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:08,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475973030] [2022-12-06 02:40:08,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475973030] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:08,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371628028] [2022-12-06 02:40:08,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:40:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:08,920 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-06 02:40:08,924 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-06 02:40:08,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:40:08,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:08,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:08,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:09,117 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-06 02:40:09,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:09,269 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-06 02:40:09,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371628028] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:09,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:09,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425975311] [2022-12-06 02:40:09,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:09,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:09,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:09,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:09,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:09,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 220 transitions, 4128 flow. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:09,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:09,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:09,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:09,967 INFO L130 PetriNetUnfolder]: 196/447 cut-off events. [2022-12-06 02:40:09,967 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-06 02:40:09,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4561 conditions, 447 events. 196/447 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2342 event pairs, 0 based on Foata normal form. 2/353 useless extension candidates. Maximal degree in co-relation 3849. Up to 347 conditions per place. [2022-12-06 02:40:09,970 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 107 selfloop transitions, 39 changer transitions 78/224 dead transitions. [2022-12-06 02:40:09,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 224 transitions, 4654 flow [2022-12-06 02:40:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:40:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:40:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2022-12-06 02:40:09,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2022-12-06 02:40:09,973 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 94 predicate places. [2022-12-06 02:40:09,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:09,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 224 transitions, 4654 flow [2022-12-06 02:40:09,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 224 transitions, 4654 flow [2022-12-06 02:40:09,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:09,981 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:09,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:40:09,982 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 224 transitions, 4654 flow [2022-12-06 02:40:09,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:09,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:09,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:09,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 02:40:10,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:10,187 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-06 02:40:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:10,187 INFO L85 PathProgramCache]: Analyzing trace with hash 76602074, now seen corresponding path program 4 times [2022-12-06 02:40:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:10,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144574256] [2022-12-06 02:40:10,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:10,330 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-06 02:40:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:10,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144574256] [2022-12-06 02:40:10,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144574256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:10,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700575255] [2022-12-06 02:40:10,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:40:10,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:10,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:10,332 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-06 02:40:10,360 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-06 02:40:10,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:40:10,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:10,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:10,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:10,526 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-06 02:40:10,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:10,645 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-06 02:40:10,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700575255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:10,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:10,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364700158] [2022-12-06 02:40:10,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:10,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:10,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:10,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:10,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:10,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 224 transitions, 4654 flow. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:10,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:10,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:10,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:11,105 INFO L130 PetriNetUnfolder]: 212/488 cut-off events. [2022-12-06 02:40:11,106 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 02:40:11,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5466 conditions, 488 events. 212/488 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2650 event pairs, 2 based on Foata normal form. 2/382 useless extension candidates. Maximal degree in co-relation 4651. Up to 388 conditions per place. [2022-12-06 02:40:11,110 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 120 selfloop transitions, 40 changer transitions 93/253 dead transitions. [2022-12-06 02:40:11,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 253 transitions, 5758 flow [2022-12-06 02:40:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:40:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:40:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2022-12-06 02:40:11,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2022-12-06 02:40:11,112 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 109 predicate places. [2022-12-06 02:40:11,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:11,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 253 transitions, 5758 flow [2022-12-06 02:40:11,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 253 transitions, 5758 flow [2022-12-06 02:40:11,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:11,120 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:11,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:40:11,121 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 253 transitions, 5758 flow [2022-12-06 02:40:11,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:11,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:11,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:11,148 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-06 02:40:11,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:11,327 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-06 02:40:11,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:11,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1761877770, now seen corresponding path program 5 times [2022-12-06 02:40:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:11,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10256233] [2022-12-06 02:40:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:11,460 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-06 02:40:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10256233] [2022-12-06 02:40:11,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10256233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819377396] [2022-12-06 02:40:11,460 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:40:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:11,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:11,462 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-06 02:40:11,462 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-06 02:40:11,529 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:11,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:11,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:11,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:11,687 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-06 02:40:11,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:11,876 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-06 02:40:11,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819377396] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:11,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:11,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614787790] [2022-12-06 02:40:11,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:11,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:11,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:11,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:11,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:11,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 253 transitions, 5758 flow. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:11,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:11,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:11,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:12,620 INFO L130 PetriNetUnfolder]: 271/639 cut-off events. [2022-12-06 02:40:12,620 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-06 02:40:12,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7792 conditions, 639 events. 271/639 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3837 event pairs, 0 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 6415. Up to 532 conditions per place. [2022-12-06 02:40:12,625 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 160 selfloop transitions, 56 changer transitions 117/333 dead transitions. [2022-12-06 02:40:12,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 333 transitions, 8247 flow [2022-12-06 02:40:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:40:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:40:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 123 transitions. [2022-12-06 02:40:12,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43157894736842106 [2022-12-06 02:40:12,627 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 127 predicate places. [2022-12-06 02:40:12,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:12,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 333 transitions, 8247 flow [2022-12-06 02:40:12,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 333 transitions, 8247 flow [2022-12-06 02:40:12,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:12,635 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:12,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:40:12,636 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 333 transitions, 8247 flow [2022-12-06 02:40:12,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:12,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:12,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:12,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:12,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 02:40:12,841 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-06 02:40:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1794945780, now seen corresponding path program 6 times [2022-12-06 02:40:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:12,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884354796] [2022-12-06 02:40:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:12,999 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-06 02:40:12,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:12,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884354796] [2022-12-06 02:40:13,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884354796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:13,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493247886] [2022-12-06 02:40:13,000 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:40:13,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:13,001 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-06 02:40:13,004 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-06 02:40:13,049 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:40:13,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:13,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:13,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:13,286 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-06 02:40:13,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:13,441 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-06 02:40:13,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493247886] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:13,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:13,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653736699] [2022-12-06 02:40:13,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:13,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:13,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:13,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 333 transitions, 8247 flow. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:13,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:13,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:13,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:14,129 INFO L130 PetriNetUnfolder]: 273/646 cut-off events. [2022-12-06 02:40:14,129 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-06 02:40:14,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8525 conditions, 646 events. 273/646 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3932 event pairs, 0 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 7050. Up to 539 conditions per place. [2022-12-06 02:40:14,137 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 156 selfloop transitions, 59 changer transitions 132/347 dead transitions. [2022-12-06 02:40:14,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 347 transitions, 9289 flow [2022-12-06 02:40:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:40:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:40:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 129 transitions. [2022-12-06 02:40:14,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2022-12-06 02:40:14,139 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 144 predicate places. [2022-12-06 02:40:14,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:14,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 347 transitions, 9289 flow [2022-12-06 02:40:14,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 347 transitions, 9289 flow [2022-12-06 02:40:14,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:14,151 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:14,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 02:40:14,152 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 347 transitions, 9289 flow [2022-12-06 02:40:14,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:14,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:14,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:14,179 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-06 02:40:14,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:14,359 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-06 02:40:14,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:14,359 INFO L85 PathProgramCache]: Analyzing trace with hash 652036168, now seen corresponding path program 7 times [2022-12-06 02:40:14,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:14,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183041547] [2022-12-06 02:40:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:14,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:14,469 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-06 02:40:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:14,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183041547] [2022-12-06 02:40:14,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183041547] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:14,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793302441] [2022-12-06 02:40:14,470 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:40:14,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:14,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:14,471 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-06 02:40:14,474 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-06 02:40:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:14,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:14,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:14,657 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-06 02:40:14,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:14,795 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-06 02:40:14,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793302441] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:14,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:14,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280869421] [2022-12-06 02:40:14,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:14,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:14,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:14,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 347 transitions, 9289 flow. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:14,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:14,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:14,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:15,483 INFO L130 PetriNetUnfolder]: 293/726 cut-off events. [2022-12-06 02:40:15,483 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-06 02:40:15,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10309 conditions, 726 events. 293/726 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4675 event pairs, 0 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 8550. Up to 619 conditions per place. [2022-12-06 02:40:15,493 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 213 selfloop transitions, 51 changer transitions 142/406 dead transitions. [2022-12-06 02:40:15,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 406 transitions, 11683 flow [2022-12-06 02:40:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:40:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:40:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2022-12-06 02:40:15,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4033333333333333 [2022-12-06 02:40:15,496 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 163 predicate places. [2022-12-06 02:40:15,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:15,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 406 transitions, 11683 flow [2022-12-06 02:40:15,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 406 transitions, 11683 flow [2022-12-06 02:40:15,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:15,511 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:15,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 02:40:15,512 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 406 transitions, 11683 flow [2022-12-06 02:40:15,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:15,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:15,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:15,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 02:40:15,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:15,718 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-06 02:40:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash 618766348, now seen corresponding path program 8 times [2022-12-06 02:40:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:15,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652664726] [2022-12-06 02:40:15,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:15,847 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-06 02:40:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652664726] [2022-12-06 02:40:15,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652664726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635486537] [2022-12-06 02:40:15,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:40:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:15,849 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-06 02:40:15,879 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-06 02:40:15,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:15,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:15,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:15,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:16,078 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-06 02:40:16,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:16,263 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-06 02:40:16,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635486537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:16,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:16,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:16,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604640360] [2022-12-06 02:40:16,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:16,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:16,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:16,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:16,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 406 transitions, 11683 flow. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:16,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:16,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:16,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:17,170 INFO L130 PetriNetUnfolder]: 292/727 cut-off events. [2022-12-06 02:40:17,171 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-06 02:40:17,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11053 conditions, 727 events. 292/727 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4715 event pairs, 0 based on Foata normal form. 4/581 useless extension candidates. Maximal degree in co-relation 9202. Up to 620 conditions per place. [2022-12-06 02:40:17,176 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 197 selfloop transitions, 47 changer transitions 166/410 dead transitions. [2022-12-06 02:40:17,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 410 transitions, 12624 flow [2022-12-06 02:40:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:40:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:40:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 123 transitions. [2022-12-06 02:40:17,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-06 02:40:17,178 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 185 predicate places. [2022-12-06 02:40:17,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:17,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 410 transitions, 12624 flow [2022-12-06 02:40:17,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 410 transitions, 12624 flow [2022-12-06 02:40:17,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:17,187 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:17,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 02:40:17,188 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 410 transitions, 12624 flow [2022-12-06 02:40:17,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:17,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:17,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:17,194 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-06 02:40:17,392 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,SelfDestructingSolverStorable13 [2022-12-06 02:40:17,393 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-06 02:40:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 312493302, now seen corresponding path program 9 times [2022-12-06 02:40:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:17,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94973068] [2022-12-06 02:40:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:17,535 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-06 02:40:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:17,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94973068] [2022-12-06 02:40:17,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94973068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622083208] [2022-12-06 02:40:17,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:40:17,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:17,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:17,537 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-06 02:40:17,563 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-06 02:40:17,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:40:17,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:17,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:17,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:17,722 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-06 02:40:17,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:17,859 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-06 02:40:17,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622083208] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:17,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:17,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541167746] [2022-12-06 02:40:17,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:17,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:17,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:17,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:17,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:17,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 410 transitions, 12624 flow. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:17,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:17,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:17,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:18,332 INFO L130 PetriNetUnfolder]: 296/745 cut-off events. [2022-12-06 02:40:18,332 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-06 02:40:18,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12073 conditions, 745 events. 296/745 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4922 event pairs, 0 based on Foata normal form. 2/593 useless extension candidates. Maximal degree in co-relation 10069. Up to 638 conditions per place. [2022-12-06 02:40:18,337 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 210 selfloop transitions, 38 changer transitions 176/424 dead transitions. [2022-12-06 02:40:18,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 424 transitions, 13904 flow [2022-12-06 02:40:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:40:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:40:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2022-12-06 02:40:18,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3422222222222222 [2022-12-06 02:40:18,339 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 199 predicate places. [2022-12-06 02:40:18,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:18,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 424 transitions, 13904 flow [2022-12-06 02:40:18,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 424 transitions, 13904 flow [2022-12-06 02:40:18,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:18,349 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:18,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:40:18,350 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 424 transitions, 13904 flow [2022-12-06 02:40:18,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:18,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:18,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:18,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 02:40:18,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:40:18,556 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-06 02:40:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1066307538, now seen corresponding path program 10 times [2022-12-06 02:40:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:18,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957306581] [2022-12-06 02:40:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:18,689 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-06 02:40:18,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:18,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957306581] [2022-12-06 02:40:18,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957306581] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:18,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80024073] [2022-12-06 02:40:18,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:40:18,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:18,691 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-06 02:40:18,693 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-06 02:40:18,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:40:18,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:18,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:18,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:18,866 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-06 02:40:18,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:19,003 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-06 02:40:19,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80024073] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:19,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:19,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 02:40:19,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281411274] [2022-12-06 02:40:19,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:19,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:19,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:19,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:19,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:19,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:19,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 424 transitions, 13904 flow. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:19,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:19,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:19,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:19,481 INFO L130 PetriNetUnfolder]: 296/743 cut-off events. [2022-12-06 02:40:19,481 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-06 02:40:19,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12785 conditions, 743 events. 296/743 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4901 event pairs, 0 based on Foata normal form. 2/591 useless extension candidates. Maximal degree in co-relation 10694. Up to 636 conditions per place. [2022-12-06 02:40:19,487 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 203 selfloop transitions, 41 changer transitions 190/434 dead transitions. [2022-12-06 02:40:19,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 434 transitions, 15098 flow [2022-12-06 02:40:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:40:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:40:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-12-06 02:40:19,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2022-12-06 02:40:19,489 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 207 predicate places. [2022-12-06 02:40:19,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:19,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 434 transitions, 15098 flow [2022-12-06 02:40:19,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 434 transitions, 15098 flow [2022-12-06 02:40:19,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:19,500 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:19,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:40:19,501 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 434 transitions, 15098 flow [2022-12-06 02:40:19,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:19,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:19,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:19,505 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-06 02:40:19,706 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,SelfDestructingSolverStorable15 [2022-12-06 02:40:19,706 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-06 02:40:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash 967279590, now seen corresponding path program 1 times [2022-12-06 02:40:19,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:19,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23637006] [2022-12-06 02:40:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:19,852 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-06 02:40:19,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:19,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23637006] [2022-12-06 02:40:19,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23637006] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:19,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695142981] [2022-12-06 02:40:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:19,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:19,854 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-06 02:40:19,856 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-06 02:40:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:19,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:19,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:20,031 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-06 02:40:20,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:20,139 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-06 02:40:20,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695142981] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:20,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:20,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-06 02:40:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169575511] [2022-12-06 02:40:20,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:20,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:40:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:40:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:40:20,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:20,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 434 transitions, 15098 flow. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-06 02:40:20,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:20,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:20,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:20,618 INFO L130 PetriNetUnfolder]: 324/802 cut-off events. [2022-12-06 02:40:20,619 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-12-06 02:40:20,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14600 conditions, 802 events. 324/802 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5343 event pairs, 0 based on Foata normal form. 3/633 useless extension candidates. Maximal degree in co-relation 12333. Up to 695 conditions per place. [2022-12-06 02:40:20,623 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 172 selfloop transitions, 47 changer transitions 247/466 dead transitions. [2022-12-06 02:40:20,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 466 transitions, 17145 flow [2022-12-06 02:40:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:40:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:40:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2022-12-06 02:40:20,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 02:40:20,625 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 220 predicate places. [2022-12-06 02:40:20,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:20,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 466 transitions, 17145 flow [2022-12-06 02:40:20,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 466 transitions, 17145 flow [2022-12-06 02:40:20,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:20,636 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:20,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 02:40:20,637 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 466 transitions, 17145 flow [2022-12-06 02:40:20,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-06 02:40:20,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:20,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:20,644 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-06 02:40:20,842 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,SelfDestructingSolverStorable16 [2022-12-06 02:40:20,842 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-06 02:40:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1774007558, now seen corresponding path program 2 times [2022-12-06 02:40:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:20,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576723446] [2022-12-06 02:40:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:20,998 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-06 02:40:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:20,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576723446] [2022-12-06 02:40:20,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576723446] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:20,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539088697] [2022-12-06 02:40:20,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:40:20,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:20,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:21,013 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-06 02:40:21,015 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-06 02:40:21,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:21,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:21,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:21,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:21,197 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-06 02:40:21,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:21,303 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-06 02:40:21,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539088697] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:21,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:21,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 02:40:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915325276] [2022-12-06 02:40:21,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:21,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:21,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:21,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 466 transitions, 17145 flow. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:21,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:21,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:21,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:21,973 INFO L130 PetriNetUnfolder]: 368/891 cut-off events. [2022-12-06 02:40:21,974 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-06 02:40:21,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17106 conditions, 891 events. 368/891 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6005 event pairs, 0 based on Foata normal form. 3/694 useless extension candidates. Maximal degree in co-relation 14618. Up to 784 conditions per place. [2022-12-06 02:40:21,980 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 175 selfloop transitions, 45 changer transitions 290/510 dead transitions. [2022-12-06 02:40:21,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 510 transitions, 19782 flow [2022-12-06 02:40:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:40:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:40:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2022-12-06 02:40:21,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2022-12-06 02:40:21,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 237 predicate places. [2022-12-06 02:40:21,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:21,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 510 transitions, 19782 flow [2022-12-06 02:40:21,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 510 transitions, 19782 flow [2022-12-06 02:40:21,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:21,996 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:21,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:40:21,996 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 510 transitions, 19782 flow [2022-12-06 02:40:21,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:21,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:21,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:22,003 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-06 02:40:22,201 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,SelfDestructingSolverStorable17 [2022-12-06 02:40:22,202 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-06 02:40:22,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash 778889710, now seen corresponding path program 3 times [2022-12-06 02:40:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:22,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370605319] [2022-12-06 02:40:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:22,317 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-06 02:40:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:22,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370605319] [2022-12-06 02:40:22,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370605319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:22,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492272734] [2022-12-06 02:40:22,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:40:22,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:22,324 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-06 02:40:22,324 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-06 02:40:22,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:40:22,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:22,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:22,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:22,542 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-06 02:40:22,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:22,671 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-06 02:40:22,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492272734] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:22,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:22,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 02:40:22,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457804283] [2022-12-06 02:40:22,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:22,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:22,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:22,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:22,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 510 transitions, 19782 flow. Second operand has 19 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-06 02:40:22,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:22,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:22,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:23,352 INFO L130 PetriNetUnfolder]: 388/943 cut-off events. [2022-12-06 02:40:23,352 INFO L131 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-12-06 02:40:23,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19048 conditions, 943 events. 388/943 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6439 event pairs, 0 based on Foata normal form. 2/731 useless extension candidates. Maximal degree in co-relation 16349. Up to 836 conditions per place. [2022-12-06 02:40:23,360 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 182 selfloop transitions, 55 changer transitions 319/556 dead transitions. [2022-12-06 02:40:23,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 556 transitions, 22678 flow [2022-12-06 02:40:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:40:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:40:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 123 transitions. [2022-12-06 02:40:23,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-06 02:40:23,362 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 254 predicate places. [2022-12-06 02:40:23,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:23,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 556 transitions, 22678 flow [2022-12-06 02:40:23,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 274 places, 556 transitions, 22678 flow [2022-12-06 02:40:23,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:23,377 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:23,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 02:40:23,378 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 556 transitions, 22678 flow [2022-12-06 02:40:23,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 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-06 02:40:23,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:23,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:23,393 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-06 02:40:23,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:23,583 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-06 02:40:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 745619890, now seen corresponding path program 4 times [2022-12-06 02:40:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934243364] [2022-12-06 02:40:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:23,728 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-06 02:40:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934243364] [2022-12-06 02:40:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934243364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830101301] [2022-12-06 02:40:23,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:40:23,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:23,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:23,731 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-06 02:40:23,734 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-06 02:40:23,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:40:23,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:23,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:23,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:23,906 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-06 02:40:23,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:24,014 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-06 02:40:24,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830101301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:24,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:24,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 02:40:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462929202] [2022-12-06 02:40:24,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:24,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:40:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:40:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:40:24,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:24,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 556 transitions, 22678 flow. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:24,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:24,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:24,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:24,648 INFO L130 PetriNetUnfolder]: 394/956 cut-off events. [2022-12-06 02:40:24,648 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-12-06 02:40:24,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20268 conditions, 956 events. 394/956 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6569 event pairs, 0 based on Foata normal form. 2/740 useless extension candidates. Maximal degree in co-relation 17458. Up to 849 conditions per place. [2022-12-06 02:40:24,654 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 169 selfloop transitions, 47 changer transitions 347/563 dead transitions. [2022-12-06 02:40:24,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 563 transitions, 24093 flow [2022-12-06 02:40:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:40:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:40:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions. [2022-12-06 02:40:24,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 02:40:24,655 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 266 predicate places. [2022-12-06 02:40:24,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:24,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 563 transitions, 24093 flow [2022-12-06 02:40:24,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 563 transitions, 24093 flow [2022-12-06 02:40:24,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:24,671 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:24,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 02:40:24,672 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 563 transitions, 24093 flow [2022-12-06 02:40:24,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:24,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:24,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:24,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:24,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:24,877 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-06 02:40:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1222914936, now seen corresponding path program 5 times [2022-12-06 02:40:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:24,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275001019] [2022-12-06 02:40:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:25,017 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-06 02:40:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:25,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275001019] [2022-12-06 02:40:25,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275001019] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:25,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437017291] [2022-12-06 02:40:25,018 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:40:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:25,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:25,019 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-06 02:40:25,021 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-06 02:40:25,069 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:25,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:25,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:25,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:25,190 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-06 02:40:25,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:25,294 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-06 02:40:25,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437017291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:25,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:25,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-06 02:40:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604474163] [2022-12-06 02:40:25,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:25,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:40:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:25,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:40:25,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:40:25,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:25,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 563 transitions, 24093 flow. Second operand has 18 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-06 02:40:25,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:25,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:26,044 INFO L130 PetriNetUnfolder]: 503/1182 cut-off events. [2022-12-06 02:40:26,044 INFO L131 PetriNetUnfolder]: For 307/307 co-relation queries the response was YES. [2022-12-06 02:40:26,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26229 conditions, 1182 events. 503/1182 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8362 event pairs, 0 based on Foata normal form. 3/897 useless extension candidates. Maximal degree in co-relation 22992. Up to 1075 conditions per place. [2022-12-06 02:40:26,050 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 197 selfloop transitions, 48 changer transitions 439/684 dead transitions. [2022-12-06 02:40:26,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 684 transitions, 30633 flow [2022-12-06 02:40:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:40:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:40:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 127 transitions. [2022-12-06 02:40:26,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42333333333333334 [2022-12-06 02:40:26,051 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 285 predicate places. [2022-12-06 02:40:26,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:26,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 684 transitions, 30633 flow [2022-12-06 02:40:26,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 684 transitions, 30633 flow [2022-12-06 02:40:26,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:26,070 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:26,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 02:40:26,071 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 684 transitions, 30633 flow [2022-12-06 02:40:26,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 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-06 02:40:26,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:26,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:26,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 02:40:26,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:26,276 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-06 02:40:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2076934512, now seen corresponding path program 6 times [2022-12-06 02:40:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:26,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450444181] [2022-12-06 02:40:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:26,409 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-06 02:40:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450444181] [2022-12-06 02:40:26,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450444181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524021783] [2022-12-06 02:40:26,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:40:26,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:26,412 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-06 02:40:26,451 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-06 02:40:26,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:40:26,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:26,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:26,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:26,605 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-06 02:40:26,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:26,709 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-06 02:40:26,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524021783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:26,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:26,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-06 02:40:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123505849] [2022-12-06 02:40:26,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:26,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:40:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:40:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:40:26,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:26,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 684 transitions, 30633 flow. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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-06 02:40:26,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:26,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:26,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:27,499 INFO L130 PetriNetUnfolder]: 519/1230 cut-off events. [2022-12-06 02:40:27,500 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-06 02:40:27,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28525 conditions, 1230 events. 519/1230 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8812 event pairs, 0 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 25003. Up to 1123 conditions per place. [2022-12-06 02:40:27,506 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 213 selfloop transitions, 55 changer transitions 450/718 dead transitions. [2022-12-06 02:40:27,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 718 transitions, 33592 flow [2022-12-06 02:40:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:40:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:40:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2022-12-06 02:40:27,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2022-12-06 02:40:27,508 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 301 predicate places. [2022-12-06 02:40:27,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:27,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 718 transitions, 33592 flow [2022-12-06 02:40:27,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 718 transitions, 33592 flow [2022-12-06 02:40:27,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:27,528 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:27,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 02:40:27,529 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 718 transitions, 33592 flow [2022-12-06 02:40:27,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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-06 02:40:27,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:27,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:27,534 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-06 02:40:27,733 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,SelfDestructingSolverStorable21 [2022-12-06 02:40:27,734 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-06 02:40:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:27,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2043664692, now seen corresponding path program 7 times [2022-12-06 02:40:27,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:27,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010107805] [2022-12-06 02:40:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:27,852 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-06 02:40:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:27,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010107805] [2022-12-06 02:40:27,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010107805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:27,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97041985] [2022-12-06 02:40:27,852 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:40:27,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:27,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:27,854 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-06 02:40:27,856 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-06 02:40:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:27,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:27,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:28,029 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-06 02:40:28,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:28,145 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-06 02:40:28,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97041985] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:28,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:28,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-06 02:40:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613945837] [2022-12-06 02:40:28,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:28,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:40:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:28,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:40:28,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:40:28,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:28,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 718 transitions, 33592 flow. Second operand has 18 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-06 02:40:28,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:28,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:28,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:28,901 INFO L130 PetriNetUnfolder]: 519/1228 cut-off events. [2022-12-06 02:40:28,901 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-06 02:40:28,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29708 conditions, 1228 events. 519/1228 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8768 event pairs, 0 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 26085. Up to 1121 conditions per place. [2022-12-06 02:40:28,907 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 205 selfloop transitions, 47 changer transitions 464/716 dead transitions. [2022-12-06 02:40:28,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 716 transitions, 34932 flow [2022-12-06 02:40:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:40:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:40:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 126 transitions. [2022-12-06 02:40:28,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49411764705882355 [2022-12-06 02:40:28,909 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 317 predicate places. [2022-12-06 02:40:28,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:28,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 337 places, 716 transitions, 34932 flow [2022-12-06 02:40:28,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 337 places, 716 transitions, 34932 flow [2022-12-06 02:40:28,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:28,930 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:28,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 02:40:28,931 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 716 transitions, 34932 flow [2022-12-06 02:40:28,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 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-06 02:40:28,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:28,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:28,938 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-06 02:40:29,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:29,135 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-06 02:40:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1006474908, now seen corresponding path program 8 times [2022-12-06 02:40:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:29,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990513671] [2022-12-06 02:40:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:29,239 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-06 02:40:29,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990513671] [2022-12-06 02:40:29,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990513671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037475375] [2022-12-06 02:40:29,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:40:29,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:29,241 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-06 02:40:29,243 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-06 02:40:29,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:29,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:29,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 02:40:29,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:29,404 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-06 02:40:29,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:29,506 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-06 02:40:29,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037475375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:29,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:29,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-06 02:40:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204016765] [2022-12-06 02:40:29,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:29,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:40:29,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:29,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:40:29,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:40:29,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:29,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 716 transitions, 34932 flow. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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-06 02:40:29,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:29,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:29,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:30,236 INFO L130 PetriNetUnfolder]: 520/1241 cut-off events. [2022-12-06 02:40:30,236 INFO L131 PetriNetUnfolder]: For 326/326 co-relation queries the response was YES. [2022-12-06 02:40:30,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31266 conditions, 1241 events. 520/1241 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8951 event pairs, 0 based on Foata normal form. 2/941 useless extension candidates. Maximal degree in co-relation 27444. Up to 1134 conditions per place. [2022-12-06 02:40:30,243 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 239 selfloop transitions, 27 changer transitions 478/744 dead transitions. [2022-12-06 02:40:30,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 744 transitions, 37788 flow [2022-12-06 02:40:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:40:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:40:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2022-12-06 02:40:30,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2022-12-06 02:40:30,244 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 328 predicate places. [2022-12-06 02:40:30,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:30,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 348 places, 744 transitions, 37788 flow [2022-12-06 02:40:30,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 348 places, 744 transitions, 37788 flow [2022-12-06 02:40:30,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:30,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:30,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 02:40:30,292 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 744 transitions, 37788 flow [2022-12-06 02:40:30,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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-06 02:40:30,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:30,293 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:30,297 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-06 02:40:30,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:30,497 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-06 02:40:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash -912558086, now seen corresponding path program 11 times [2022-12-06 02:40:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:30,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789719780] [2022-12-06 02:40:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:30,620 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-06 02:40:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:30,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789719780] [2022-12-06 02:40:30,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789719780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:30,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438918939] [2022-12-06 02:40:30,621 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:40:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:30,628 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-06 02:40:30,630 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-06 02:40:30,679 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:40:30,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:30,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:30,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:30,832 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-06 02:40:30,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:31,010 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-06 02:40:31,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438918939] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:31,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:31,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174277636] [2022-12-06 02:40:31,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:31,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:31,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:31,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 744 transitions, 37788 flow. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:40:31,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:31,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:31,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:32,427 INFO L130 PetriNetUnfolder]: 796/1808 cut-off events. [2022-12-06 02:40:32,427 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2022-12-06 02:40:32,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47333 conditions, 1808 events. 796/1808 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13465 event pairs, 0 based on Foata normal form. 3/1345 useless extension candidates. Maximal degree in co-relation 41637. Up to 1701 conditions per place. [2022-12-06 02:40:32,437 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 289 selfloop transitions, 115 changer transitions 638/1042 dead transitions. [2022-12-06 02:40:32,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1042 transitions, 54988 flow [2022-12-06 02:40:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 02:40:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 02:40:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 202 transitions. [2022-12-06 02:40:32,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2022-12-06 02:40:32,439 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 359 predicate places. [2022-12-06 02:40:32,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:32,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 379 places, 1042 transitions, 54988 flow [2022-12-06 02:40:32,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 1042 transitions, 54988 flow [2022-12-06 02:40:32,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:32,472 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:32,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 02:40:32,472 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 1042 transitions, 54988 flow [2022-12-06 02:40:32,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:40:32,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:32,472 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:32,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:32,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:32,679 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-06 02:40:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash 393661206, now seen corresponding path program 12 times [2022-12-06 02:40:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:32,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920642410] [2022-12-06 02:40:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:32,827 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-06 02:40:32,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:32,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920642410] [2022-12-06 02:40:32,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920642410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:32,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356224456] [2022-12-06 02:40:32,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:40:32,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:32,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:32,843 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-06 02:40:32,845 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-06 02:40:32,897 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:40:32,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:32,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:32,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:33,057 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-06 02:40:33,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:33,238 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-06 02:40:33,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356224456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:33,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:33,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365039155] [2022-12-06 02:40:33,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:33,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:33,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:33,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:33,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 1042 transitions, 54988 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:33,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:33,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:33,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:35,514 INFO L130 PetriNetUnfolder]: 807/1859 cut-off events. [2022-12-06 02:40:35,514 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-06 02:40:35,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50530 conditions, 1859 events. 807/1859 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14100 event pairs, 0 based on Foata normal form. 4/1385 useless extension candidates. Maximal degree in co-relation 44453. Up to 1752 conditions per place. [2022-12-06 02:40:35,525 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 314 selfloop transitions, 123 changer transitions 660/1097 dead transitions. [2022-12-06 02:40:35,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 1097 transitions, 60084 flow [2022-12-06 02:40:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 02:40:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 02:40:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 268 transitions. [2022-12-06 02:40:35,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41550387596899224 [2022-12-06 02:40:35,528 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 401 predicate places. [2022-12-06 02:40:35,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:35,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 421 places, 1097 transitions, 60084 flow [2022-12-06 02:40:35,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 421 places, 1097 transitions, 60084 flow [2022-12-06 02:40:35,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:35,566 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:35,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 02:40:35,567 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 1097 transitions, 60084 flow [2022-12-06 02:40:35,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:35,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:35,567 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:35,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 02:40:35,772 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,SelfDestructingSolverStorable25 [2022-12-06 02:40:35,773 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-06 02:40:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash 360391386, now seen corresponding path program 13 times [2022-12-06 02:40:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:35,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280639263] [2022-12-06 02:40:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:35,913 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-06 02:40:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:35,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280639263] [2022-12-06 02:40:35,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280639263] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:35,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460459290] [2022-12-06 02:40:35,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:40:35,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:35,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:35,915 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-06 02:40:35,917 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-06 02:40:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:35,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:36,125 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-06 02:40:36,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:36,309 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-06 02:40:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460459290] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:36,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969256257] [2022-12-06 02:40:36,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:36,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:36,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:36,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:36,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 1097 transitions, 60084 flow. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:40:36,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:36,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:36,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:38,371 INFO L130 PetriNetUnfolder]: 807/1855 cut-off events. [2022-12-06 02:40:38,371 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-06 02:40:38,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52278 conditions, 1855 events. 807/1855 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14053 event pairs, 0 based on Foata normal form. 4/1381 useless extension candidates. Maximal degree in co-relation 46093. Up to 1748 conditions per place. [2022-12-06 02:40:38,386 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 286 selfloop transitions, 111 changer transitions 696/1093 dead transitions. [2022-12-06 02:40:38,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 1093 transitions, 62054 flow [2022-12-06 02:40:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 02:40:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 02:40:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 265 transitions. [2022-12-06 02:40:38,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-06 02:40:38,388 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 439 predicate places. [2022-12-06 02:40:38,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:38,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 459 places, 1093 transitions, 62054 flow [2022-12-06 02:40:38,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 1093 transitions, 62054 flow [2022-12-06 02:40:38,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:38,490 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:38,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 02:40:38,491 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 1093 transitions, 62054 flow [2022-12-06 02:40:38,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:40:38,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:38,491 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:38,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:38,695 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,SelfDestructingSolverStorable26 [2022-12-06 02:40:38,696 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-06 02:40:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1543912276, now seen corresponding path program 14 times [2022-12-06 02:40:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807315266] [2022-12-06 02:40:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807315266] [2022-12-06 02:40:38,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807315266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752911207] [2022-12-06 02:40:38,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:40:38,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:38,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:38,836 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-06 02:40:38,880 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-06 02:40:38,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:38,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:38,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:38,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:39,075 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-06 02:40:39,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:39,272 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-06 02:40:39,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752911207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:39,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:39,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:39,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935885072] [2022-12-06 02:40:39,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:39,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:39,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:39,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:39,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:39,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:39,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1093 transitions, 62054 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:39,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:39,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:39,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:42,228 INFO L130 PetriNetUnfolder]: 1073/2501 cut-off events. [2022-12-06 02:40:42,228 INFO L131 PetriNetUnfolder]: For 634/634 co-relation queries the response was YES. [2022-12-06 02:40:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72972 conditions, 2501 events. 1073/2501 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 20418 event pairs, 0 based on Foata normal form. 7/1846 useless extension candidates. Maximal degree in co-relation 64962. Up to 2394 conditions per place. [2022-12-06 02:40:42,251 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 371 selfloop transitions, 187 changer transitions 925/1483 dead transitions. [2022-12-06 02:40:42,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 1483 transitions, 87160 flow [2022-12-06 02:40:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-06 02:40:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-12-06 02:40:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 380 transitions. [2022-12-06 02:40:42,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-06 02:40:42,254 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 502 predicate places. [2022-12-06 02:40:42,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:42,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 522 places, 1483 transitions, 87160 flow [2022-12-06 02:40:42,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 522 places, 1483 transitions, 87160 flow [2022-12-06 02:40:42,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:42,317 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:42,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 02:40:42,317 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 1483 transitions, 87160 flow [2022-12-06 02:40:42,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:42,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:42,318 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:42,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:42,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 02:40:42,521 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-06 02:40:42,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1510642456, now seen corresponding path program 15 times [2022-12-06 02:40:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:42,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032809018] [2022-12-06 02:40:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032809018] [2022-12-06 02:40:42,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032809018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348553094] [2022-12-06 02:40:42,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:40:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:42,742 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-06 02:40:42,746 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-06 02:40:42,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:40:42,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:42,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:42,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:43,005 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-06 02:40:43,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:43,263 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-06 02:40:43,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348553094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:43,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:43,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:43,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634889459] [2022-12-06 02:40:43,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:43,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:43,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:43,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:43,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:43,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 1483 transitions, 87160 flow. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:40:43,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:43,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:43,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:46,557 INFO L130 PetriNetUnfolder]: 1073/2494 cut-off events. [2022-12-06 02:40:46,557 INFO L131 PetriNetUnfolder]: For 634/634 co-relation queries the response was YES. [2022-12-06 02:40:46,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75264 conditions, 2494 events. 1073/2494 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 20351 event pairs, 0 based on Foata normal form. 7/1839 useless extension candidates. Maximal degree in co-relation 67194. Up to 2387 conditions per place. [2022-12-06 02:40:46,572 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 349 selfloop transitions, 167 changer transitions 960/1476 dead transitions. [2022-12-06 02:40:46,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1476 transitions, 89706 flow [2022-12-06 02:40:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-06 02:40:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-12-06 02:40:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 347 transitions. [2022-12-06 02:40:46,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4058479532163743 [2022-12-06 02:40:46,585 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 557 predicate places. [2022-12-06 02:40:46,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:46,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 577 places, 1476 transitions, 89706 flow [2022-12-06 02:40:46,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 577 places, 1476 transitions, 89706 flow [2022-12-06 02:40:46,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:46,634 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:46,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 02:40:46,635 INFO L495 AbstractCegarLoop]: Abstraction has has 577 places, 1476 transitions, 89706 flow [2022-12-06 02:40:46,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:40:46,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:46,635 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:46,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:46,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:46,840 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-06 02:40:46,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash -174431430, now seen corresponding path program 16 times [2022-12-06 02:40:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:46,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827181592] [2022-12-06 02:40:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:46,968 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-06 02:40:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827181592] [2022-12-06 02:40:46,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827181592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431446642] [2022-12-06 02:40:46,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:40:46,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:46,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:46,970 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-06 02:40:46,972 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-06 02:40:47,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:40:47,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:47,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:47,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:47,182 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-06 02:40:47,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:47,365 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-06 02:40:47,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431446642] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:47,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:47,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:47,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292293181] [2022-12-06 02:40:47,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:47,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:47,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:47,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 1476 transitions, 89706 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:47,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:47,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:47,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:50,448 INFO L130 PetriNetUnfolder]: 1202/2786 cut-off events. [2022-12-06 02:40:50,449 INFO L131 PetriNetUnfolder]: For 705/705 co-relation queries the response was YES. [2022-12-06 02:40:50,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86858 conditions, 2786 events. 1202/2786 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 23163 event pairs, 0 based on Foata normal form. 8/2044 useless extension candidates. Maximal degree in co-relation 78103. Up to 2679 conditions per place. [2022-12-06 02:40:50,466 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 320 selfloop transitions, 149 changer transitions 1226/1695 dead transitions. [2022-12-06 02:40:50,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 1695 transitions, 106395 flow [2022-12-06 02:40:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 02:40:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 02:40:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 280 transitions. [2022-12-06 02:40:50,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3660130718954248 [2022-12-06 02:40:50,467 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 605 predicate places. [2022-12-06 02:40:50,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:50,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 625 places, 1695 transitions, 106395 flow [2022-12-06 02:40:50,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 625 places, 1695 transitions, 106395 flow [2022-12-06 02:40:50,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:50,530 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:50,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 02:40:50,530 INFO L495 AbstractCegarLoop]: Abstraction has has 625 places, 1695 transitions, 106395 flow [2022-12-06 02:40:50,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:50,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:50,530 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:50,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:50,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:50,735 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-06 02:40:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2023407146, now seen corresponding path program 17 times [2022-12-06 02:40:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:50,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7070690] [2022-12-06 02:40:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:50,839 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-06 02:40:50,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:50,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7070690] [2022-12-06 02:40:50,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7070690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:50,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860447778] [2022-12-06 02:40:50,840 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:40:50,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:50,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:50,842 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-06 02:40:50,844 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-06 02:40:51,055 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:40:51,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:51,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:51,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:51,216 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-06 02:40:51,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:51,415 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-06 02:40:51,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860447778] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:51,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:51,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:51,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693334066] [2022-12-06 02:40:51,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:51,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:51,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:51,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:51,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:51,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 1695 transitions, 106395 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:51,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:51,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:51,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:54,026 INFO L130 PetriNetUnfolder]: 1208/2813 cut-off events. [2022-12-06 02:40:54,027 INFO L131 PetriNetUnfolder]: For 711/711 co-relation queries the response was YES. [2022-12-06 02:40:54,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90515 conditions, 2813 events. 1208/2813 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 23460 event pairs, 0 based on Foata normal form. 3/2060 useless extension candidates. Maximal degree in co-relation 81385. Up to 2706 conditions per place. [2022-12-06 02:40:54,046 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 429 selfloop transitions, 31 changer transitions 1256/1716 dead transitions. [2022-12-06 02:40:54,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 1716 transitions, 111147 flow [2022-12-06 02:40:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 02:40:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 02:40:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 99 transitions. [2022-12-06 02:40:54,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 02:40:54,048 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 625 predicate places. [2022-12-06 02:40:54,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:54,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 645 places, 1716 transitions, 111147 flow [2022-12-06 02:40:54,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 645 places, 1716 transitions, 111147 flow [2022-12-06 02:40:54,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:54,137 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:54,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 02:40:54,137 INFO L495 AbstractCegarLoop]: Abstraction has has 645 places, 1716 transitions, 111147 flow [2022-12-06 02:40:54,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:54,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:54,138 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:54,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:54,341 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,SelfDestructingSolverStorable30 [2022-12-06 02:40:54,342 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-06 02:40:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash 93880078, now seen corresponding path program 18 times [2022-12-06 02:40:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:54,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538585148] [2022-12-06 02:40:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:54,493 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-06 02:40:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:54,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538585148] [2022-12-06 02:40:54,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538585148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:54,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258335948] [2022-12-06 02:40:54,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:40:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:54,495 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-06 02:40:54,497 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-06 02:40:54,552 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:40:54,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:54,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:40:54,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:54,739 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-06 02:40:54,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:54,919 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-06 02:40:54,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258335948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:54,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:54,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:40:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8019158] [2022-12-06 02:40:54,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:54,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:40:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:40:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:40:54,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:54,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 1716 transitions, 111147 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:54,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:54,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:54,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:58,028 INFO L130 PetriNetUnfolder]: 1221/2863 cut-off events. [2022-12-06 02:40:58,028 INFO L131 PetriNetUnfolder]: For 721/721 co-relation queries the response was YES. [2022-12-06 02:40:58,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94989 conditions, 2863 events. 1221/2863 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 24173 event pairs, 0 based on Foata normal form. 4/2099 useless extension candidates. Maximal degree in co-relation 85410. Up to 2756 conditions per place. [2022-12-06 02:40:58,048 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 422 selfloop transitions, 38 changer transitions 1294/1754 dead transitions. [2022-12-06 02:40:58,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 1754 transitions, 117117 flow [2022-12-06 02:40:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 02:40:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 02:40:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 126 transitions. [2022-12-06 02:40:58,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-06 02:40:58,050 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 651 predicate places. [2022-12-06 02:40:58,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:58,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 671 places, 1754 transitions, 117117 flow [2022-12-06 02:40:58,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 671 places, 1754 transitions, 117117 flow [2022-12-06 02:40:58,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:58,140 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:58,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 02:40:58,140 INFO L495 AbstractCegarLoop]: Abstraction has has 671 places, 1754 transitions, 117117 flow [2022-12-06 02:40:58,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:40:58,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:58,141 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:58,146 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-06 02:40:58,346 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,SelfDestructingSolverStorable31 [2022-12-06 02:40:58,346 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-06 02:40:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1526497323, now seen corresponding path program 9 times [2022-12-06 02:40:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:58,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653034337] [2022-12-06 02:40:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:58,578 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-06 02:40:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:58,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653034337] [2022-12-06 02:40:58,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653034337] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:58,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174589806] [2022-12-06 02:40:58,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:40:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:58,580 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-06 02:40:58,582 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-06 02:40:58,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:40:58,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:58,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 02:40:58,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:58,771 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-06 02:40:58,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:58,870 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-06 02:40:58,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174589806] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:58,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:58,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-12-06 02:40:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755984085] [2022-12-06 02:40:58,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:58,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:40:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:58,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:40:58,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:40:58,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:40:58,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 1754 transitions, 117117 flow. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-06 02:40:58,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:58,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:40:58,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:01,516 INFO L130 PetriNetUnfolder]: 1270/2994 cut-off events. [2022-12-06 02:41:01,516 INFO L131 PetriNetUnfolder]: For 758/758 co-relation queries the response was YES. [2022-12-06 02:41:01,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102330 conditions, 2994 events. 1270/2994 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 25623 event pairs, 0 based on Foata normal form. 3/2199 useless extension candidates. Maximal degree in co-relation 92050. Up to 2887 conditions per place. [2022-12-06 02:41:01,538 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 468 selfloop transitions, 33 changer transitions 1328/1829 dead transitions. [2022-12-06 02:41:01,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 1829 transitions, 125791 flow [2022-12-06 02:41:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:41:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:41:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2022-12-06 02:41:01,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 02:41:01,540 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 668 predicate places. [2022-12-06 02:41:01,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:01,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 688 places, 1829 transitions, 125791 flow [2022-12-06 02:41:01,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 688 places, 1829 transitions, 125791 flow [2022-12-06 02:41:01,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:01,631 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:01,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 02:41:01,632 INFO L495 AbstractCegarLoop]: Abstraction has has 688 places, 1829 transitions, 125791 flow [2022-12-06 02:41:01,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-06 02:41:01,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:01,632 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:01,640 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-06 02:41:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:01,838 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1083396087, now seen corresponding path program 10 times [2022-12-06 02:41:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:01,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743225185] [2022-12-06 02:41:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:01,946 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-06 02:41:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:01,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743225185] [2022-12-06 02:41:01,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743225185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:01,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884825982] [2022-12-06 02:41:01,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:41:01,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:01,948 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-06 02:41:01,951 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-06 02:41:02,009 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:41:02,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:02,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 02:41:02,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:02,143 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-06 02:41:02,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:02,239 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-06 02:41:02,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884825982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:02,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:02,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2022-12-06 02:41:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759725310] [2022-12-06 02:41:02,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:02,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:41:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:41:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:41:02,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:02,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 1829 transitions, 125791 flow. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:02,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:02,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:02,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:05,047 INFO L130 PetriNetUnfolder]: 1270/2992 cut-off events. [2022-12-06 02:41:05,047 INFO L131 PetriNetUnfolder]: For 758/758 co-relation queries the response was YES. [2022-12-06 02:41:05,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105255 conditions, 2992 events. 1270/2992 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 25572 event pairs, 0 based on Foata normal form. 2/2196 useless extension candidates. Maximal degree in co-relation 94749. Up to 2885 conditions per place. [2022-12-06 02:41:05,066 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 458 selfloop transitions, 27 changer transitions 1354/1839 dead transitions. [2022-12-06 02:41:05,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 1839 transitions, 130155 flow [2022-12-06 02:41:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:41:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:41:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 97 transitions. [2022-12-06 02:41:05,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4311111111111111 [2022-12-06 02:41:05,068 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 682 predicate places. [2022-12-06 02:41:05,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:05,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 702 places, 1839 transitions, 130155 flow [2022-12-06 02:41:05,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 702 places, 1839 transitions, 130155 flow [2022-12-06 02:41:05,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:05,143 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:05,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 02:41:05,143 INFO L495 AbstractCegarLoop]: Abstraction has has 702 places, 1839 transitions, 130155 flow [2022-12-06 02:41:05,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:05,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:05,144 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:05,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-06 02:41:05,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:05,349 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1307163624, now seen corresponding path program 19 times [2022-12-06 02:41:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:05,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299475996] [2022-12-06 02:41:05,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:05,470 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-06 02:41:05,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299475996] [2022-12-06 02:41:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299475996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421918022] [2022-12-06 02:41:05,471 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:41:05,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:05,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:05,473 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-06 02:41:05,474 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-06 02:41:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:05,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:41:05,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:05,870 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-06 02:41:05,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:06,073 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-06 02:41:06,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421918022] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:06,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:06,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:41:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534100561] [2022-12-06 02:41:06,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:06,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:41:06,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:06,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:41:06,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:41:06,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:06,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 1839 transitions, 130155 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:06,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:06,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:06,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:10,564 INFO L130 PetriNetUnfolder]: 1352/3198 cut-off events. [2022-12-06 02:41:10,564 INFO L131 PetriNetUnfolder]: For 806/806 co-relation queries the response was YES. [2022-12-06 02:41:10,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115696 conditions, 3198 events. 1352/3198 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 27702 event pairs, 0 based on Foata normal form. 3/2345 useless extension candidates. Maximal degree in co-relation 104162. Up to 3091 conditions per place. [2022-12-06 02:41:10,582 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 473 selfloop transitions, 87 changer transitions 1419/1979 dead transitions. [2022-12-06 02:41:10,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 1979 transitions, 144009 flow [2022-12-06 02:41:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-06 02:41:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-06 02:41:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 264 transitions. [2022-12-06 02:41:10,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 02:41:10,584 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 729 predicate places. [2022-12-06 02:41:10,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:10,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 749 places, 1979 transitions, 144009 flow [2022-12-06 02:41:10,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 749 places, 1979 transitions, 144009 flow [2022-12-06 02:41:10,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:10,667 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:10,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 02:41:10,667 INFO L495 AbstractCegarLoop]: Abstraction has has 749 places, 1979 transitions, 144009 flow [2022-12-06 02:41:10,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:10,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:10,667 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:10,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:10,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:10,873 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2140227416, now seen corresponding path program 20 times [2022-12-06 02:41:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:10,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402225035] [2022-12-06 02:41:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:10,984 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-06 02:41:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:10,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402225035] [2022-12-06 02:41:10,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402225035] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:10,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296453001] [2022-12-06 02:41:10,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:41:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:10,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:10,986 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-06 02:41:10,988 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-06 02:41:11,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:11,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:11,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:41:11,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:11,213 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-06 02:41:11,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:11,407 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-06 02:41:11,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296453001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:11,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:11,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:41:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263873142] [2022-12-06 02:41:11,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:11,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:41:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:41:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:41:11,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:11,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 1979 transitions, 144009 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:11,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:11,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:11,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:16,207 INFO L130 PetriNetUnfolder]: 1361/3227 cut-off events. [2022-12-06 02:41:16,207 INFO L131 PetriNetUnfolder]: For 812/812 co-relation queries the response was YES. [2022-12-06 02:41:16,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119974 conditions, 3227 events. 1361/3227 cut-off events. For 812/812 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 28108 event pairs, 0 based on Foata normal form. 4/2367 useless extension candidates. Maximal degree in co-relation 108123. Up to 3120 conditions per place. [2022-12-06 02:41:16,239 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 468 selfloop transitions, 64 changer transitions 1486/2018 dead transitions. [2022-12-06 02:41:16,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 789 places, 2018 transitions, 150880 flow [2022-12-06 02:41:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-06 02:41:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-06 02:41:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 206 transitions. [2022-12-06 02:41:16,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.326984126984127 [2022-12-06 02:41:16,241 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 769 predicate places. [2022-12-06 02:41:16,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:16,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 789 places, 2018 transitions, 150880 flow [2022-12-06 02:41:16,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 789 places, 2018 transitions, 150880 flow [2022-12-06 02:41:16,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:16,379 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:16,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 02:41:16,380 INFO L495 AbstractCegarLoop]: Abstraction has has 789 places, 2018 transitions, 150880 flow [2022-12-06 02:41:16,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:16,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:16,380 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:16,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:16,585 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,SelfDestructingSolverStorable35 [2022-12-06 02:41:16,585 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1876295267, now seen corresponding path program 11 times [2022-12-06 02:41:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130858868] [2022-12-06 02:41:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:16,760 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-06 02:41:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:16,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130858868] [2022-12-06 02:41:16,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130858868] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:16,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420823798] [2022-12-06 02:41:16,760 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:41:16,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:16,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:16,763 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-06 02:41:16,765 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-06 02:41:16,848 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:16,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:16,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 02:41:16,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:16,980 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-06 02:41:16,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:17,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420823798] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:17,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:17,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-12-06 02:41:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326405324] [2022-12-06 02:41:17,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:17,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:41:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:41:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:41:17,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:17,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 789 places, 2018 transitions, 150880 flow. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-06 02:41:17,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:17,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:17,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:20,547 INFO L130 PetriNetUnfolder]: 1387/3295 cut-off events. [2022-12-06 02:41:20,547 INFO L131 PetriNetUnfolder]: For 833/833 co-relation queries the response was YES. [2022-12-06 02:41:20,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125799 conditions, 3295 events. 1387/3295 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 28902 event pairs, 0 based on Foata normal form. 6/2423 useless extension candidates. Maximal degree in co-relation 113553. Up to 3188 conditions per place. [2022-12-06 02:41:20,573 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 485 selfloop transitions, 41 changer transitions 1534/2060 dead transitions. [2022-12-06 02:41:20,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 805 places, 2060 transitions, 158147 flow [2022-12-06 02:41:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:41:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:41:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 123 transitions. [2022-12-06 02:41:20,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 02:41:20,576 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 785 predicate places. [2022-12-06 02:41:20,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:20,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 805 places, 2060 transitions, 158147 flow [2022-12-06 02:41:20,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 805 places, 2060 transitions, 158147 flow [2022-12-06 02:41:20,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:20,668 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:20,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 02:41:20,669 INFO L495 AbstractCegarLoop]: Abstraction has has 805 places, 2060 transitions, 158147 flow [2022-12-06 02:41:20,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-06 02:41:20,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:20,669 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:20,677 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-06 02:41:20,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 02:41:20,875 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1273893804, now seen corresponding path program 21 times [2022-12-06 02:41:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:20,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869577132] [2022-12-06 02:41:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:21,026 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-06 02:41:21,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:21,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869577132] [2022-12-06 02:41:21,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869577132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:21,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379644948] [2022-12-06 02:41:21,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:41:21,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:21,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:21,028 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:21,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 02:41:21,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:41:21,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:21,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:41:21,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:21,262 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-06 02:41:21,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:21,473 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-06 02:41:21,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379644948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:21,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:21,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 02:41:21,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54556762] [2022-12-06 02:41:21,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:21,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:41:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:41:21,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:41:21,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:21,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 2060 transitions, 158147 flow. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:41:21,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:21,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:21,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:26,430 INFO L130 PetriNetUnfolder]: 1387/3291 cut-off events. [2022-12-06 02:41:26,430 INFO L131 PetriNetUnfolder]: For 833/833 co-relation queries the response was YES. [2022-12-06 02:41:26,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128939 conditions, 3291 events. 1387/3291 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 28870 event pairs, 0 based on Foata normal form. 4/2417 useless extension candidates. Maximal degree in co-relation 116533. Up to 3184 conditions per place. [2022-12-06 02:41:26,565 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 428 selfloop transitions, 74 changer transitions 1554/2056 dead transitions. [2022-12-06 02:41:26,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 2056 transitions, 161955 flow [2022-12-06 02:41:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 02:41:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 02:41:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 218 transitions. [2022-12-06 02:41:26,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37264957264957266 [2022-12-06 02:41:26,567 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 819 predicate places. [2022-12-06 02:41:26,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:26,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 839 places, 2056 transitions, 161955 flow [2022-12-06 02:41:26,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 839 places, 2056 transitions, 161955 flow [2022-12-06 02:41:26,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:26,724 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:26,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 02:41:26,725 INFO L495 AbstractCegarLoop]: Abstraction has has 839 places, 2056 transitions, 161955 flow [2022-12-06 02:41:26,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 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-06 02:41:26,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:26,726 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:26,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:26,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 02:41:26,931 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1390284361, now seen corresponding path program 12 times [2022-12-06 02:41:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:26,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185827012] [2022-12-06 02:41:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:27,054 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-06 02:41:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:27,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185827012] [2022-12-06 02:41:27,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185827012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:27,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942179419] [2022-12-06 02:41:27,055 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:41:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:27,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:27,056 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:27,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 02:41:27,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:41:27,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:27,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 02:41:27,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:27,242 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-06 02:41:27,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:27,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942179419] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:27,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:27,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-12-06 02:41:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089240742] [2022-12-06 02:41:27,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:27,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:41:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:41:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:41:27,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:27,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 2056 transitions, 161955 flow. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-06 02:41:27,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:27,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:27,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:31,127 INFO L130 PetriNetUnfolder]: 1389/3295 cut-off events. [2022-12-06 02:41:31,127 INFO L131 PetriNetUnfolder]: For 840/840 co-relation queries the response was YES. [2022-12-06 02:41:31,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132394 conditions, 3295 events. 1389/3295 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 28959 event pairs, 0 based on Foata normal form. 8/2425 useless extension candidates. Maximal degree in co-relation 119915. Up to 3188 conditions per place. [2022-12-06 02:41:31,151 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 314 selfloop transitions, 4 changer transitions 1753/2071 dead transitions. [2022-12-06 02:41:31,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 2071 transitions, 167276 flow [2022-12-06 02:41:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 02:41:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 02:41:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 120 transitions. [2022-12-06 02:41:31,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 02:41:31,154 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 839 predicate places. [2022-12-06 02:41:31,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:31,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 859 places, 2071 transitions, 167276 flow [2022-12-06 02:41:31,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 859 places, 2071 transitions, 167276 flow [2022-12-06 02:41:31,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:31,265 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:31,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 02:41:31,265 INFO L495 AbstractCegarLoop]: Abstraction has has 859 places, 2071 transitions, 167276 flow [2022-12-06 02:41:31,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-06 02:41:31,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:31,266 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:31,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:31,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 02:41:31,470 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash -493057842, now seen corresponding path program 13 times [2022-12-06 02:41:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:31,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533052916] [2022-12-06 02:41:31,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:31,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533052916] [2022-12-06 02:41:31,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533052916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:31,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125473398] [2022-12-06 02:41:31,583 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:41:31,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:31,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:31,584 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:31,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 02:41:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:31,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:41:31,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:31,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:31,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125473398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:31,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:31,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 18 [2022-12-06 02:41:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831480776] [2022-12-06 02:41:31,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:31,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:41:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:31,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:41:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:41:31,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:31,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 859 places, 2071 transitions, 167276 flow. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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-06 02:41:31,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:31,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:31,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:36,112 INFO L130 PetriNetUnfolder]: 1407/3355 cut-off events. [2022-12-06 02:41:36,112 INFO L131 PetriNetUnfolder]: For 854/854 co-relation queries the response was YES. [2022-12-06 02:41:36,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138162 conditions, 3355 events. 1407/3355 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 29760 event pairs, 0 based on Foata normal form. 8/2469 useless extension candidates. Maximal degree in co-relation 125289. Up to 3248 conditions per place. [2022-12-06 02:41:36,128 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 85 selfloop transitions, 21 changer transitions 2060/2166 dead transitions. [2022-12-06 02:41:36,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 877 places, 2166 transitions, 179262 flow [2022-12-06 02:41:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:41:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:41:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 125 transitions. [2022-12-06 02:41:36,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2022-12-06 02:41:36,139 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 857 predicate places. [2022-12-06 02:41:36,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:36,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 877 places, 2166 transitions, 179262 flow [2022-12-06 02:41:36,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 877 places, 2166 transitions, 179262 flow [2022-12-06 02:41:36,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:36,236 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:36,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 02:41:36,237 INFO L495 AbstractCegarLoop]: Abstraction has has 877 places, 2166 transitions, 179262 flow [2022-12-06 02:41:36,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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-06 02:41:36,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:36,237 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:36,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:36,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 02:41:36,442 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1373903918, now seen corresponding path program 14 times [2022-12-06 02:41:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:36,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890696613] [2022-12-06 02:41:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:36,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:36,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890696613] [2022-12-06 02:41:36,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890696613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:36,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98283667] [2022-12-06 02:41:36,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:41:36,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:36,677 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:36,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 02:41:36,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:36,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:36,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:41:36,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:36,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:37,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98283667] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:37,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:37,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2022-12-06 02:41:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43792884] [2022-12-06 02:41:37,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:37,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:41:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:41:37,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:41:37,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:37,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 877 places, 2166 transitions, 179262 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:37,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:37,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:37,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:42,205 INFO L130 PetriNetUnfolder]: 1501/3600 cut-off events. [2022-12-06 02:41:42,205 INFO L131 PetriNetUnfolder]: For 920/920 co-relation queries the response was YES. [2022-12-06 02:41:42,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151852 conditions, 3600 events. 1501/3600 cut-off events. For 920/920 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 32546 event pairs, 0 based on Foata normal form. 3/2647 useless extension candidates. Maximal degree in co-relation 137855. Up to 3493 conditions per place. [2022-12-06 02:41:42,222 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 79 selfloop transitions, 27 changer transitions 2224/2330 dead transitions. [2022-12-06 02:41:42,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 2330 transitions, 197502 flow [2022-12-06 02:41:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:41:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:41:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 161 transitions. [2022-12-06 02:41:42,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 02:41:42,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 879 predicate places. [2022-12-06 02:41:42,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:42,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 899 places, 2330 transitions, 197502 flow [2022-12-06 02:41:42,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 899 places, 2330 transitions, 197502 flow [2022-12-06 02:41:42,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:42,343 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:42,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 02:41:42,343 INFO L495 AbstractCegarLoop]: Abstraction has has 899 places, 2330 transitions, 197502 flow [2022-12-06 02:41:42,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:42,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:42,344 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:42,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:42,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:42,549 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1340634098, now seen corresponding path program 15 times [2022-12-06 02:41:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:42,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642138352] [2022-12-06 02:41:42,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642138352] [2022-12-06 02:41:42,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642138352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:42,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798068507] [2022-12-06 02:41:42,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:41:42,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:42,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:42,677 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:42,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 02:41:42,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 02:41:42,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:42,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 02:41:42,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:42,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:41:43,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798068507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:43,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:43,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2022-12-06 02:41:43,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342195379] [2022-12-06 02:41:43,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:43,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:41:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:43,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:41:43,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:41:43,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:43,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 2330 transitions, 197502 flow. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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-06 02:41:43,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:43,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:43,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:50,128 INFO L130 PetriNetUnfolder]: 1501/3597 cut-off events. [2022-12-06 02:41:50,128 INFO L131 PetriNetUnfolder]: For 920/920 co-relation queries the response was YES. [2022-12-06 02:41:50,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155324 conditions, 3597 events. 1501/3597 cut-off events. For 920/920 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 32505 event pairs, 0 based on Foata normal form. 3/2644 useless extension candidates. Maximal degree in co-relation 141129. Up to 3490 conditions per place. [2022-12-06 02:41:50,148 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 0 selfloop transitions, 0 changer transitions 2327/2327 dead transitions. [2022-12-06 02:41:50,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 2327 transitions, 201904 flow [2022-12-06 02:41:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:41:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:41:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 163 transitions. [2022-12-06 02:41:50,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47246376811594204 [2022-12-06 02:41:50,153 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 900 predicate places. [2022-12-06 02:41:50,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:50,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 920 places, 2327 transitions, 201904 flow [2022-12-06 02:41:50,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 920 places, 2327 transitions, 201904 flow [2022-12-06 02:41:50,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:50,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:50,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 02:41:50,288 INFO L495 AbstractCegarLoop]: Abstraction has has 920 places, 2327 transitions, 201904 flow [2022-12-06 02:41:50,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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-06 02:41:50,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 02:41:50,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 02:41:50,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 02:41:50,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:50,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:50,498 INFO L458 BasicCegarLoop]: Path program histogram: [21, 15, 6] [2022-12-06 02:41:50,502 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:41:50,502 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:41:50,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:41:50 BasicIcfg [2022-12-06 02:41:50,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:41:50,505 INFO L158 Benchmark]: Toolchain (without parser) took 109906.65ms. Allocated memory was 183.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 159.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-06 02:41:50,505 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:41:50,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.48ms. Allocated memory is still 183.5MB. Free memory was 159.9MB in the beginning and 148.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 02:41:50,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.00ms. Allocated memory is still 183.5MB. Free memory was 148.4MB in the beginning and 147.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:41:50,506 INFO L158 Benchmark]: Boogie Preprocessor took 29.03ms. Allocated memory is still 183.5MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:41:50,506 INFO L158 Benchmark]: RCFGBuilder took 383.54ms. Allocated memory is still 183.5MB. Free memory was 145.7MB in the beginning and 131.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 02:41:50,506 INFO L158 Benchmark]: TraceAbstraction took 109158.49ms. Allocated memory was 183.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 130.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-06 02:41:50,507 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 183.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.48ms. Allocated memory is still 183.5MB. Free memory was 159.9MB in the beginning and 148.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.00ms. Allocated memory is still 183.5MB. Free memory was 148.4MB in the beginning and 147.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.03ms. Allocated memory is still 183.5MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 383.54ms. Allocated memory is still 183.5MB. Free memory was 145.7MB in the beginning and 131.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 109158.49ms. Allocated memory was 183.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 130.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 73 PlacesBefore, 20 PlacesAfterwards, 72 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 57 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 260, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 262, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 262, unknown conditional: 0, unknown unconditional: 262] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 411, Positive conditional cache size: 0, Positive unconditional cache size: 411, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 47 TransitionsBefore, 47 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, 32 PlacesBefore, 32 PlacesAfterwards, 79 TransitionsBefore, 79 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, 38 PlacesBefore, 38 PlacesAfterwards, 101 TransitionsBefore, 101 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, 44 PlacesBefore, 44 PlacesAfterwards, 109 TransitionsBefore, 109 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, 50 PlacesBefore, 50 PlacesAfterwards, 113 TransitionsBefore, 113 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, 56 PlacesBefore, 56 PlacesAfterwards, 112 TransitionsBefore, 112 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, 75 PlacesBefore, 75 PlacesAfterwards, 170 TransitionsBefore, 170 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, 96 PlacesBefore, 96 PlacesAfterwards, 220 TransitionsBefore, 220 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, 114 PlacesBefore, 114 PlacesAfterwards, 224 TransitionsBefore, 224 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, 129 PlacesBefore, 129 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 147 PlacesBefore, 147 PlacesAfterwards, 333 TransitionsBefore, 333 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, 164 PlacesBefore, 164 PlacesAfterwards, 347 TransitionsBefore, 347 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, 183 PlacesBefore, 183 PlacesAfterwards, 406 TransitionsBefore, 406 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, 205 PlacesBefore, 205 PlacesAfterwards, 410 TransitionsBefore, 410 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, 219 PlacesBefore, 219 PlacesAfterwards, 424 TransitionsBefore, 424 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, 227 PlacesBefore, 227 PlacesAfterwards, 434 TransitionsBefore, 434 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, 240 PlacesBefore, 240 PlacesAfterwards, 466 TransitionsBefore, 466 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, 257 PlacesBefore, 257 PlacesAfterwards, 510 TransitionsBefore, 510 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, 274 PlacesBefore, 274 PlacesAfterwards, 556 TransitionsBefore, 556 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, 286 PlacesBefore, 286 PlacesAfterwards, 563 TransitionsBefore, 563 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, 305 PlacesBefore, 305 PlacesAfterwards, 684 TransitionsBefore, 684 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, 321 PlacesBefore, 321 PlacesAfterwards, 718 TransitionsBefore, 718 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, 337 PlacesBefore, 337 PlacesAfterwards, 716 TransitionsBefore, 716 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, 348 PlacesBefore, 348 PlacesAfterwards, 744 TransitionsBefore, 744 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, 379 PlacesBefore, 379 PlacesAfterwards, 1042 TransitionsBefore, 1042 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, 421 PlacesBefore, 421 PlacesAfterwards, 1097 TransitionsBefore, 1097 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, 459 PlacesBefore, 459 PlacesAfterwards, 1093 TransitionsBefore, 1093 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, 1483 TransitionsBefore, 1483 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, 577 PlacesBefore, 577 PlacesAfterwards, 1476 TransitionsBefore, 1476 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, 625 PlacesBefore, 625 PlacesAfterwards, 1695 TransitionsBefore, 1695 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, 645 PlacesBefore, 645 PlacesAfterwards, 1716 TransitionsBefore, 1716 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, 671 PlacesBefore, 671 PlacesAfterwards, 1754 TransitionsBefore, 1754 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, 688 PlacesBefore, 688 PlacesAfterwards, 1829 TransitionsBefore, 1829 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, 702 PlacesBefore, 702 PlacesAfterwards, 1839 TransitionsBefore, 1839 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, 749 PlacesBefore, 749 PlacesAfterwards, 1979 TransitionsBefore, 1979 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, 789 PlacesBefore, 789 PlacesAfterwards, 2018 TransitionsBefore, 2018 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, 805 PlacesBefore, 805 PlacesAfterwards, 2060 TransitionsBefore, 2060 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, 839 PlacesBefore, 839 PlacesAfterwards, 2056 TransitionsBefore, 2056 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, 859 PlacesBefore, 859 PlacesAfterwards, 2071 TransitionsBefore, 2071 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, 877 PlacesBefore, 877 PlacesAfterwards, 2166 TransitionsBefore, 2166 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, 899 PlacesBefore, 899 PlacesAfterwards, 2330 TransitionsBefore, 2330 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, 920 PlacesBefore, 920 PlacesAfterwards, 2327 TransitionsBefore, 2327 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 97 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: 109.1s, OverallIterations: 42, TraceHistogramMax: 3, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 77.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7873 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7873 mSDsluCounter, 886 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 699 mSDsCounter, 851 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24335 IncrementalHoareTripleChecker+Invalid, 25186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 851 mSolverCounterUnsat, 187 mSDtfsCounter, 24335 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2027 GetRequests, 557 SyntacticMatches, 66 SemanticMatches, 1404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17429 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201904occurred in iteration=42, InterpolantAutomatonStates: 965, 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, 0.9s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1180 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 1617 ConstructedInterpolants, 0 QuantifiedInterpolants, 22556 SizeOfPredicates, 144 NumberOfNonLiveVariables, 4486 ConjunctsInSsa, 884 ConjunctsInUnsatCore, 114 InterpolantComputations, 6 PerfectInterpolantSequences, 18/387 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 02:41:50,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...