/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-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:43:19,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:43:19,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:43:19,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:43:19,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:43:19,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:43:19,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:43:19,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:43:19,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:43:19,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:43:19,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:43:19,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:43:19,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:43:19,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:43:19,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:43:19,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:43:19,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:43:19,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:43:19,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:43:19,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:43:19,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:43:19,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:43:19,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:43:19,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:43:19,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:43:19,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:43:19,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:43:19,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:43:19,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:43:19,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:43:19,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:43:19,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:43:19,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:43:19,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:43:19,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:43:19,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:43:19,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:43:19,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:43:19,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:43:19,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:43:19,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:43:19,791 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:43:19,822 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:43:19,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:43:19,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:43:19,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:43:19,825 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:43:19,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:43:19,826 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:43:19,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:43:19,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:43:19,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:43:19,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:43:19,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:43:19,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:43:19,828 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:43:19,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:43:19,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:43:19,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:43:19,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:43:19,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:43:19,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:43:19,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:43:19,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:43:19,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:43:19,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:43:19,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:43:19,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:43:19,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:43:19,831 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:43:19,831 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:43:20,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:43:20,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:43:20,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:43:20,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:43:20,214 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:43:20,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-12-06 02:43:21,422 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:43:21,671 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:43:21,671 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-12-06 02:43:21,682 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806a94992/90d00835ae474b079d39a77f52744d02/FLAG6dcc99e5c [2022-12-06 02:43:21,700 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806a94992/90d00835ae474b079d39a77f52744d02 [2022-12-06 02:43:21,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:43:21,704 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:43:21,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:43:21,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:43:21,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:43:21,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:43:21" (1/1) ... [2022-12-06 02:43:21,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b4ac9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:21, skipping insertion in model container [2022-12-06 02:43:21,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:43:21" (1/1) ... [2022-12-06 02:43:21,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:43:21,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:43:21,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:43:21,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:43:21,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:43:21,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:43:21,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:43:21,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:43:21,931 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-more-array-sum2.wvr.c[2599,2612] [2022-12-06 02:43:21,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:43:21,963 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:43:21,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:43:21,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:43:21,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:43:21,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:43:21,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:43:21,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:43:22,003 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-more-array-sum2.wvr.c[2599,2612] [2022-12-06 02:43:22,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:43:22,029 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:43:22,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22 WrapperNode [2022-12-06 02:43:22,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:43:22,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:43:22,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:43:22,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:43:22,038 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:43:22" (1/1) ... [2022-12-06 02:43:22,057 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:43:22" (1/1) ... [2022-12-06 02:43:22,086 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 271 [2022-12-06 02:43:22,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:43:22,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:43:22,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:43:22,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:43:22,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:43:22,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:43:22,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:43:22,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:43:22,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (1/1) ... [2022-12-06 02:43:22,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:43:22,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:22,165 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:43:22,179 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:43:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:43:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:43:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:43:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:43:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:43:22,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:43:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:43:22,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:43:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:43:22,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:43:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:43:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:43:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:43:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:43:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:43:22,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:43:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:43:22,211 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:43:22,310 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:43:22,312 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:43:22,808 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:43:23,097 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:43:23,097 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 02:43:23,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:43:23 BoogieIcfgContainer [2022-12-06 02:43:23,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:43:23,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:43:23,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:43:23,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:43:23,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:43:21" (1/3) ... [2022-12-06 02:43:23,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6cda71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:43:23, skipping insertion in model container [2022-12-06 02:43:23,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:43:22" (2/3) ... [2022-12-06 02:43:23,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6cda71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:43:23, skipping insertion in model container [2022-12-06 02:43:23,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:43:23" (3/3) ... [2022-12-06 02:43:23,108 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2022-12-06 02:43:23,125 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:43:23,125 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:43:23,125 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:43:23,192 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:43:23,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 176 transitions, 376 flow [2022-12-06 02:43:23,312 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-12-06 02:43:23,313 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:43:23,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 173 events. 16/173 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2022-12-06 02:43:23,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 176 transitions, 376 flow [2022-12-06 02:43:23,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 163 transitions, 344 flow [2022-12-06 02:43:23,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:23,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 163 transitions, 344 flow [2022-12-06 02:43:23,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 344 flow [2022-12-06 02:43:23,376 INFO L130 PetriNetUnfolder]: 16/163 cut-off events. [2022-12-06 02:43:23,377 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:43:23,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 163 events. 16/163 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 104 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2022-12-06 02:43:23,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 163 transitions, 344 flow [2022-12-06 02:43:23,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 02:43:30,889 INFO L203 LiptonReduction]: Total number of compositions: 137 [2022-12-06 02:43:30,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:43:30,908 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;@471167c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:43:30,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:43:30,915 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2022-12-06 02:43:30,916 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:43:30,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:30,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:30,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash 902596479, now seen corresponding path program 1 times [2022-12-06 02:43:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:30,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627977614] [2022-12-06 02:43:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627977614] [2022-12-06 02:43:31,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627977614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:31,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:31,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:43:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640045583] [2022-12-06 02:43:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:31,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:43:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:43:31,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:43:31,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 02:43:31,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:31,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:31,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 02:43:31,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:31,630 INFO L130 PetriNetUnfolder]: 339/472 cut-off events. [2022-12-06 02:43:31,631 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 02:43:31,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 472 events. 339/472 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1518 event pairs, 132 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 756. Up to 365 conditions per place. [2022-12-06 02:43:31,640 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 31 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-06 02:43:31,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 164 flow [2022-12-06 02:43:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:43:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:43:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 02:43:31,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41346153846153844 [2022-12-06 02:43:31,656 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2022-12-06 02:43:31,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:31,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 164 flow [2022-12-06 02:43:31,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 164 flow [2022-12-06 02:43:31,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 02:43:31,667 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:31,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 02:43:31,670 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 164 flow [2022-12-06 02:43:31,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:31,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:31,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:31,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:43:31,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:31,675 INFO L85 PathProgramCache]: Analyzing trace with hash 624417299, now seen corresponding path program 1 times [2022-12-06 02:43:31,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:31,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538592654] [2022-12-06 02:43:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:31,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:31,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538592654] [2022-12-06 02:43:31,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538592654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:31,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:31,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:43:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051285364] [2022-12-06 02:43:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:31,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:43:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:31,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:43:31,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:43:31,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 02:43:31,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:43:31,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:31,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 02:43:31,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:32,097 INFO L130 PetriNetUnfolder]: 340/476 cut-off events. [2022-12-06 02:43:32,098 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 02:43:32,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 476 events. 340/476 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1543 event pairs, 87 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 1120. Up to 368 conditions per place. [2022-12-06 02:43:32,102 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 40 selfloop transitions, 5 changer transitions 2/49 dead transitions. [2022-12-06 02:43:32,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 316 flow [2022-12-06 02:43:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:43:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:43:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 02:43:32,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3769230769230769 [2022-12-06 02:43:32,104 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2022-12-06 02:43:32,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:32,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 49 transitions, 316 flow [2022-12-06 02:43:32,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 49 transitions, 316 flow [2022-12-06 02:43:32,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 02:43:32,110 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:32,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:43:32,111 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 49 transitions, 316 flow [2022-12-06 02:43:32,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:43:32,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:32,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:32,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:43:32,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1633204203, now seen corresponding path program 1 times [2022-12-06 02:43:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:32,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419513704] [2022-12-06 02:43:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419513704] [2022-12-06 02:43:32,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419513704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488322644] [2022-12-06 02:43:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:32,215 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:43:32,280 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:43:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:32,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:43:32,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:32,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:43:32,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488322644] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:32,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:43:32,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-12-06 02:43:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468651092] [2022-12-06 02:43:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:43:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:32,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:43:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:43:32,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 02:43:32,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 49 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:43:32,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:32,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 02:43:32,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:32,638 INFO L130 PetriNetUnfolder]: 394/562 cut-off events. [2022-12-06 02:43:32,638 INFO L131 PetriNetUnfolder]: For 153/165 co-relation queries the response was YES. [2022-12-06 02:43:32,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 562 events. 394/562 cut-off events. For 153/165 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1913 event pairs, 42 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 1766. Up to 422 conditions per place. [2022-12-06 02:43:32,645 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 58 selfloop transitions, 6 changer transitions 3/69 dead transitions. [2022-12-06 02:43:32,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 69 transitions, 576 flow [2022-12-06 02:43:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:43:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:43:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 02:43:32,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2022-12-06 02:43:32,648 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2022-12-06 02:43:32,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:32,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 69 transitions, 576 flow [2022-12-06 02:43:32,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 69 transitions, 576 flow [2022-12-06 02:43:32,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 02:43:32,656 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:32,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:43:32,657 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 69 transitions, 576 flow [2022-12-06 02:43:32,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:43:32,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:32,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:32,670 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:43:32,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:32,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1581849019, now seen corresponding path program 1 times [2022-12-06 02:43:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:32,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634850628] [2022-12-06 02:43:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:35,042 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:43:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634850628] [2022-12-06 02:43:35,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634850628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207817766] [2022-12-06 02:43:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:35,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:35,046 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:43:35,050 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:43:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:35,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 02:43:35,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:35,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:35,554 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 02:43:35,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-06 02:43:35,604 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:43:35,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:35,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:35,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 94 [2022-12-06 02:43:35,922 INFO L321 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2022-12-06 02:43:35,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 38 [2022-12-06 02:43:36,217 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:43:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207817766] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:36,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:36,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2022-12-06 02:43:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188405987] [2022-12-06 02:43:36,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:43:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:43:36,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:43:36,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:43:36,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 69 transitions, 576 flow. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 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:43:36,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:36,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:43:36,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:39,016 INFO L130 PetriNetUnfolder]: 828/1199 cut-off events. [2022-12-06 02:43:39,016 INFO L131 PetriNetUnfolder]: For 514/520 co-relation queries the response was YES. [2022-12-06 02:43:39,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5877 conditions, 1199 events. 828/1199 cut-off events. For 514/520 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4797 event pairs, 42 based on Foata normal form. 7/905 useless extension candidates. Maximal degree in co-relation 3933. Up to 896 conditions per place. [2022-12-06 02:43:39,028 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 177 selfloop transitions, 86 changer transitions 7/271 dead transitions. [2022-12-06 02:43:39,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 271 transitions, 2783 flow [2022-12-06 02:43:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 02:43:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 02:43:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 197 transitions. [2022-12-06 02:43:39,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28062678062678065 [2022-12-06 02:43:39,033 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 37 predicate places. [2022-12-06 02:43:39,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:39,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 271 transitions, 2783 flow [2022-12-06 02:43:39,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 271 transitions, 2783 flow [2022-12-06 02:43:39,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 02:43:45,940 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 02:43:45,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6908 [2022-12-06 02:43:45,941 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 263 transitions, 2703 flow [2022-12-06 02:43:45,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 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:43:45,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:45,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:45,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:43:46,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 02:43:46,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1129026889, now seen corresponding path program 1 times [2022-12-06 02:43:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:46,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806368431] [2022-12-06 02:43:46,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:47,331 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:43:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:47,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806368431] [2022-12-06 02:43:47,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806368431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:47,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133184353] [2022-12-06 02:43:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:47,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:47,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:47,334 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:43:47,361 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:43:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:47,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-06 02:43:47,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:47,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13430 treesize of output 13302 [2022-12-06 02:43:47,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-06 02:43:47,785 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:43:47,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 02:43:48,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:48,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:48,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:48,387 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 02:43:48,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-06 02:43:48,414 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:43:48,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:50,787 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 4 c_~M~0))) (let ((.cse1 (+ c_~A~0.offset .cse8)) (.cse3 (+ .cse8 c_~B~0.offset))) (and (forall ((~B~0.base Int) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse0 (select .cse4 c_~A~0.base)) (.cse2 (select .cse4 ~B~0.base))) (< (+ (select .cse0 .cse1) c_~res2~0 (select .cse2 .cse3)) (+ c_~res1~0 (select .cse0 c_~A~0.offset) (select .cse2 c_~B~0.offset) 1))))) (forall ((~B~0.base Int) (v_ArrVal_234 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse5 (select .cse7 c_~A~0.base)) (.cse6 (select .cse7 ~B~0.base))) (<= (+ c_~res1~0 (select .cse5 c_~A~0.offset) (select .cse6 c_~B~0.offset)) (+ (select .cse5 .cse1) c_~res2~0 (select .cse6 .cse3))))))))) is different from false [2022-12-06 02:43:50,798 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:43:50,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133184353] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:50,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:50,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-12-06 02:43:50,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374766478] [2022-12-06 02:43:50,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:50,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:43:50,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:50,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:43:50,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=398, Unknown=18, NotChecked=42, Total=552 [2022-12-06 02:43:50,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:43:50,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 263 transitions, 2703 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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:43:50,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:50,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:43:50,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:50,928 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (* 4 c_~M~0))) (let ((.cse12 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse13))) (let ((.cse7 (select .cse12 .cse2)) (.cse3 (+ .cse13 c_~B~0.offset)) (.cse5 (select .cse12 c_~A~0.offset))) (and (forall ((~B~0.base Int) (v_ArrVal_234 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse0 (select .cse4 c_~A~0.base)) (.cse1 (select .cse4 ~B~0.base))) (<= (+ c_~res1~0 (select .cse0 c_~A~0.offset) (select .cse1 c_~B~0.offset)) (+ (select .cse0 .cse2) c_~res2~0 (select .cse1 .cse3)))))) (forall ((~B~0.base Int)) (let ((.cse6 (select |c_#memory_int| ~B~0.base))) (<= (+ .cse5 (select .cse6 c_~B~0.offset) c_~res1~0) (+ c_~res2~0 .cse7 (select .cse6 .cse3))))) (<= c_~res1~0 c_~res2~0) (< c_~res2~0 (+ c_~res1~0 1)) (forall ((~B~0.base Int) (v_ArrVal_234 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_234))) (let ((.cse8 (select .cse10 c_~A~0.base)) (.cse9 (select .cse10 ~B~0.base))) (< (+ (select .cse8 .cse2) c_~res2~0 (select .cse9 .cse3)) (+ c_~res1~0 (select .cse8 c_~A~0.offset) (select .cse9 c_~B~0.offset) 1))))) (forall ((~B~0.base Int)) (let ((.cse11 (select |c_#memory_int| ~B~0.base))) (< (+ c_~res2~0 .cse7 (select .cse11 .cse3)) (+ .cse5 (select .cse11 c_~B~0.offset) c_~res1~0 1)))))))) is different from false [2022-12-06 02:43:53,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:43:55,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:43:57,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:44:00,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:44:00,108 INFO L130 PetriNetUnfolder]: 1322/1925 cut-off events. [2022-12-06 02:44:00,108 INFO L131 PetriNetUnfolder]: For 1671/1671 co-relation queries the response was YES. [2022-12-06 02:44:00,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10802 conditions, 1925 events. 1322/1925 cut-off events. For 1671/1671 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7637 event pairs, 122 based on Foata normal form. 1/1500 useless extension candidates. Maximal degree in co-relation 7448. Up to 1347 conditions per place. [2022-12-06 02:44:00,124 INFO L137 encePairwiseOnDemand]: 6/30 looper letters, 280 selfloop transitions, 67 changer transitions 6/353 dead transitions. [2022-12-06 02:44:00,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 353 transitions, 4303 flow [2022-12-06 02:44:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:44:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:44:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 150 transitions. [2022-12-06 02:44:00,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 02:44:00,128 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2022-12-06 02:44:00,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:00,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 353 transitions, 4303 flow [2022-12-06 02:44:00,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 353 transitions, 4303 flow [2022-12-06 02:44:00,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:00,143 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:00,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 02:44:00,144 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 353 transitions, 4303 flow [2022-12-06 02:44:00,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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:44:00,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:00,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:00,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:00,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:00,350 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2131454571, now seen corresponding path program 2 times [2022-12-06 02:44:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:00,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920610022] [2022-12-06 02:44:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:01,234 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:44:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920610022] [2022-12-06 02:44:01,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920610022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:01,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656856899] [2022-12-06 02:44:01,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:44:01,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:01,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:01,237 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:44:01,243 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:44:01,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:44:01,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:01,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-06 02:44:01,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:01,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:01,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:01,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:01,406 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:44:01,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 02:44:01,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:44:01,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:01,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:01,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 02:44:01,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:44:01,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:44:01,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:44:01,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-06 02:44:01,782 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:44:01,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:01,941 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 4 c_~M~0))) (let ((.cse2 (+ c_~A~0.offset .cse8)) (.cse3 (+ .cse8 c_~B~0.offset))) (and (forall ((v_ArrVal_321 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_321))) (let ((.cse1 (select .cse4 c_~A~0.base)) (.cse0 (select .cse4 c_~B~0.base))) (<= (+ (select .cse0 c_~B~0.offset) c_~res1~0 (select .cse1 c_~A~0.offset)) (+ (select .cse1 .cse2) c_~res2~0 (select .cse0 .cse3)))))) (forall ((v_ArrVal_321 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_321))) (let ((.cse6 (select .cse7 c_~B~0.base)) (.cse5 (select .cse7 c_~A~0.base))) (< (+ (select .cse5 .cse2) c_~res2~0 (select .cse6 .cse3)) (+ (select .cse6 c_~B~0.offset) c_~res1~0 (select .cse5 c_~A~0.offset) 1)))))))) is different from false [2022-12-06 02:44:01,964 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* 4 c_~M~0))) (let ((.cse1 (+ c_~A~0.offset .cse8)) (.cse3 (+ .cse8 c_~B~0.offset))) (and (forall ((v_ArrVal_320 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_321))) (let ((.cse0 (select .cse4 c_~A~0.base)) (.cse2 (select .cse4 c_~B~0.base))) (< (+ c_~res2~0 (select .cse0 .cse1) (select .cse2 .cse3)) (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse2 c_~B~0.offset) 1))))) (forall ((v_ArrVal_320 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_321))) (let ((.cse5 (select .cse7 c_~A~0.base)) (.cse6 (select .cse7 c_~B~0.base))) (<= (+ (select .cse5 c_~A~0.offset) c_~res1~0 (select .cse6 c_~B~0.offset)) (+ c_~res2~0 (select .cse5 .cse1) (select .cse6 .cse3))))))))) is different from false [2022-12-06 02:44:01,975 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:44:01,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656856899] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:01,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-12-06 02:44:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641791576] [2022-12-06 02:44:01,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:01,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:44:01,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:01,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:44:01,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=377, Unknown=2, NotChecked=82, Total=552 [2022-12-06 02:44:01,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:44:01,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 353 transitions, 4303 flow. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:01,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:01,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:44:01,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:03,202 INFO L130 PetriNetUnfolder]: 1576/2318 cut-off events. [2022-12-06 02:44:03,202 INFO L131 PetriNetUnfolder]: For 1827/1827 co-relation queries the response was YES. [2022-12-06 02:44:03,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15423 conditions, 2318 events. 1576/2318 cut-off events. For 1827/1827 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9867 event pairs, 88 based on Foata normal form. 3/1802 useless extension candidates. Maximal degree in co-relation 11208. Up to 1706 conditions per place. [2022-12-06 02:44:03,218 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 331 selfloop transitions, 93 changer transitions 17/441 dead transitions. [2022-12-06 02:44:03,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 441 transitions, 6260 flow [2022-12-06 02:44:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:44:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:44:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-12-06 02:44:03,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4175824175824176 [2022-12-06 02:44:03,221 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2022-12-06 02:44:03,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:03,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 441 transitions, 6260 flow [2022-12-06 02:44:03,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 441 transitions, 6260 flow [2022-12-06 02:44:03,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:03,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [941] L89-3-->L90-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre22#1_31|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre22#1_31|)) |v_#memory_int_176|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_177|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_25|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_176|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_31|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 02:44:03,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:44:03,429 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 02:44:03,429 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 440 transitions, 6252 flow [2022-12-06 02:44:03,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:03,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:03,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:03,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:03,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:03,637 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1887704917, now seen corresponding path program 3 times [2022-12-06 02:44:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:03,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921135996] [2022-12-06 02:44:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:04,603 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:44:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921135996] [2022-12-06 02:44:04,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921135996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639885657] [2022-12-06 02:44:04,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:44:04,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:04,608 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:44:04,637 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:44:04,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:44:04,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:04,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 02:44:04,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:04,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:04,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:04,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:04,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-12-06 02:44:04,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:44:04,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:04,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:04,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 02:44:04,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:44:05,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:05,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:05,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 02:44:05,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:44:05,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-06 02:44:05,168 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:44:05,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:05,688 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:44:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639885657] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:05,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:05,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-06 02:44:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057770362] [2022-12-06 02:44:05,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:44:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:44:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=369, Unknown=12, NotChecked=0, Total=462 [2022-12-06 02:44:05,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 02:44:05,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 440 transitions, 6252 flow. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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:44:05,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:05,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 02:44:05,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:07,718 INFO L130 PetriNetUnfolder]: 1942/2894 cut-off events. [2022-12-06 02:44:07,718 INFO L131 PetriNetUnfolder]: For 3027/3027 co-relation queries the response was YES. [2022-12-06 02:44:07,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21941 conditions, 2894 events. 1942/2894 cut-off events. For 3027/3027 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13046 event pairs, 126 based on Foata normal form. 2/2211 useless extension candidates. Maximal degree in co-relation 13308. Up to 2203 conditions per place. [2022-12-06 02:44:07,750 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 360 selfloop transitions, 158 changer transitions 45/576 dead transitions. [2022-12-06 02:44:07,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 576 transitions, 9363 flow [2022-12-06 02:44:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:44:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:44:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 170 transitions. [2022-12-06 02:44:07,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 02:44:07,753 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2022-12-06 02:44:07,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:07,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 576 transitions, 9363 flow [2022-12-06 02:44:07,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 576 transitions, 9363 flow [2022-12-06 02:44:07,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:07,776 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:07,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 02:44:07,778 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 576 transitions, 9363 flow [2022-12-06 02:44:07,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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:44:07,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:07,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:07,790 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:44:07,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:07,984 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1166048399, now seen corresponding path program 1 times [2022-12-06 02:44:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:07,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416796391] [2022-12-06 02:44:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:08,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416796391] [2022-12-06 02:44:08,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416796391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:44:08,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:44:08,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:44:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977797177] [2022-12-06 02:44:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:08,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:44:08,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:08,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:44:08,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:44:08,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 02:44:08,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 576 transitions, 9363 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:44:08,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:08,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 02:44:08,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:08,680 INFO L130 PetriNetUnfolder]: 2062/3086 cut-off events. [2022-12-06 02:44:08,680 INFO L131 PetriNetUnfolder]: For 3783/3783 co-relation queries the response was YES. [2022-12-06 02:44:08,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26021 conditions, 3086 events. 2062/3086 cut-off events. For 3783/3783 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14361 event pairs, 94 based on Foata normal form. 0/2323 useless extension candidates. Maximal degree in co-relation 17284. Up to 2411 conditions per place. [2022-12-06 02:44:08,705 INFO L137 encePairwiseOnDemand]: 28/30 looper letters, 506 selfloop transitions, 1 changer transitions 45/579 dead transitions. [2022-12-06 02:44:08,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 579 transitions, 10536 flow [2022-12-06 02:44:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:44:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:44:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 02:44:08,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-06 02:44:08,709 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2022-12-06 02:44:08,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:08,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 579 transitions, 10536 flow [2022-12-06 02:44:08,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 579 transitions, 10536 flow [2022-12-06 02:44:08,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:08,740 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:08,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 02:44:08,742 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 579 transitions, 10536 flow [2022-12-06 02:44:08,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:44:08,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:08,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:08,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:44:08,742 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1771227273, now seen corresponding path program 4 times [2022-12-06 02:44:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:08,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192534847] [2022-12-06 02:44:08,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:09,789 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:44:09,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:09,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192534847] [2022-12-06 02:44:09,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192534847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:09,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981300692] [2022-12-06 02:44:09,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:44:09,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:09,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:09,792 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:44:09,794 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:44:09,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:44:09,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:09,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 02:44:09,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:09,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:09,963 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-06 02:44:09,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-12-06 02:44:09,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:44:09,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 02:44:10,001 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:10,002 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-12-06 02:44:10,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:10,026 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-06 02:44:10,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2022-12-06 02:44:10,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 02:44:10,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:44:10,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:44:10,361 INFO L321 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2022-12-06 02:44:10,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 47 [2022-12-06 02:44:10,475 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:44:10,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:10,790 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:44:10,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981300692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:10,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:10,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 23 [2022-12-06 02:44:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511501741] [2022-12-06 02:44:10,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:10,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:44:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:10,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:44:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=504, Unknown=1, NotChecked=0, Total=600 [2022-12-06 02:44:10,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:44:10,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 579 transitions, 10536 flow. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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:44:10,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:10,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:44:10,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:13,587 INFO L130 PetriNetUnfolder]: 2775/4245 cut-off events. [2022-12-06 02:44:13,587 INFO L131 PetriNetUnfolder]: For 3837/3837 co-relation queries the response was YES. [2022-12-06 02:44:13,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40655 conditions, 4245 events. 2775/4245 cut-off events. For 3837/3837 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21701 event pairs, 128 based on Foata normal form. 5/3131 useless extension candidates. Maximal degree in co-relation 26195. Up to 3530 conditions per place. [2022-12-06 02:44:13,619 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 735 selfloop transitions, 157 changer transitions 72/964 dead transitions. [2022-12-06 02:44:13,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 964 transitions, 19457 flow [2022-12-06 02:44:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:44:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:44:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 261 transitions. [2022-12-06 02:44:13,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 02:44:13,622 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2022-12-06 02:44:13,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:13,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 964 transitions, 19457 flow [2022-12-06 02:44:13,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 964 transitions, 19457 flow [2022-12-06 02:44:13,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:13,662 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:13,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 02:44:13,663 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 964 transitions, 19457 flow [2022-12-06 02:44:13,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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:44:13,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:13,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:13,671 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:44:13,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:13,869 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1095836987, now seen corresponding path program 5 times [2022-12-06 02:44:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:13,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338866026] [2022-12-06 02:44:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:14,968 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:44:14,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:14,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338866026] [2022-12-06 02:44:14,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338866026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:14,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843299173] [2022-12-06 02:44:14,969 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:44:14,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:14,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:14,971 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:44:14,973 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:44:15,083 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:44:15,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:15,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 02:44:15,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:15,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 02:44:15,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-06 02:44:15,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-06 02:44:15,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:44:15,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 02:44:15,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:44:15,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 02:44:15,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:44:15,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 02:44:15,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:44:15,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-06 02:44:15,685 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:44:15,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:16,276 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:44:16,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843299173] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:16,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:16,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 02:44:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698223873] [2022-12-06 02:44:16,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:44:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:44:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=338, Unknown=10, NotChecked=0, Total=420 [2022-12-06 02:44:16,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:16,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 964 transitions, 19457 flow. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 states have internal predecessors, (72), 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:44:16,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:16,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:16,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:18,550 INFO L130 PetriNetUnfolder]: 3111/4755 cut-off events. [2022-12-06 02:44:18,550 INFO L131 PetriNetUnfolder]: For 5267/5267 co-relation queries the response was YES. [2022-12-06 02:44:18,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49891 conditions, 4755 events. 3111/4755 cut-off events. For 5267/5267 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 24955 event pairs, 116 based on Foata normal form. 2/3491 useless extension candidates. Maximal degree in co-relation 32597. Up to 3990 conditions per place. [2022-12-06 02:44:18,587 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 736 selfloop transitions, 206 changer transitions 85/1052 dead transitions. [2022-12-06 02:44:18,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 1052 transitions, 23333 flow [2022-12-06 02:44:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:44:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:44:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2022-12-06 02:44:18,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 02:44:18,589 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2022-12-06 02:44:18,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:18,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 1052 transitions, 23333 flow [2022-12-06 02:44:18,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 1052 transitions, 23333 flow [2022-12-06 02:44:18,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:18,636 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:18,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 02:44:18,637 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 1052 transitions, 23333 flow [2022-12-06 02:44:18,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 states have internal predecessors, (72), 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:44:18,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:18,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:18,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:18,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:18,843 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1603395023, now seen corresponding path program 6 times [2022-12-06 02:44:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:18,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825714166] [2022-12-06 02:44:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:19,800 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:44:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:19,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825714166] [2022-12-06 02:44:19,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825714166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:19,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6994525] [2022-12-06 02:44:19,801 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:44:19,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:19,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:19,802 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:44:19,805 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:44:19,933 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:44:19,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:19,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 02:44:19,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:20,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:44:20,175 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 02:44:20,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-06 02:44:20,205 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:44:20,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:20,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:20,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 82 [2022-12-06 02:44:20,564 INFO L321 Elim1Store]: treesize reduction 49, result has 32.9 percent of original size [2022-12-06 02:44:20,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 34 [2022-12-06 02:44:20,636 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:44:20,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6994525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:20,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:20,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2022-12-06 02:44:20,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254650876] [2022-12-06 02:44:20,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:20,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:44:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:20,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:44:20,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:44:20,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:20,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 1052 transitions, 23333 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 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:44:20,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:20,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:20,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:22,508 INFO L130 PetriNetUnfolder]: 3543/5399 cut-off events. [2022-12-06 02:44:22,508 INFO L131 PetriNetUnfolder]: For 6342/6342 co-relation queries the response was YES. [2022-12-06 02:44:22,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61498 conditions, 5399 events. 3543/5399 cut-off events. For 6342/6342 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 28942 event pairs, 110 based on Foata normal form. 6/3943 useless extension candidates. Maximal degree in co-relation 42264. Up to 4588 conditions per place. [2022-12-06 02:44:22,542 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 895 selfloop transitions, 140 changer transitions 106/1166 dead transitions. [2022-12-06 02:44:22,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 1166 transitions, 28162 flow [2022-12-06 02:44:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:44:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:44:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 145 transitions. [2022-12-06 02:44:22,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4131054131054131 [2022-12-06 02:44:22,544 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2022-12-06 02:44:22,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:22,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 1166 transitions, 28162 flow [2022-12-06 02:44:22,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 1166 transitions, 28162 flow [2022-12-06 02:44:22,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:22,587 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:22,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 02:44:22,587 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 1166 transitions, 28162 flow [2022-12-06 02:44:22,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 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:44:22,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:22,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:22,595 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:44:22,795 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,SelfDestructingSolverStorable10 [2022-12-06 02:44:22,796 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:22,796 INFO L85 PathProgramCache]: Analyzing trace with hash 93956172, now seen corresponding path program 1 times [2022-12-06 02:44:22,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:22,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736234239] [2022-12-06 02:44:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:22,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736234239] [2022-12-06 02:44:22,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736234239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:44:22,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:44:22,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:44:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738383665] [2022-12-06 02:44:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:22,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:44:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:22,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:44:22,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:44:22,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:22,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 1166 transitions, 28162 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:22,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:22,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:22,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:24,652 INFO L130 PetriNetUnfolder]: 4922/7661 cut-off events. [2022-12-06 02:44:24,652 INFO L131 PetriNetUnfolder]: For 27704/27704 co-relation queries the response was YES. [2022-12-06 02:44:24,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96221 conditions, 7661 events. 4922/7661 cut-off events. For 27704/27704 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 45982 event pairs, 57 based on Foata normal form. 0/5633 useless extension candidates. Maximal degree in co-relation 69684. Up to 6634 conditions per place. [2022-12-06 02:44:24,698 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 1974 selfloop transitions, 262 changer transitions 307/2558 dead transitions. [2022-12-06 02:44:24,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 2558 transitions, 67360 flow [2022-12-06 02:44:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:44:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:44:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-12-06 02:44:24,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5291005291005291 [2022-12-06 02:44:24,699 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2022-12-06 02:44:24,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:24,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 2558 transitions, 67360 flow [2022-12-06 02:44:24,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 2558 transitions, 67360 flow [2022-12-06 02:44:24,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:24,792 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:24,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 02:44:24,793 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 2558 transitions, 67360 flow [2022-12-06 02:44:24,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:24,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:24,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:24,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 02:44:24,793 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash -976503432, now seen corresponding path program 2 times [2022-12-06 02:44:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:24,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069346510] [2022-12-06 02:44:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:24,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069346510] [2022-12-06 02:44:24,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069346510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:44:24,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:44:24,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:44:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590420111] [2022-12-06 02:44:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:24,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:44:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:24,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:44:24,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:44:24,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:24,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 2558 transitions, 67360 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:24,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:24,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:24,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:28,344 INFO L130 PetriNetUnfolder]: 5407/8595 cut-off events. [2022-12-06 02:44:28,344 INFO L131 PetriNetUnfolder]: For 30991/30991 co-relation queries the response was YES. [2022-12-06 02:44:28,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116823 conditions, 8595 events. 5407/8595 cut-off events. For 30991/30991 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 54618 event pairs, 45 based on Foata normal form. 0/6436 useless extension candidates. Maximal degree in co-relation 85975. Up to 7475 conditions per place. [2022-12-06 02:44:28,395 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 2347 selfloop transitions, 210 changer transitions 482/3054 dead transitions. [2022-12-06 02:44:28,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 3054 transitions, 86611 flow [2022-12-06 02:44:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:44:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:44:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-06 02:44:28,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 02:44:28,397 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2022-12-06 02:44:28,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:28,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 3054 transitions, 86611 flow [2022-12-06 02:44:28,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 3054 transitions, 86611 flow [2022-12-06 02:44:28,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:28,529 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:28,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 02:44:28,530 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 3054 transitions, 86611 flow [2022-12-06 02:44:28,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:28,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:28,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:28,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 02:44:28,531 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash 425418952, now seen corresponding path program 3 times [2022-12-06 02:44:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:28,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409965637] [2022-12-06 02:44:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:28,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409965637] [2022-12-06 02:44:28,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409965637] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:28,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981172180] [2022-12-06 02:44:28,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:44:28,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:28,600 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:44:28,631 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:44:28,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:44:28,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:28,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 02:44:28,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:28,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:28,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981172180] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:28,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:44:28,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2022-12-06 02:44:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803064378] [2022-12-06 02:44:28,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:28,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:44:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:28,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:44:28,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:44:28,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:28,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 3054 transitions, 86611 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:28,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:28,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:28,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:32,832 INFO L130 PetriNetUnfolder]: 4799/7867 cut-off events. [2022-12-06 02:44:32,832 INFO L131 PetriNetUnfolder]: For 30623/30623 co-relation queries the response was YES. [2022-12-06 02:44:32,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114409 conditions, 7867 events. 4799/7867 cut-off events. For 30623/30623 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 51699 event pairs, 31 based on Foata normal form. 0/6184 useless extension candidates. Maximal degree in co-relation 82380. Up to 6773 conditions per place. [2022-12-06 02:44:32,880 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 2365 selfloop transitions, 54 changer transitions 591/3025 dead transitions. [2022-12-06 02:44:32,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 3025 transitions, 91804 flow [2022-12-06 02:44:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:44:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:44:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-06 02:44:32,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2022-12-06 02:44:32,882 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2022-12-06 02:44:32,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:32,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 3025 transitions, 91804 flow [2022-12-06 02:44:32,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 3025 transitions, 91804 flow [2022-12-06 02:44:32,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:32,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:32,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 02:44:32,984 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 3025 transitions, 91804 flow [2022-12-06 02:44:32,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:32,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:32,984 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:32,989 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:44:33,189 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,SelfDestructingSolverStorable13 [2022-12-06 02:44:33,189 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 500962563, now seen corresponding path program 7 times [2022-12-06 02:44:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:33,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468750413] [2022-12-06 02:44:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:33,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468750413] [2022-12-06 02:44:33,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468750413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:33,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178366650] [2022-12-06 02:44:33,256 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:44:33,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:33,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:33,258 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:44:33,261 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:44:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:33,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:44:33,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:33,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:44:33,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178366650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:44:33,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:44:33,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 02:44:33,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509348953] [2022-12-06 02:44:33,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:33,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:44:33,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:44:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:44:33,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 02:44:33,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 3025 transitions, 91804 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:44:33,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:33,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 02:44:33,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:37,125 INFO L130 PetriNetUnfolder]: 3923/6772 cut-off events. [2022-12-06 02:44:37,125 INFO L131 PetriNetUnfolder]: For 34978/34978 co-relation queries the response was YES. [2022-12-06 02:44:37,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104411 conditions, 6772 events. 3923/6772 cut-off events. For 34978/34978 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 47022 event pairs, 31 based on Foata normal form. 0/5745 useless extension candidates. Maximal degree in co-relation 72742. Up to 5744 conditions per place. [2022-12-06 02:44:37,166 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 1601 selfloop transitions, 74 changer transitions 896/2618 dead transitions. [2022-12-06 02:44:37,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 2618 transitions, 84580 flow [2022-12-06 02:44:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:44:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:44:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 02:44:37,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 02:44:37,167 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2022-12-06 02:44:37,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:37,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 2618 transitions, 84580 flow [2022-12-06 02:44:37,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 2618 transitions, 84580 flow [2022-12-06 02:44:37,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:37,246 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:37,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 02:44:37,246 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 2618 transitions, 84580 flow [2022-12-06 02:44:37,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:44:37,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:37,247 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:37,251 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:44:37,448 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,SelfDestructingSolverStorable14 [2022-12-06 02:44:37,449 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1043479675, now seen corresponding path program 8 times [2022-12-06 02:44:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:37,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668803078] [2022-12-06 02:44:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:37,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668803078] [2022-12-06 02:44:37,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668803078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:44:37,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:44:37,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:44:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136316362] [2022-12-06 02:44:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:44:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:44:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:37,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:44:37,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:44:37,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 02:44:37,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 2618 transitions, 84580 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:44:37,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:37,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 02:44:37,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:40,680 INFO L130 PetriNetUnfolder]: 2309/4340 cut-off events. [2022-12-06 02:44:40,680 INFO L131 PetriNetUnfolder]: For 29655/29655 co-relation queries the response was YES. [2022-12-06 02:44:40,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70545 conditions, 4340 events. 2309/4340 cut-off events. For 29655/29655 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 30749 event pairs, 25 based on Foata normal form. 0/4125 useless extension candidates. Maximal degree in co-relation 44272. Up to 3530 conditions per place. [2022-12-06 02:44:40,695 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 260 selfloop transitions, 9 changer transitions 1504/1784 dead transitions. [2022-12-06 02:44:40,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 1784 transitions, 60994 flow [2022-12-06 02:44:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:44:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:44:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 02:44:40,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2022-12-06 02:44:40,696 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2022-12-06 02:44:40,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:40,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 1784 transitions, 60994 flow [2022-12-06 02:44:40,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 1784 transitions, 60994 flow [2022-12-06 02:44:40,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:40,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:40,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 02:44:40,744 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 1784 transitions, 60994 flow [2022-12-06 02:44:40,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:44:40,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:40,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:40,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 02:44:40,744 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash -655279838, now seen corresponding path program 1 times [2022-12-06 02:44:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:40,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606471217] [2022-12-06 02:44:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:40,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606471217] [2022-12-06 02:44:40,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606471217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:40,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689845435] [2022-12-06 02:44:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:40,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:40,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:40,816 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:44:40,831 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:44:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:40,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:44:40,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:40,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:40,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689845435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:40,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:40,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 02:44:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082407606] [2022-12-06 02:44:40,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:40,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:44:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:44:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:44:40,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 02:44:40,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1784 transitions, 60994 flow. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:40,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:40,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 02:44:40,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:42,791 INFO L130 PetriNetUnfolder]: 2326/4332 cut-off events. [2022-12-06 02:44:42,791 INFO L131 PetriNetUnfolder]: For 36685/36685 co-relation queries the response was YES. [2022-12-06 02:44:42,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74176 conditions, 4332 events. 2326/4332 cut-off events. For 36685/36685 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 30552 event pairs, 15 based on Foata normal form. 0/4147 useless extension candidates. Maximal degree in co-relation 46757. Up to 3504 conditions per place. [2022-12-06 02:44:42,810 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 213 selfloop transitions, 46 changer transitions 1498/1767 dead transitions. [2022-12-06 02:44:42,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1767 transitions, 63795 flow [2022-12-06 02:44:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:44:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:44:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 02:44:42,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2022-12-06 02:44:42,811 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2022-12-06 02:44:42,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:42,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 1767 transitions, 63795 flow [2022-12-06 02:44:43,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 1767 transitions, 63795 flow [2022-12-06 02:44:43,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:43,029 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:43,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 02:44:43,030 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 1767 transitions, 63795 flow [2022-12-06 02:44:43,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:43,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:43,030 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:43,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 02:44:43,231 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:44:43,231 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1889728220, now seen corresponding path program 2 times [2022-12-06 02:44:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:43,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206267566] [2022-12-06 02:44:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:43,336 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:44:43,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:43,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206267566] [2022-12-06 02:44:43,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206267566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:43,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424695429] [2022-12-06 02:44:43,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:44:43,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:43,340 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:44:43,355 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:44:43,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:44:43,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:43,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:44:43,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:43,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:43,621 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:44:43,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424695429] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:43,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:43,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 02:44:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848234413] [2022-12-06 02:44:43,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:43,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:44:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:43,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:44:43,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:44:43,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:43,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 1767 transitions, 63795 flow. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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:44:43,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:43,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:43,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:45,777 INFO L130 PetriNetUnfolder]: 2893/5209 cut-off events. [2022-12-06 02:44:45,777 INFO L131 PetriNetUnfolder]: For 46432/46432 co-relation queries the response was YES. [2022-12-06 02:44:45,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94818 conditions, 5209 events. 2893/5209 cut-off events. For 46432/46432 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 36307 event pairs, 18 based on Foata normal form. 0/4808 useless extension candidates. Maximal degree in co-relation 49440. Up to 4336 conditions per place. [2022-12-06 02:44:45,803 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 524 selfloop transitions, 102 changer transitions 1498/2129 dead transitions. [2022-12-06 02:44:45,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 2129 transitions, 81176 flow [2022-12-06 02:44:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:44:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:44:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2022-12-06 02:44:45,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4506172839506173 [2022-12-06 02:44:45,805 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2022-12-06 02:44:45,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:45,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 2129 transitions, 81176 flow [2022-12-06 02:44:45,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 2129 transitions, 81176 flow [2022-12-06 02:44:45,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:45,872 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:45,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 02:44:45,873 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 2129 transitions, 81176 flow [2022-12-06 02:44:45,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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:44:45,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:45,873 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:45,878 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:44:46,075 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:44:46,076 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash -91080278, now seen corresponding path program 3 times [2022-12-06 02:44:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:46,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009768240] [2022-12-06 02:44:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:46,159 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:44:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009768240] [2022-12-06 02:44:46,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009768240] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:46,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530624727] [2022-12-06 02:44:46,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:44:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:46,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:46,161 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:44:46,174 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:44:46,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:44:46,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:46,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:44:46,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:46,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:46,433 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:44:46,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530624727] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:46,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:46,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 02:44:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047524648] [2022-12-06 02:44:46,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:46,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:44:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:46,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:44:46,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:44:46,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:46,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 2129 transitions, 81176 flow. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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:44:46,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:46,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:46,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:49,691 INFO L130 PetriNetUnfolder]: 3590/6276 cut-off events. [2022-12-06 02:44:49,691 INFO L131 PetriNetUnfolder]: For 47773/47773 co-relation queries the response was YES. [2022-12-06 02:44:49,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120506 conditions, 6276 events. 3590/6276 cut-off events. For 47773/47773 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 43127 event pairs, 26 based on Foata normal form. 0/5577 useless extension candidates. Maximal degree in co-relation 52123. Up to 5371 conditions per place. [2022-12-06 02:44:49,729 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 844 selfloop transitions, 176 changer transitions 1498/2523 dead transitions. [2022-12-06 02:44:49,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 2523 transitions, 101243 flow [2022-12-06 02:44:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:44:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:44:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 191 transitions. [2022-12-06 02:44:49,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44212962962962965 [2022-12-06 02:44:49,730 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2022-12-06 02:44:49,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:49,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 2523 transitions, 101243 flow [2022-12-06 02:44:49,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 2523 transitions, 101243 flow [2022-12-06 02:44:49,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:49,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:49,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 02:44:49,816 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 2523 transitions, 101243 flow [2022-12-06 02:44:49,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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:44:49,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:49,817 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:49,822 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:44:50,017 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:44:50,018 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1864360844, now seen corresponding path program 4 times [2022-12-06 02:44:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:50,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876311812] [2022-12-06 02:44:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:50,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:44:50,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:50,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876311812] [2022-12-06 02:44:50,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876311812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:50,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913290187] [2022-12-06 02:44:50,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:44:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:50,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:50,108 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:44:50,129 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:44:50,231 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:44:50,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:50,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:44:50,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:44:50,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:44:50,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913290187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:50,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:50,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 02:44:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303055760] [2022-12-06 02:44:50,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:50,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:44:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:44:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:44:50,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:44:50,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 2523 transitions, 101243 flow. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:50,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:50,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:44:50,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:54,085 INFO L130 PetriNetUnfolder]: 3609/6309 cut-off events. [2022-12-06 02:44:54,085 INFO L131 PetriNetUnfolder]: For 49179/49179 co-relation queries the response was YES. [2022-12-06 02:44:54,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127282 conditions, 6309 events. 3609/6309 cut-off events. For 49179/49179 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 43347 event pairs, 26 based on Foata normal form. 0/5608 useless extension candidates. Maximal degree in co-relation 54806. Up to 5404 conditions per place. [2022-12-06 02:44:54,118 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 926 selfloop transitions, 108 changer transitions 1498/2537 dead transitions. [2022-12-06 02:44:54,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 2537 transitions, 106857 flow [2022-12-06 02:44:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:44:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:44:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 02:44:54,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2022-12-06 02:44:54,120 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2022-12-06 02:44:54,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:54,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 2537 transitions, 106857 flow [2022-12-06 02:44:54,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 2537 transitions, 106857 flow [2022-12-06 02:44:54,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:54,197 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:54,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 02:44:54,198 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 2537 transitions, 106857 flow [2022-12-06 02:44:54,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:54,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:54,199 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:54,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 02:44:54,399 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:44:54,399 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1804144940, now seen corresponding path program 5 times [2022-12-06 02:44:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:54,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736547646] [2022-12-06 02:44:54,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:44:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:54,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736547646] [2022-12-06 02:44:54,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736547646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:54,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561329443] [2022-12-06 02:44:54,491 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:44:54,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:54,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:54,496 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:44:54,506 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:44:54,619 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:44:54,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:54,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:44:54,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:54,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:54,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561329443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:54,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:54,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 17 [2022-12-06 02:44:54,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989650562] [2022-12-06 02:44:54,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:54,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:44:54,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:54,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:44:54,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:44:54,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:44:54,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 2537 transitions, 106857 flow. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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:44:54,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:54,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:44:54,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:59,431 INFO L130 PetriNetUnfolder]: 3581/6253 cut-off events. [2022-12-06 02:44:59,432 INFO L131 PetriNetUnfolder]: For 45302/45302 co-relation queries the response was YES. [2022-12-06 02:44:59,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132374 conditions, 6253 events. 3581/6253 cut-off events. For 45302/45302 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 42732 event pairs, 12 based on Foata normal form. 0/5576 useless extension candidates. Maximal degree in co-relation 57537. Up to 5348 conditions per place. [2022-12-06 02:44:59,471 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 947 selfloop transitions, 210 changer transitions 1500/2657 dead transitions. [2022-12-06 02:44:59,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 2657 transitions, 116677 flow [2022-12-06 02:44:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:44:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:44:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 205 transitions. [2022-12-06 02:44:59,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3451178451178451 [2022-12-06 02:44:59,472 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 179 predicate places. [2022-12-06 02:44:59,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:59,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 2657 transitions, 116677 flow [2022-12-06 02:44:59,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 2657 transitions, 116677 flow [2022-12-06 02:44:59,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:59,557 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:59,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 02:44:59,558 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 2657 transitions, 116677 flow [2022-12-06 02:44:59,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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:44:59,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:59,558 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:59,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:59,759 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:44:59,760 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:59,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:59,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1137242336, now seen corresponding path program 6 times [2022-12-06 02:44:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:59,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429642356] [2022-12-06 02:44:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:44:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:59,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429642356] [2022-12-06 02:44:59,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429642356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:59,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513602223] [2022-12-06 02:44:59,847 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:44:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:59,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:59,852 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:44:59,879 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:44:59,999 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:44:59,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:45:00,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:45:00,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:00,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:00,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513602223] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:00,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:00,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 02:45:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705991855] [2022-12-06 02:45:00,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:00,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:45:00,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:45:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:45:00,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:45:00,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 2657 transitions, 116677 flow. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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:45:00,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:00,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:45:00,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:04,116 INFO L130 PetriNetUnfolder]: 3559/6203 cut-off events. [2022-12-06 02:45:04,116 INFO L131 PetriNetUnfolder]: For 45260/45260 co-relation queries the response was YES. [2022-12-06 02:45:04,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137318 conditions, 6203 events. 3559/6203 cut-off events. For 45260/45260 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 42284 event pairs, 12 based on Foata normal form. 0/5544 useless extension candidates. Maximal degree in co-relation 60220. Up to 5298 conditions per place. [2022-12-06 02:45:04,157 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 1013 selfloop transitions, 101 changer transitions 1500/2628 dead transitions. [2022-12-06 02:45:04,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 2628 transitions, 120595 flow [2022-12-06 02:45:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:45:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:45:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 02:45:04,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2022-12-06 02:45:04,158 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2022-12-06 02:45:04,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:04,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 2628 transitions, 120595 flow [2022-12-06 02:45:04,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 2628 transitions, 120595 flow [2022-12-06 02:45:04,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:04,253 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:04,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 02:45:04,254 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 2628 transitions, 120595 flow [2022-12-06 02:45:04,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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:45:04,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:04,254 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:04,259 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:45:04,454 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:45:04,455 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1347912744, now seen corresponding path program 7 times [2022-12-06 02:45:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183527010] [2022-12-06 02:45:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:04,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:04,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183527010] [2022-12-06 02:45:04,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183527010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:04,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728422420] [2022-12-06 02:45:04,548 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:45:04,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:04,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:04,552 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:45:04,576 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:45:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:45:04,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:04,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:04,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728422420] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:04,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:04,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 02:45:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782875676] [2022-12-06 02:45:04,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:45:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:45:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:45:04,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:45:04,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 2628 transitions, 120595 flow. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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:45:04,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:04,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:45:04,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:09,224 INFO L130 PetriNetUnfolder]: 3803/6567 cut-off events. [2022-12-06 02:45:09,224 INFO L131 PetriNetUnfolder]: For 51350/51350 co-relation queries the response was YES. [2022-12-06 02:45:09,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151884 conditions, 6567 events. 3803/6567 cut-off events. For 51350/51350 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 44607 event pairs, 12 based on Foata normal form. 0/5808 useless extension candidates. Maximal degree in co-relation 68216. Up to 5662 conditions per place. [2022-12-06 02:45:09,265 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 1141 selfloop transitions, 137 changer transitions 1500/2792 dead transitions. [2022-12-06 02:45:09,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 2792 transitions, 133727 flow [2022-12-06 02:45:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:45:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:45:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-12-06 02:45:09,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4897119341563786 [2022-12-06 02:45:09,266 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 193 predicate places. [2022-12-06 02:45:09,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:09,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 2792 transitions, 133727 flow [2022-12-06 02:45:09,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 2792 transitions, 133727 flow [2022-12-06 02:45:09,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:09,380 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:09,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 02:45:09,380 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 2792 transitions, 133727 flow [2022-12-06 02:45:09,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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:45:09,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:09,381 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:09,387 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:45:09,583 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:45:09,583 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2014815348, now seen corresponding path program 8 times [2022-12-06 02:45:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:09,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841314673] [2022-12-06 02:45:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:09,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:09,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841314673] [2022-12-06 02:45:09,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841314673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:09,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192714176] [2022-12-06 02:45:09,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:45:09,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:09,676 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:45:09,686 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:45:09,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:45:09,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:45:09,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:45:09,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:09,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:09,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192714176] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:09,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:09,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 02:45:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428462378] [2022-12-06 02:45:09,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:09,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:45:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:45:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:45:09,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:45:09,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 2792 transitions, 133727 flow. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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:45:09,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:09,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:45:09,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:15,853 INFO L130 PetriNetUnfolder]: 3774/6504 cut-off events. [2022-12-06 02:45:15,853 INFO L131 PetriNetUnfolder]: For 50719/50719 co-relation queries the response was YES. [2022-12-06 02:45:15,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156705 conditions, 6504 events. 3774/6504 cut-off events. For 50719/50719 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 43981 event pairs, 12 based on Foata normal form. 0/5767 useless extension candidates. Maximal degree in co-relation 69738. Up to 5599 conditions per place. [2022-12-06 02:45:15,898 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 1150 selfloop transitions, 91 changer transitions 1500/2755 dead transitions. [2022-12-06 02:45:15,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 2755 transitions, 137399 flow [2022-12-06 02:45:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:45:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:45:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 02:45:15,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-06 02:45:15,899 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2022-12-06 02:45:15,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:15,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 2755 transitions, 137399 flow [2022-12-06 02:45:16,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 2755 transitions, 137399 flow [2022-12-06 02:45:16,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:16,020 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:16,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 02:45:16,021 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 2755 transitions, 137399 flow [2022-12-06 02:45:16,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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:45:16,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:16,021 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:16,026 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:45:16,221 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:45:16,221 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash -60414690, now seen corresponding path program 9 times [2022-12-06 02:45:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:16,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701603177] [2022-12-06 02:45:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:16,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701603177] [2022-12-06 02:45:16,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701603177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:16,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013349327] [2022-12-06 02:45:16,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:45:16,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:16,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:16,312 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:45:16,338 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:45:16,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:45:16,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:45:16,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:45:16,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:16,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:16,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013349327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:16,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:16,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 02:45:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074470153] [2022-12-06 02:45:16,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:16,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:45:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:45:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:45:16,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:45:16,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 2755 transitions, 137399 flow. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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:45:16,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:16,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:45:16,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:21,457 INFO L130 PetriNetUnfolder]: 3802/6552 cut-off events. [2022-12-06 02:45:21,458 INFO L131 PetriNetUnfolder]: For 53963/53963 co-relation queries the response was YES. [2022-12-06 02:45:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164242 conditions, 6552 events. 3802/6552 cut-off events. For 53963/53963 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 44478 event pairs, 12 based on Foata normal form. 0/5811 useless extension candidates. Maximal degree in co-relation 73732. Up to 5647 conditions per place. [2022-12-06 02:45:21,501 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 1039 selfloop transitions, 225 changer transitions 1500/2778 dead transitions. [2022-12-06 02:45:21,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 2778 transitions, 144067 flow [2022-12-06 02:45:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:45:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:45:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 165 transitions. [2022-12-06 02:45:21,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2022-12-06 02:45:21,503 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2022-12-06 02:45:21,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:21,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 2778 transitions, 144067 flow [2022-12-06 02:45:21,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 2778 transitions, 144067 flow [2022-12-06 02:45:21,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:21,617 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:21,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 02:45:21,618 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 2778 transitions, 144067 flow [2022-12-06 02:45:21,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 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:45:21,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:21,619 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:21,624 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:45:21,820 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:45:21,820 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1635332468, now seen corresponding path program 10 times [2022-12-06 02:45:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:21,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483410785] [2022-12-06 02:45:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:21,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:21,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483410785] [2022-12-06 02:45:21,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483410785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:21,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947023768] [2022-12-06 02:45:21,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:45:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:21,940 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:45:21,960 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:45:22,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:45:22,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:45:22,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:45:22,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:22,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:45:22,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947023768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:22,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:22,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 02:45:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549348681] [2022-12-06 02:45:22,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:22,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:45:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:45:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:45:22,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:45:22,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 2778 transitions, 144067 flow. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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:45:22,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:22,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:45:22,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:27,694 INFO L130 PetriNetUnfolder]: 3774/6496 cut-off events. [2022-12-06 02:45:27,694 INFO L131 PetriNetUnfolder]: For 55240/55240 co-relation queries the response was YES. [2022-12-06 02:45:27,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169115 conditions, 6496 events. 3774/6496 cut-off events. For 55240/55240 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 43918 event pairs, 14 based on Foata normal form. 0/5779 useless extension candidates. Maximal degree in co-relation 75282. Up to 5591 conditions per place. [2022-12-06 02:45:27,739 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 1050 selfloop transitions, 183 changer transitions 1500/2747 dead transitions. [2022-12-06 02:45:27,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 2747 transitions, 147887 flow [2022-12-06 02:45:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:45:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:45:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-06 02:45:27,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-06 02:45:27,740 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2022-12-06 02:45:27,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:27,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 2747 transitions, 147887 flow [2022-12-06 02:45:27,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 2747 transitions, 147887 flow [2022-12-06 02:45:27,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:27,845 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:27,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 02:45:27,846 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 2747 transitions, 147887 flow [2022-12-06 02:45:27,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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:45:27,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:27,846 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:27,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 02:45:28,052 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:45:28,052 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1956246737, now seen corresponding path program 1 times [2022-12-06 02:45:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:28,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123966384] [2022-12-06 02:45:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:29,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123966384] [2022-12-06 02:45:29,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123966384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:29,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568408299] [2022-12-06 02:45:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:29,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:29,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:29,503 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:45:29,504 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:45:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:29,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-06 02:45:29,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:30,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:45:30,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:45:30,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:45:30,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:30,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:30,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:45:30,057 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-06 02:45:30,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 37 [2022-12-06 02:45:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:30,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:30,752 INFO L321 Elim1Store]: treesize reduction 20, result has 94.4 percent of original size [2022-12-06 02:45:30,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 350 [2022-12-06 02:45:43,126 INFO L321 Elim1Store]: treesize reduction 280, result has 21.6 percent of original size [2022-12-06 02:45:43,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 72 treesize of output 91 [2022-12-06 02:45:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:43,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568408299] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:43,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:43,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2022-12-06 02:45:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810654473] [2022-12-06 02:45:43,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:43,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 02:45:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 02:45:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-12-06 02:45:43,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:45:43,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 2747 transitions, 147887 flow. Second operand has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 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:45:43,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:43,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:45:43,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:48,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:45:56,502 INFO L130 PetriNetUnfolder]: 5400/9022 cut-off events. [2022-12-06 02:45:56,502 INFO L131 PetriNetUnfolder]: For 83293/83293 co-relation queries the response was YES. [2022-12-06 02:45:56,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244294 conditions, 9022 events. 5400/9022 cut-off events. For 83293/83293 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 61298 event pairs, 30 based on Foata normal form. 3/7899 useless extension candidates. Maximal degree in co-relation 106513. Up to 7661 conditions per place. [2022-12-06 02:45:56,573 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 1616 selfloop transitions, 650 changer transitions 1676/3942 dead transitions. [2022-12-06 02:45:56,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 3942 transitions, 218959 flow [2022-12-06 02:45:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 02:45:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 02:45:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 508 transitions. [2022-12-06 02:45:56,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36891793754538854 [2022-12-06 02:45:56,576 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2022-12-06 02:45:56,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:56,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 3942 transitions, 218959 flow [2022-12-06 02:45:56,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 3942 transitions, 218959 flow [2022-12-06 02:45:56,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:03,402 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 02:46:03,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6827 [2022-12-06 02:46:03,403 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 3939 transitions, 218791 flow [2022-12-06 02:46:03,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 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:46:03,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:03,403 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:03,410 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:46:03,604 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:46:03,605 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash -238917301, now seen corresponding path program 1 times [2022-12-06 02:46:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:03,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086719870] [2022-12-06 02:46:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:05,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086719870] [2022-12-06 02:46:05,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086719870] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:05,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929314440] [2022-12-06 02:46:05,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:05,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:05,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:05,334 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:46:05,336 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:46:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:05,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-06 02:46:05,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:05,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:05,585 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 02:46:05,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 02:46:05,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:05,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-12-06 02:46:05,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:05,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-12-06 02:46:05,627 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:46:05,628 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2022-12-06 02:46:05,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:05,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 28 [2022-12-06 02:46:05,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:05,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 02:46:05,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:05,776 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-06 02:46:05,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 297 treesize of output 275 [2022-12-06 02:46:05,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:05,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 02:46:05,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:46:06,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:06,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:06,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:06,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:06,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:06,156 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-06 02:46:06,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 44 [2022-12-06 02:46:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:06,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:09,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929314440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:09,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:09,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-12-06 02:46:09,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307183322] [2022-12-06 02:46:09,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:09,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:46:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:09,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:46:09,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=550, Unknown=7, NotChecked=0, Total=650 [2022-12-06 02:46:09,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:46:09,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 3939 transitions, 218791 flow. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:46:09,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:09,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:46:09,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:10,333 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~B~0.base))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~A~0.base)) (<= c_~N~0 2) (= c_~res2~0 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~B~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~A~0.offset 0) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~res1~0 0) (<= 0 c_~A~0.offset) (not (= c_~B~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (= c_~B~0.base c_~A~0.base) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse5 (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|))) (store (store (store (store (store (store |c_#memory_int| c_~A~0.base v_DerPreprocessor_4) c_~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| .cse6) c_~A~0.base v_DerPreprocessor_4) c_~B~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| .cse6)))) (let ((.cse1 (select .cse5 c_~A~0.base)) (.cse3 (select .cse5 c_~B~0.base)) (.cse2 (select |c_#memory_int| c_~B~0.base))) (and (= .cse1 v_DerPreprocessor_4) (= .cse1 (select |c_#memory_int| c_~A~0.base)) (= (select .cse2 c_~B~0.offset) (select .cse3 c_~B~0.offset)) (let ((.cse4 (+ 4 c_~B~0.offset))) (= (select .cse3 .cse4) (select .cse2 .cse4))))))) (<= .cse0 |ULTIMATE.start_main_~#t1~0#1.base|)))) (= c_~B~0.offset 0) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (= |c_thread1Thread1of1ForFork1_~i~0#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from true [2022-12-06 02:46:25,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:46:28,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:46:39,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:46:42,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:46:46,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:46:50,074 INFO L130 PetriNetUnfolder]: 6706/11010 cut-off events. [2022-12-06 02:46:50,074 INFO L131 PetriNetUnfolder]: For 91222/91222 co-relation queries the response was YES. [2022-12-06 02:46:50,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310345 conditions, 11010 events. 6706/11010 cut-off events. For 91222/91222 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 75683 event pairs, 28 based on Foata normal form. 3/9492 useless extension candidates. Maximal degree in co-relation 116735. Up to 9634 conditions per place. [2022-12-06 02:46:50,169 INFO L137 encePairwiseOnDemand]: 13/30 looper letters, 2282 selfloop transitions, 603 changer transitions 1936/4821 dead transitions. [2022-12-06 02:46:50,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 4821 transitions, 277761 flow [2022-12-06 02:46:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 02:46:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 02:46:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 371 transitions. [2022-12-06 02:46:50,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3435185185185185 [2022-12-06 02:46:50,172 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 295 predicate places. [2022-12-06 02:46:50,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:50,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 326 places, 4821 transitions, 277761 flow [2022-12-06 02:46:50,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 326 places, 4821 transitions, 277761 flow [2022-12-06 02:46:50,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:50,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [941] L89-3-->L90-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre22#1_31|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre22#1_31|)) |v_#memory_int_176|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_177|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_25|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_176|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_31|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 02:46:50,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [941] L89-3-->L90-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre22#1_31|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre22#1_31|)) |v_#memory_int_176|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_177|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_25|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_176|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_31|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 02:46:50,681 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:46:50,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-06 02:46:50,682 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 4819 transitions, 277709 flow [2022-12-06 02:46:50,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:46:50,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:50,682 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:50,691 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:46:50,888 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:46:50,888 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1139108981, now seen corresponding path program 1 times [2022-12-06 02:46:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:50,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131392031] [2022-12-06 02:46:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:50,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:51,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:51,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131392031] [2022-12-06 02:46:51,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131392031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:51,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983286647] [2022-12-06 02:46:51,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:51,736 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:46:51,739 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:46:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:51,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 02:46:51,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:52,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:52,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:52,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:52,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:52,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:52,500 INFO L321 Elim1Store]: treesize reduction 32, result has 44.8 percent of original size [2022-12-06 02:46:52,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 80 treesize of output 47 [2022-12-06 02:46:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:52,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:55,151 INFO L321 Elim1Store]: treesize reduction 20, result has 94.4 percent of original size [2022-12-06 02:46:55,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 350 [2022-12-06 02:47:27,772 INFO L321 Elim1Store]: treesize reduction 280, result has 21.6 percent of original size [2022-12-06 02:47:27,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 72 treesize of output 91 [2022-12-06 02:47:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:47:27,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983286647] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:47:27,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:47:27,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-06 02:47:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924316326] [2022-12-06 02:47:27,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:47:27,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:47:27,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:47:27,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:47:27,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=358, Unknown=1, NotChecked=0, Total=420 [2022-12-06 02:47:27,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:47:27,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 4819 transitions, 277709 flow. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:47:27,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:47:27,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:47:27,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:47:35,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:47:52,682 INFO L130 PetriNetUnfolder]: 8566/13995 cut-off events. [2022-12-06 02:47:52,683 INFO L131 PetriNetUnfolder]: For 109738/109738 co-relation queries the response was YES. [2022-12-06 02:47:52,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409915 conditions, 13995 events. 8566/13995 cut-off events. For 109738/109738 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 99521 event pairs, 10 based on Foata normal form. 3/11819 useless extension candidates. Maximal degree in co-relation 157988. Up to 12575 conditions per place. [2022-12-06 02:47:53,055 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 2870 selfloop transitions, 859 changer transitions 2271/6000 dead transitions. [2022-12-06 02:47:53,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 6000 transitions, 358583 flow [2022-12-06 02:47:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:47:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:47:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 354 transitions. [2022-12-06 02:47:53,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2022-12-06 02:47:53,057 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 323 predicate places. [2022-12-06 02:47:53,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:47:53,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 6000 transitions, 358583 flow [2022-12-06 02:47:53,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 354 places, 6000 transitions, 358583 flow [2022-12-06 02:47:53,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:47:53,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] $Ultimate##0-->L48-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [941] L89-3-->L90-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre22#1_31|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_177| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre22#1_31|)) |v_#memory_int_176|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_177|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_25|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_176|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_31|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 02:47:53,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:47:53,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 445 [2022-12-06 02:47:53,502 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 5999 transitions, 358555 flow [2022-12-06 02:47:53,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:47:53,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:47:53,502 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:47:53,508 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:47:53,708 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:47:53,708 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:47:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:47:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash -150320188, now seen corresponding path program 1 times [2022-12-06 02:47:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:47:53,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851541132] [2022-12-06 02:47:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:47:53,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:47:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:47:54,984 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:47:54,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:47:54,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851541132] [2022-12-06 02:47:54,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851541132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:47:54,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114230134] [2022-12-06 02:47:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:47:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:47:54,986 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:47:54,987 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:47:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:47:55,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-06 02:47:55,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:47:55,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:47:55,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:47:55,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:47:55,178 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:47:55,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-12-06 02:47:55,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:47:55,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-12-06 02:47:55,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:47:55,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 02:47:55,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:47:55,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:47:55,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:47:55,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:47:55,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:47:55,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 15 [2022-12-06 02:47:55,594 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:47:55,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:47:58,217 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:47:58,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114230134] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:47:58,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:47:58,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2022-12-06 02:47:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961016545] [2022-12-06 02:47:58,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:47:58,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:47:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:47:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:47:58,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=556, Unknown=6, NotChecked=0, Total=650 [2022-12-06 02:47:58,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 02:47:58,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 5999 transitions, 358555 flow. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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:47:58,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:47:58,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 02:47:58,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:48:37,775 INFO L130 PetriNetUnfolder]: 10837/17435 cut-off events. [2022-12-06 02:48:37,776 INFO L131 PetriNetUnfolder]: For 136098/136098 co-relation queries the response was YES. [2022-12-06 02:48:37,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528493 conditions, 17435 events. 10837/17435 cut-off events. For 136098/136098 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 125097 event pairs, 7 based on Foata normal form. 4/14450 useless extension candidates. Maximal degree in co-relation 221745. Up to 15990 conditions per place. [2022-12-06 02:48:37,941 INFO L137 encePairwiseOnDemand]: 14/35 looper letters, 3766 selfloop transitions, 1115 changer transitions 2445/7388 dead transitions. [2022-12-06 02:48:37,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 7388 transitions, 457014 flow [2022-12-06 02:48:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 02:48:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 02:48:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 386 transitions. [2022-12-06 02:48:37,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29806949806949806 [2022-12-06 02:48:37,943 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 358 predicate places. [2022-12-06 02:48:37,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:48:37,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 7388 transitions, 457014 flow [2022-12-06 02:48:38,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 7388 transitions, 457014 flow [2022-12-06 02:48:38,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:48:38,293 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:48:38,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-06 02:48:38,293 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 7388 transitions, 457014 flow [2022-12-06 02:48:38,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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:48:38,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:48:38,294 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:48:38,298 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:48:38,494 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:48:38,494 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:48:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:48:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1963758491, now seen corresponding path program 2 times [2022-12-06 02:48:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:48:38,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822862584] [2022-12-06 02:48:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:48:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:48:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:48:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:39,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:48:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822862584] [2022-12-06 02:48:39,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822862584] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:48:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254515538] [2022-12-06 02:48:39,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:48:39,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:39,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:48:39,533 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:48:39,563 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:48:39,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:48:39,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:48:39,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-06 02:48:39,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:48:40,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:48:40,051 INFO L321 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2022-12-06 02:48:40,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 59 [2022-12-06 02:48:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:40,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:48:40,933 INFO L321 Elim1Store]: treesize reduction 20, result has 94.4 percent of original size [2022-12-06 02:48:40,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 72 treesize of output 351 [2022-12-06 02:48:50,774 INFO L321 Elim1Store]: treesize reduction 276, result has 22.7 percent of original size [2022-12-06 02:48:50,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 94 [2022-12-06 02:48:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:50,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254515538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:48:50,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:48:50,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-12-06 02:48:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940361496] [2022-12-06 02:48:50,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:48:50,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:48:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:48:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:48:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2022-12-06 02:48:50,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:48:50,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 7388 transitions, 457014 flow. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 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:48:50,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:48:50,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:48:50,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:49:48,071 INFO L130 PetriNetUnfolder]: 13504/22422 cut-off events. [2022-12-06 02:49:48,071 INFO L131 PetriNetUnfolder]: For 150117/150117 co-relation queries the response was YES. [2022-12-06 02:49:48,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703537 conditions, 22422 events. 13504/22422 cut-off events. For 150117/150117 co-relation queries the response was YES. Maximal size of possible extension queue 1216. Compared 174667 event pairs, 17 based on Foata normal form. 3/18648 useless extension candidates. Maximal degree in co-relation 282566. Up to 20766 conditions per place. [2022-12-06 02:49:48,284 INFO L137 encePairwiseOnDemand]: 13/35 looper letters, 4927 selfloop transitions, 1641 changer transitions 3190/9758 dead transitions. [2022-12-06 02:49:48,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 9758 transitions, 623751 flow [2022-12-06 02:49:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:49:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:49:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 354 transitions. [2022-12-06 02:49:48,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3064935064935065 [2022-12-06 02:49:48,286 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 390 predicate places. [2022-12-06 02:49:48,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:49:48,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 421 places, 9758 transitions, 623751 flow [2022-12-06 02:49:48,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 421 places, 9758 transitions, 623751 flow [2022-12-06 02:49:48,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:49:48,790 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:49:48,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 505 [2022-12-06 02:49:48,791 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 9758 transitions, 623751 flow [2022-12-06 02:49:48,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 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:49:48,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:49:48,791 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:49:48,797 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:49:48,995 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:49:48,996 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:49:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:49:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1456278833, now seen corresponding path program 3 times [2022-12-06 02:49:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:49:48,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088428803] [2022-12-06 02:49:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:49:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:49:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:49:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:49:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:49:50,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088428803] [2022-12-06 02:49:50,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088428803] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:49:50,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54595041] [2022-12-06 02:49:50,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:49:50,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:49:50,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:49:50,203 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:49:50,203 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:49:50,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:49:50,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:49:50,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-06 02:49:50,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:49:50,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:49:50,911 INFO L321 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2022-12-06 02:49:50,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 59 [2022-12-06 02:49:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:49:50,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:49:51,797 INFO L321 Elim1Store]: treesize reduction 20, result has 94.4 percent of original size [2022-12-06 02:49:51,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 72 treesize of output 351 [2022-12-06 02:50:00,646 INFO L321 Elim1Store]: treesize reduction 280, result has 21.6 percent of original size [2022-12-06 02:50:00,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 90 [2022-12-06 02:50:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:00,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54595041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:50:00,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:50:00,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-06 02:50:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797927378] [2022-12-06 02:50:00,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:50:00,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:50:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:50:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-12-06 02:50:00,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:50:00,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 9758 transitions, 623751 flow. Second operand has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 states have internal predecessors, (58), 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:50:00,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:00,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:50:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:51:59,199 INFO L130 PetriNetUnfolder]: 17217/28639 cut-off events. [2022-12-06 02:51:59,199 INFO L131 PetriNetUnfolder]: For 161359/161359 co-relation queries the response was YES. [2022-12-06 02:51:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929483 conditions, 28639 events. 17217/28639 cut-off events. For 161359/161359 co-relation queries the response was YES. Maximal size of possible extension queue 1540. Compared 232869 event pairs, 48 based on Foata normal form. 8/23619 useless extension candidates. Maximal degree in co-relation 399175. Up to 26869 conditions per place. [2022-12-06 02:51:59,519 INFO L137 encePairwiseOnDemand]: 11/35 looper letters, 6217 selfloop transitions, 2497 changer transitions 3650/12364 dead transitions. [2022-12-06 02:51:59,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 12364 transitions, 815989 flow [2022-12-06 02:51:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-12-06 02:51:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-12-06 02:51:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 665 transitions. [2022-12-06 02:51:59,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2022-12-06 02:51:59,522 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 459 predicate places. [2022-12-06 02:51:59,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:51:59,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 490 places, 12364 transitions, 815989 flow [2022-12-06 02:52:00,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 490 places, 12364 transitions, 815989 flow [2022-12-06 02:52:00,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:52:00,414 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:52:00,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 893 [2022-12-06 02:52:00,415 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 12364 transitions, 815989 flow [2022-12-06 02:52:00,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 states have internal predecessors, (58), 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:52:00,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:52:00,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:52:00,421 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:52:00,615 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:52:00,616 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:52:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:52:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash -508399149, now seen corresponding path program 1 times [2022-12-06 02:52:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:52:00,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349771764] [2022-12-06 02:52:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:52:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:52:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:52:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:52:01,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:52:01,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349771764] [2022-12-06 02:52:01,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349771764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:52:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450247264] [2022-12-06 02:52:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:52:01,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:52:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:52:01,897 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:52:01,898 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:52:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:52:02,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:52:02,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:52:02,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 02:52:02,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 02:52:02,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-06 02:52:02,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,277 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 02:52:02,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-12-06 02:52:02,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,556 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 02:52:02,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-12-06 02:52:02,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:52:02,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:52:02,719 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-06 02:52:02,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 37 [2022-12-06 02:52:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:52:02,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:52:05,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (and (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< ~M~0 c_~N~0)) (forall ((v_ArrVal_2128 (Array Int Int))) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2128)) (.cse3 (* ~M~0 4))) (+ .cse0 c_~res2~0 .cse1 (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)))) (+ c_~res1~0 1))))) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< ~M~0 c_~N~0)) (forall ((v_ArrVal_2128 (Array Int Int))) (<= c_~res1~0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2128)) (.cse5 (* ~M~0 4))) (+ .cse0 c_~res2~0 .cse1 (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)) (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)))))))))) is different from false [2022-12-06 02:52:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:52:08,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450247264] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:52:08,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:52:08,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-12-06 02:52:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306101222] [2022-12-06 02:52:08,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:52:08,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:52:08,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:52:08,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:52:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=594, Unknown=24, NotChecked=50, Total=756 [2022-12-06 02:52:08,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:52:08,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 12364 transitions, 815989 flow. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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:52:08,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:52:08,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:52:08,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:52:23,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:52:25,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:52:32,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:52:34,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:55:07,711 INFO L130 PetriNetUnfolder]: 18316/30400 cut-off events. [2022-12-06 02:55:07,712 INFO L131 PetriNetUnfolder]: For 166582/166582 co-relation queries the response was YES. [2022-12-06 02:55:07,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017328 conditions, 30400 events. 18316/30400 cut-off events. For 166582/166582 co-relation queries the response was YES. Maximal size of possible extension queue 1611. Compared 248500 event pairs, 16 based on Foata normal form. 9/24990 useless extension candidates. Maximal degree in co-relation 444724. Up to 28630 conditions per place. [2022-12-06 02:55:08,048 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 8341 selfloop transitions, 967 changer transitions 3807/13115 dead transitions. [2022-12-06 02:55:08,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 13115 transitions, 891834 flow [2022-12-06 02:55:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 02:55:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 02:55:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 251 transitions. [2022-12-06 02:55:08,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3414965986394558 [2022-12-06 02:55:08,050 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 479 predicate places. [2022-12-06 02:55:08,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:55:08,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 510 places, 13115 transitions, 891834 flow [2022-12-06 02:55:08,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 510 places, 13115 transitions, 891834 flow [2022-12-06 02:55:08,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:55:08,987 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:55:08,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 938 [2022-12-06 02:55:08,988 INFO L495 AbstractCegarLoop]: Abstraction has has 510 places, 13115 transitions, 891834 flow [2022-12-06 02:55:08,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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:55:08,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:55:08,988 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:55:08,993 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:55:09,188 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:55:09,189 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:55:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:55:09,189 INFO L85 PathProgramCache]: Analyzing trace with hash -696026303, now seen corresponding path program 4 times [2022-12-06 02:55:09,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:55:09,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985583] [2022-12-06 02:55:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:55:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:55:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:55:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:55:10,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985583] [2022-12-06 02:55:10,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:55:10,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308119810] [2022-12-06 02:55:10,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:55:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:55:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:55:10,320 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:55:10,322 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:55:10,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:55:10,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:55:10,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-06 02:55:10,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:55:10,899 INFO L321 Elim1Store]: treesize reduction 56, result has 53.7 percent of original size [2022-12-06 02:55:10,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 79 [2022-12-06 02:55:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:11,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:55:11,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:55:11,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 72 treesize of output 371 [2022-12-06 02:55:44,669 INFO L321 Elim1Store]: treesize reduction 193, result has 45.9 percent of original size [2022-12-06 02:55:44,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 177 [2022-12-06 02:55:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:55:45,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308119810] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:55:45,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:55:45,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2022-12-06 02:55:45,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348329887] [2022-12-06 02:55:45,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:55:45,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:55:45,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:55:45,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:55:45,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-12-06 02:55:45,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:55:45,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 13115 transitions, 891834 flow. Second operand has 26 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 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:55:45,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:55:45,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:55:45,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:56:45,707 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:56:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 02:56:45,710 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:56:45,716 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:56:45,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:45,917 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:56:45,917 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/35 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 377106 conditions, 11097 events (7145/11096 cut-off events. For 114922/114922 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 83324 event pairs, 10 based on Foata normal form. 0/10630 useless extension candidates. Maximal degree in co-relation 215328. Up to 10116 conditions per place.). [2022-12-06 02:56:45,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:56:45,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:56:45,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:56:45,919 INFO L458 BasicCegarLoop]: Path program histogram: [10, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:45,922 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:56:45,922 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:56:45,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:56:45 BasicIcfg [2022-12-06 02:56:45,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:56:45,924 INFO L158 Benchmark]: Toolchain (without parser) took 804220.74ms. Allocated memory was 209.7MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 186.5MB in the beginning and 661.8MB in the end (delta: -475.2MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-06 02:56:45,924 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 209.7MB. Free memory is still 185.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:56:45,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.81ms. Allocated memory is still 209.7MB. Free memory was 186.1MB in the beginning and 173.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.71ms. Allocated memory is still 209.7MB. Free memory was 173.5MB in the beginning and 171.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,925 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 209.7MB. Free memory was 171.1MB in the beginning and 169.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,925 INFO L158 Benchmark]: RCFGBuilder took 972.55ms. Allocated memory is still 209.7MB. Free memory was 169.0MB in the beginning and 158.9MB in the end (delta: 10.1MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,925 INFO L158 Benchmark]: TraceAbstraction took 802822.53ms. Allocated memory was 209.7MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 158.3MB in the beginning and 661.8MB in the end (delta: -503.4MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-06 02:56:45,926 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 209.7MB. Free memory is still 185.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.81ms. Allocated memory is still 209.7MB. Free memory was 186.1MB in the beginning and 173.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.71ms. Allocated memory is still 209.7MB. Free memory was 173.5MB in the beginning and 171.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 209.7MB. Free memory was 171.1MB in the beginning and 169.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 972.55ms. Allocated memory is still 209.7MB. Free memory was 169.0MB in the beginning and 158.9MB in the end (delta: 10.1MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. * TraceAbstraction took 802822.53ms. Allocated memory was 209.7MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 158.3MB in the beginning and 661.8MB in the end (delta: -503.4MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 157 PlacesBefore, 31 PlacesAfterwards, 163 TransitionsBefore, 26 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 96 TrivialYvCompositions, 30 ConcurrentYvCompositions, 11 ChoiceCompositions, 137 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 715, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 721, independent: 715, independent conditional: 0, independent unconditional: 715, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 721, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 721, unknown conditional: 0, unknown unconditional: 721] , Statistics on independence cache: Total cache size (in pairs): 1137, Positive cache size: 1131, Positive conditional cache size: 0, Positive unconditional cache size: 1131, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 62 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, 49 TransitionsBefore, 49 TransitionsAfterwards, 78 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, 42 PlacesBefore, 42 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 68 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: 6.9s, 68 PlacesBefore, 58 PlacesAfterwards, 271 TransitionsBefore, 263 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 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, 64 PlacesBefore, 64 PlacesAfterwards, 353 TransitionsBefore, 353 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.2s, 76 PlacesBefore, 75 PlacesAfterwards, 441 TransitionsBefore, 440 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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, 87 PlacesBefore, 87 PlacesAfterwards, 576 TransitionsBefore, 576 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, 84 PlacesBefore, 84 PlacesAfterwards, 579 TransitionsBefore, 579 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, 112 PlacesBefore, 112 PlacesAfterwards, 964 TransitionsBefore, 964 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, 124 PlacesBefore, 124 PlacesAfterwards, 1052 TransitionsBefore, 1052 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, 136 PlacesBefore, 136 PlacesAfterwards, 1166 TransitionsBefore, 1166 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, 142 PlacesBefore, 142 PlacesAfterwards, 2558 TransitionsBefore, 2558 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, 3054 TransitionsBefore, 3054 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, 153 PlacesBefore, 153 PlacesAfterwards, 3025 TransitionsBefore, 3025 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, 156 PlacesBefore, 156 PlacesAfterwards, 2618 TransitionsBefore, 2618 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, 154 PlacesBefore, 154 PlacesAfterwards, 1784 TransitionsBefore, 1784 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, 158 PlacesBefore, 158 PlacesAfterwards, 1767 TransitionsBefore, 1767 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, 169 PlacesBefore, 169 PlacesAfterwards, 2129 TransitionsBefore, 2129 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, 184 PlacesBefore, 184 PlacesAfterwards, 2523 TransitionsBefore, 2523 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, 190 PlacesBefore, 190 PlacesAfterwards, 2537 TransitionsBefore, 2537 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, 210 PlacesBefore, 210 PlacesAfterwards, 2657 TransitionsBefore, 2657 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, 216 PlacesBefore, 216 PlacesAfterwards, 2628 TransitionsBefore, 2628 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, 224 PlacesBefore, 224 PlacesAfterwards, 2792 TransitionsBefore, 2792 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, 230 PlacesBefore, 230 PlacesAfterwards, 2755 TransitionsBefore, 2755 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, 242 PlacesBefore, 242 PlacesAfterwards, 2778 TransitionsBefore, 2778 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, 247 PlacesBefore, 247 PlacesAfterwards, 2747 TransitionsBefore, 2747 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: 6.7s, 297 PlacesBefore, 294 PlacesAfterwards, 3942 TransitionsBefore, 3939 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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.3s, 326 PlacesBefore, 324 PlacesAfterwards, 4821 TransitionsBefore, 4819 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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.2s, 354 PlacesBefore, 353 PlacesAfterwards, 6000 TransitionsBefore, 5999 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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, 389 PlacesBefore, 389 PlacesAfterwards, 7388 TransitionsBefore, 7388 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, 9758 TransitionsBefore, 9758 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, 490 PlacesBefore, 490 PlacesAfterwards, 12364 TransitionsBefore, 12364 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, 510 PlacesBefore, 510 PlacesAfterwards, 13115 TransitionsBefore, 13115 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/35 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 377106 conditions, 11097 events (7145/11096 cut-off events. For 114922/114922 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 83324 event pairs, 10 based on Foata normal form. 0/10630 useless extension candidates. Maximal degree in co-relation 215328. Up to 10116 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/35 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 377106 conditions, 11097 events (7145/11096 cut-off events. For 114922/114922 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 83324 event pairs, 10 based on Foata normal form. 0/10630 useless extension candidates. Maximal degree in co-relation 215328. Up to 10116 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/35 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 377106 conditions, 11097 events (7145/11096 cut-off events. For 114922/114922 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 83324 event pairs, 10 based on Foata normal form. 0/10630 useless extension candidates. Maximal degree in co-relation 215328. Up to 10116 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (26states, 0/35 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 377106 conditions, 11097 events (7145/11096 cut-off events. For 114922/114922 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 83324 event pairs, 10 based on Foata normal form. 0/10630 useless extension candidates. Maximal degree in co-relation 215328. Up to 10116 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 191 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 802.7s, OverallIterations: 34, TraceHistogramMax: 2, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 615.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 262 mSolverCounterUnknown, 5947 SdHoareTripleChecker+Valid, 65.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5947 mSDsluCounter, 1730 SdHoareTripleChecker+Invalid, 62.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 539 IncrementalHoareTripleChecker+Unchecked, 1508 mSDsCounter, 559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32274 IncrementalHoareTripleChecker+Invalid, 33634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 559 mSolverCounterUnsat, 222 mSDtfsCounter, 32274 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1826 GetRequests, 894 SyntacticMatches, 69 SemanticMatches, 863 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8919 ImplicationChecksByTransitivity, 76.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=891834occurred in iteration=33, InterpolantAutomatonStates: 553, 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.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 148.4s InterpolantComputationTime, 1406 NumberOfCodeBlocks, 1406 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 1933 ConstructedInterpolants, 107 QuantifiedInterpolants, 42489 SizeOfPredicates, 550 NumberOfNonLiveVariables, 8721 ConjunctsInSsa, 1223 ConjunctsInUnsatCore, 89 InterpolantComputations, 9 PerfectInterpolantSequences, 107/317 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown