/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-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:58:41,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:58:41,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:58:41,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:58:41,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:58:41,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:58:41,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:58:41,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:58:41,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:58:41,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:58:41,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:58:41,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:58:41,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:58:41,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:58:41,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:58:41,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:58:41,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:58:41,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:58:41,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:58:41,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:58:41,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:58:41,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:58:41,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:58:41,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:58:41,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:58:41,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:58:41,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:58:41,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:58:41,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:58:41,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:58:41,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:58:41,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:58:41,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:58:41,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:58:41,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:58:41,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:58:41,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:58:41,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:58:41,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:58:41,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:58:41,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:58:41,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 04:58:41,713 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:58:41,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:58:41,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:58:41,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:58:41,715 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:58:41,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:58:41,716 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:58:41,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:58:41,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:58:41,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:58:41,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:58:41,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:58:41,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:58:41,717 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:58:41,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:58:41,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:58:41,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:58:41,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:58:41,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:58:41,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:58:41,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:58:41,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:58:41,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:58:41,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:58:41,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:58:41,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:58:41,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:58:41,719 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:58:41,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:58:41,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:58:41,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:58:42,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:58:42,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:58:42,002 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:58:42,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-13 04:58:42,957 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:58:43,116 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:58:43,116 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-13 04:58:43,125 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec7ec23/8ea952249a11456fab67b23bd38c780c/FLAG1d5dedf25 [2022-12-13 04:58:43,141 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec7ec23/8ea952249a11456fab67b23bd38c780c [2022-12-13 04:58:43,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:58:43,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:58:43,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:58:43,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:58:43,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:58:43,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afd0b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43, skipping insertion in model container [2022-12-13 04:58:43,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:58:43,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:58:43,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:58:43,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:58:43,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:58:43,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:58:43,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:58:43,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:58:43,320 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-min-array-hom.wvr.c[2586,2599] [2022-12-13 04:58:43,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:58:43,340 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:58:43,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:58:43,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:58:43,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:58:43,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:58:43,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:58:43,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:58:43,372 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-min-array-hom.wvr.c[2586,2599] [2022-12-13 04:58:43,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:58:43,390 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:58:43,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43 WrapperNode [2022-12-13 04:58:43,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:58:43,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:58:43,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:58:43,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:58:43,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,438 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-13 04:58:43,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:58:43,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:58:43,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:58:43,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:58:43,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,473 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:58:43,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:58:43,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:58:43,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:58:43,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (1/1) ... [2022-12-13 04:58:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:58:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:58:43,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 04:58:43,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 04:58:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:58:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:58:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:58:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:58:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:58:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:58:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:58:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:58:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:58:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:58:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:58:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:58:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:58:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:58:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:58:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:58:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:58:43,531 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:58:43,617 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:58:43,618 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:58:43,829 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:58:43,873 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:58:43,873 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 04:58:43,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:58:43 BoogieIcfgContainer [2022-12-13 04:58:43,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:58:43,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:58:43,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:58:43,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:58:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:58:43" (1/3) ... [2022-12-13 04:58:43,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110d1f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:58:43, skipping insertion in model container [2022-12-13 04:58:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:58:43" (2/3) ... [2022-12-13 04:58:43,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110d1f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:58:43, skipping insertion in model container [2022-12-13 04:58:43,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:58:43" (3/3) ... [2022-12-13 04:58:43,880 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-12-13 04:58:43,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:58:43,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:58:43,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:58:43,932 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 04:58:43,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 308 flow [2022-12-13 04:58:44,012 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-12-13 04:58:44,012 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:58:44,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 12/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-13 04:58:44,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 142 transitions, 308 flow [2022-12-13 04:58:44,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 276 flow [2022-12-13 04:58:44,020 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:44,035 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-13 04:58:44,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 276 flow [2022-12-13 04:58:44,075 INFO L130 PetriNetUnfolder]: 12/129 cut-off events. [2022-12-13 04:58:44,075 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:58:44,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 12/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-13 04:58:44,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-13 04:58:44,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 04:58:47,991 INFO L241 LiptonReduction]: Total number of compositions: 105 [2022-12-13 04:58:48,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:58:48,014 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;@7e179c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:58:48,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 04:58:48,027 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-13 04:58:48,028 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:58:48,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:48,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:58:48,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1106873309, now seen corresponding path program 1 times [2022-12-13 04:58:48,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:48,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801505822] [2022-12-13 04:58:48,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:48,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:48,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801505822] [2022-12-13 04:58:48,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801505822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:48,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:48,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:58:48,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572627891] [2022-12-13 04:58:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:48,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:58:48,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:58:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:58:48,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 04:58:48,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:48,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:48,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 04:58:48,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:48,651 INFO L130 PetriNetUnfolder]: 269/376 cut-off events. [2022-12-13 04:58:48,651 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 04:58:48,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 376 events. 269/376 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 133 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 615. Up to 373 conditions per place. [2022-12-13 04:58:48,655 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 04:58:48,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-13 04:58:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:58:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:58:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 04:58:48,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 04:58:48,665 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-13 04:58:48,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 114 flow [2022-12-13 04:58:48,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 114 flow [2022-12-13 04:58:48,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:48,670 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 114 flow [2022-12-13 04:58:48,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:48,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:48,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 114 flow [2022-12-13 04:58:48,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 114 flow [2022-12-13 04:58:48,675 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 04:58:49,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:58:49,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1028 [2022-12-13 04:58:49,698 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 110 flow [2022-12-13 04:58:49,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:49,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:49,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:58:49,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:58:49,698 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:49,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1795349165, now seen corresponding path program 1 times [2022-12-13 04:58:49,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:49,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523951412] [2022-12-13 04:58:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:49,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523951412] [2022-12-13 04:58:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523951412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:49,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:49,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:58:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799157949] [2022-12-13 04:58:49,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:49,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:58:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:58:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:58:49,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 04:58:49,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:49,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:49,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 04:58:49,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:49,839 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_1 v_~M~0_In_3))) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_1, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][17], [143#true, 6#thread2EXITtrue, 7#L94-4true, thread3Thread1of1ForFork0InUse, 86#L70-4true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 89#L46-4true, 150#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-12-13 04:58:49,839 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-13 04:58:49,839 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-13 04:58:49,839 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-13 04:58:49,839 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-13 04:58:49,840 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0][18], [51#L58-4true, 143#true, 7#L94-4true, thread3Thread1of1ForFork0InUse, 86#L70-4true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 89#L46-4true, 150#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-12-13 04:58:49,840 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-13 04:58:49,840 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-13 04:58:49,841 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-13 04:58:49,841 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-13 04:58:49,865 INFO L130 PetriNetUnfolder]: 318/450 cut-off events. [2022-12-13 04:58:49,865 INFO L131 PetriNetUnfolder]: For 91/94 co-relation queries the response was YES. [2022-12-13 04:58:49,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 450 events. 318/450 cut-off events. For 91/94 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1423 event pairs, 134 based on Foata normal form. 3/316 useless extension candidates. Maximal degree in co-relation 1104. Up to 427 conditions per place. [2022-12-13 04:58:49,868 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-13 04:58:49,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 220 flow [2022-12-13 04:58:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:58:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:58:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 04:58:49,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-13 04:58:49,870 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2022-12-13 04:58:49,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 34 transitions, 220 flow [2022-12-13 04:58:49,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 220 flow [2022-12-13 04:58:49,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:49,874 INFO L89 Accepts]: Start accepts. Operand has 34 places, 34 transitions, 220 flow [2022-12-13 04:58:49,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:49,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:49,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 34 transitions, 220 flow [2022-12-13 04:58:49,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 34 transitions, 220 flow [2022-12-13 04:58:49,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 04:58:49,876 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:49,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 04:58:49,877 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 220 flow [2022-12-13 04:58:49,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:49,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:49,878 INFO L214 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-13 04:58:49,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:58:49,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1673659908, now seen corresponding path program 1 times [2022-12-13 04:58:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:49,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94020159] [2022-12-13 04:58:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:49,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94020159] [2022-12-13 04:58:49,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94020159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:58:49,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072686665] [2022-12-13 04:58:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:49,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:58:49,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:58:49,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:58:50,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 04:58:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:50,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 04:58:50,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:58:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:50,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:58:50,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072686665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:50,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:58:50,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-13 04:58:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992502677] [2022-12-13 04:58:50,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:50,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:58:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:50,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:58:50,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:58:50,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 04:58:50,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:50,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:50,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 04:58:50,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:50,342 INFO L130 PetriNetUnfolder]: 492/718 cut-off events. [2022-12-13 04:58:50,343 INFO L131 PetriNetUnfolder]: For 439/450 co-relation queries the response was YES. [2022-12-13 04:58:50,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 718 events. 492/718 cut-off events. For 439/450 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2475 event pairs, 118 based on Foata normal form. 11/543 useless extension candidates. Maximal degree in co-relation 2254. Up to 655 conditions per place. [2022-12-13 04:58:50,349 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 75 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2022-12-13 04:58:50,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 720 flow [2022-12-13 04:58:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:58:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:58:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-13 04:58:50,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 04:58:50,352 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-13 04:58:50,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 85 transitions, 720 flow [2022-12-13 04:58:50,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 85 transitions, 720 flow [2022-12-13 04:58:50,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:50,359 INFO L89 Accepts]: Start accepts. Operand has 39 places, 85 transitions, 720 flow [2022-12-13 04:58:50,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:50,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:50,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 85 transitions, 720 flow [2022-12-13 04:58:50,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 85 transitions, 720 flow [2022-12-13 04:58:50,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-13 04:58:50,366 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:50,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 04:58:50,367 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 85 transitions, 720 flow [2022-12-13 04:58:50,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:50,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:50,367 INFO L214 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-13 04:58:50,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 04:58:50,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:58:50,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1012218100, now seen corresponding path program 2 times [2022-12-13 04:58:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:50,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575888613] [2022-12-13 04:58:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:50,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:50,665 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-13 04:58:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575888613] [2022-12-13 04:58:50,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575888613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:50,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:50,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:58:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643257650] [2022-12-13 04:58:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:50,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:58:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:58:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:58:50,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 04:58:50,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 85 transitions, 720 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:50,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:50,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 04:58:50,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:50,866 INFO L130 PetriNetUnfolder]: 755/1102 cut-off events. [2022-12-13 04:58:50,866 INFO L131 PetriNetUnfolder]: For 608/622 co-relation queries the response was YES. [2022-12-13 04:58:50,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 1102 events. 755/1102 cut-off events. For 608/622 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4159 event pairs, 108 based on Foata normal form. 14/811 useless extension candidates. Maximal degree in co-relation 4240. Up to 1010 conditions per place. [2022-12-13 04:58:50,874 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 156 selfloop transitions, 21 changer transitions 0/178 dead transitions. [2022-12-13 04:58:50,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 178 transitions, 1849 flow [2022-12-13 04:58:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:58:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:58:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-13 04:58:50,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 04:58:50,876 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2022-12-13 04:58:50,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 178 transitions, 1849 flow [2022-12-13 04:58:50,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 178 transitions, 1849 flow [2022-12-13 04:58:50,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:50,890 INFO L89 Accepts]: Start accepts. Operand has 44 places, 178 transitions, 1849 flow [2022-12-13 04:58:50,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:50,892 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:50,892 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 178 transitions, 1849 flow [2022-12-13 04:58:50,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 178 transitions, 1849 flow [2022-12-13 04:58:50,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 04:58:50,896 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:50,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 04:58:50,898 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 178 transitions, 1849 flow [2022-12-13 04:58:50,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:50,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:50,898 INFO L214 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-13 04:58:50,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:58:50,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash -597698222, now seen corresponding path program 3 times [2022-12-13 04:58:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:50,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183159475] [2022-12-13 04:58:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:50,987 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-13 04:58:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:50,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183159475] [2022-12-13 04:58:50,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183159475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:50,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:50,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:58:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499744027] [2022-12-13 04:58:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:50,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:58:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:58:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:58:50,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 04:58:50,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 178 transitions, 1849 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:50,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:50,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 04:58:50,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:51,167 INFO L130 PetriNetUnfolder]: 834/1227 cut-off events. [2022-12-13 04:58:51,168 INFO L131 PetriNetUnfolder]: For 800/810 co-relation queries the response was YES. [2022-12-13 04:58:51,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7106 conditions, 1227 events. 834/1227 cut-off events. For 800/810 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4798 event pairs, 92 based on Foata normal form. 10/896 useless extension candidates. Maximal degree in co-relation 5604. Up to 1123 conditions per place. [2022-12-13 04:58:51,176 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 197 selfloop transitions, 28 changer transitions 0/226 dead transitions. [2022-12-13 04:58:51,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 226 transitions, 2800 flow [2022-12-13 04:58:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:58:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:58:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-13 04:58:51,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2022-12-13 04:58:51,178 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-13 04:58:51,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 226 transitions, 2800 flow [2022-12-13 04:58:51,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 226 transitions, 2800 flow [2022-12-13 04:58:51,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:51,192 INFO L89 Accepts]: Start accepts. Operand has 49 places, 226 transitions, 2800 flow [2022-12-13 04:58:51,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:51,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:51,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 226 transitions, 2800 flow [2022-12-13 04:58:51,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 226 transitions, 2800 flow [2022-12-13 04:58:51,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 04:58:51,197 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:51,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 04:58:51,197 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 226 transitions, 2800 flow [2022-12-13 04:58:51,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:51,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:51,198 INFO L214 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-13 04:58:51,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:58:51,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1093158890, now seen corresponding path program 4 times [2022-12-13 04:58:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:51,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627857015] [2022-12-13 04:58:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:51,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:51,305 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-13 04:58:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627857015] [2022-12-13 04:58:51,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627857015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:51,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:51,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:58:51,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184749688] [2022-12-13 04:58:51,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:51,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:58:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:58:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:58:51,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 04:58:51,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 226 transitions, 2800 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:51,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:51,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 04:58:51,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:51,476 INFO L130 PetriNetUnfolder]: 848/1225 cut-off events. [2022-12-13 04:58:51,476 INFO L131 PetriNetUnfolder]: For 1768/1790 co-relation queries the response was YES. [2022-12-13 04:58:51,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8293 conditions, 1225 events. 848/1225 cut-off events. For 1768/1790 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4730 event pairs, 138 based on Foata normal form. 22/908 useless extension candidates. Maximal degree in co-relation 6617. Up to 1129 conditions per place. [2022-12-13 04:58:51,485 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 186 selfloop transitions, 26 changer transitions 0/213 dead transitions. [2022-12-13 04:58:51,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 213 transitions, 3059 flow [2022-12-13 04:58:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:58:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:58:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-13 04:58:51,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2022-12-13 04:58:51,486 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2022-12-13 04:58:51,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 213 transitions, 3059 flow [2022-12-13 04:58:51,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 213 transitions, 3059 flow [2022-12-13 04:58:51,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:51,498 INFO L89 Accepts]: Start accepts. Operand has 54 places, 213 transitions, 3059 flow [2022-12-13 04:58:51,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:51,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:51,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 213 transitions, 3059 flow [2022-12-13 04:58:51,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 213 transitions, 3059 flow [2022-12-13 04:58:51,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 04:58:51,503 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:51,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 04:58:51,503 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 213 transitions, 3059 flow [2022-12-13 04:58:51,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:51,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:51,504 INFO L214 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-13 04:58:51,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 04:58:51,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1140676248, now seen corresponding path program 5 times [2022-12-13 04:58:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940743971] [2022-12-13 04:58:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:51,592 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-13 04:58:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940743971] [2022-12-13 04:58:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940743971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:51,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:51,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:58:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490453452] [2022-12-13 04:58:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:51,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:58:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:58:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:58:51,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 04:58:51,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 213 transitions, 3059 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:51,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:51,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 04:58:51,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:51,792 INFO L130 PetriNetUnfolder]: 808/1187 cut-off events. [2022-12-13 04:58:51,792 INFO L131 PetriNetUnfolder]: For 1016/1026 co-relation queries the response was YES. [2022-12-13 04:58:51,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9147 conditions, 1187 events. 808/1187 cut-off events. For 1016/1026 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4605 event pairs, 92 based on Foata normal form. 10/880 useless extension candidates. Maximal degree in co-relation 7250. Up to 1085 conditions per place. [2022-12-13 04:58:51,799 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 182 selfloop transitions, 28 changer transitions 0/211 dead transitions. [2022-12-13 04:58:51,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 211 transitions, 3451 flow [2022-12-13 04:58:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:58:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:58:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-13 04:58:51,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2022-12-13 04:58:51,801 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2022-12-13 04:58:51,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 211 transitions, 3451 flow [2022-12-13 04:58:51,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 211 transitions, 3451 flow [2022-12-13 04:58:51,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:51,812 INFO L89 Accepts]: Start accepts. Operand has 59 places, 211 transitions, 3451 flow [2022-12-13 04:58:51,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:51,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:51,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 211 transitions, 3451 flow [2022-12-13 04:58:51,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 211 transitions, 3451 flow [2022-12-13 04:58:51,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 04:58:51,817 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:51,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 04:58:51,817 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 211 transitions, 3451 flow [2022-12-13 04:58:51,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:51,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:51,817 INFO L214 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-13 04:58:51,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:58:51,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash -718951684, now seen corresponding path program 6 times [2022-12-13 04:58:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:51,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073594058] [2022-12-13 04:58:51,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:51,881 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-13 04:58:51,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:51,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073594058] [2022-12-13 04:58:51,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073594058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:51,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:51,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:58:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714292995] [2022-12-13 04:58:51,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:51,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:58:51,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:51,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:58:51,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:58:51,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 04:58:51,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 211 transitions, 3451 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:51,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:51,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 04:58:51,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:52,079 INFO L130 PetriNetUnfolder]: 807/1171 cut-off events. [2022-12-13 04:58:52,079 INFO L131 PetriNetUnfolder]: For 1796/1812 co-relation queries the response was YES. [2022-12-13 04:58:52,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10158 conditions, 1171 events. 807/1171 cut-off events. For 1796/1812 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4446 event pairs, 112 based on Foata normal form. 16/878 useless extension candidates. Maximal degree in co-relation 8119. Up to 1071 conditions per place. [2022-12-13 04:58:52,085 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 171 selfloop transitions, 26 changer transitions 0/198 dead transitions. [2022-12-13 04:58:52,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 198 transitions, 3628 flow [2022-12-13 04:58:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:58:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:58:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 04:58:52,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2022-12-13 04:58:52,086 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-13 04:58:52,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 198 transitions, 3628 flow [2022-12-13 04:58:52,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 198 transitions, 3628 flow [2022-12-13 04:58:52,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:52,097 INFO L89 Accepts]: Start accepts. Operand has 64 places, 198 transitions, 3628 flow [2022-12-13 04:58:52,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:52,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:52,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 198 transitions, 3628 flow [2022-12-13 04:58:52,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 198 transitions, 3628 flow [2022-12-13 04:58:52,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 04:58:52,102 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:52,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 04:58:52,102 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 198 transitions, 3628 flow [2022-12-13 04:58:52,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:52,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:52,103 INFO L214 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-13 04:58:52,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 04:58:52,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:58:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1239218672, now seen corresponding path program 1 times [2022-12-13 04:58:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:52,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542977505] [2022-12-13 04:58:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:58:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542977505] [2022-12-13 04:58:52,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542977505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:58:52,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:58:52,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:58:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207436304] [2022-12-13 04:58:52,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:58:52,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:58:52,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:58:52,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:58:52,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 04:58:52,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 198 transitions, 3628 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:52,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:52,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 04:58:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:52,462 INFO L130 PetriNetUnfolder]: 1211/1811 cut-off events. [2022-12-13 04:58:52,463 INFO L131 PetriNetUnfolder]: For 2430/2450 co-relation queries the response was YES. [2022-12-13 04:58:52,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17378 conditions, 1811 events. 1211/1811 cut-off events. For 2430/2450 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7927 event pairs, 112 based on Foata normal form. 50/1445 useless extension candidates. Maximal degree in co-relation 8872. Up to 1630 conditions per place. [2022-12-13 04:58:52,475 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 319 selfloop transitions, 5 changer transitions 35/360 dead transitions. [2022-12-13 04:58:52,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 360 transitions, 7325 flow [2022-12-13 04:58:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:58:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:58:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-13 04:58:52,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 04:58:52,477 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2022-12-13 04:58:52,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 360 transitions, 7325 flow [2022-12-13 04:58:52,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 325 transitions, 6617 flow [2022-12-13 04:58:52,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:52,503 INFO L89 Accepts]: Start accepts. Operand has 68 places, 325 transitions, 6617 flow [2022-12-13 04:58:52,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:52,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:52,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 325 transitions, 6617 flow [2022-12-13 04:58:52,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 325 transitions, 6617 flow [2022-12-13 04:58:52,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 04:58:54,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:58:54,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2267 [2022-12-13 04:58:54,769 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 324 transitions, 6597 flow [2022-12-13 04:58:54,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:54,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:54,769 INFO L214 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-13 04:58:54,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:58:54,770 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-13 04:58:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash 104758682, now seen corresponding path program 1 times [2022-12-13 04:58:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:54,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068318233] [2022-12-13 04:58:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:55,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068318233] [2022-12-13 04:58:55,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068318233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:58:55,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089808476] [2022-12-13 04:58:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:55,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:58:55,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:58:55,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:58:55,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 04:58:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:55,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 04:58:55,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:58:55,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:58:55,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-12-13 04:58:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:56,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:58:56,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:58:56,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-12-13 04:58:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:56,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089808476] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:58:56,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:58:56,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 16 [2022-12-13 04:58:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704883650] [2022-12-13 04:58:56,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:58:56,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 04:58:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:58:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 04:58:56,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-12-13 04:58:56,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 04:58:56,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 324 transitions, 6597 flow. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:56,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:58:56,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 04:58:56,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:58:58,820 INFO L130 PetriNetUnfolder]: 2369/3689 cut-off events. [2022-12-13 04:58:58,821 INFO L131 PetriNetUnfolder]: For 6582/6670 co-relation queries the response was YES. [2022-12-13 04:58:58,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39296 conditions, 3689 events. 2369/3689 cut-off events. For 6582/6670 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19418 event pairs, 22 based on Foata normal form. 32/2905 useless extension candidates. Maximal degree in co-relation 18384. Up to 3346 conditions per place. [2022-12-13 04:58:58,845 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 703 selfloop transitions, 388 changer transitions 37/1133 dead transitions. [2022-12-13 04:58:58,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 1133 transitions, 25325 flow [2022-12-13 04:58:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 04:58:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 04:58:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 247 transitions. [2022-12-13 04:58:58,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3952 [2022-12-13 04:58:58,847 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2022-12-13 04:58:58,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 1133 transitions, 25325 flow [2022-12-13 04:58:58,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 1096 transitions, 24481 flow [2022-12-13 04:58:58,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:58:58,898 INFO L89 Accepts]: Start accepts. Operand has 90 places, 1096 transitions, 24481 flow [2022-12-13 04:58:58,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:58:58,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:58:58,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 1096 transitions, 24481 flow [2022-12-13 04:58:58,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 1096 transitions, 24481 flow [2022-12-13 04:58:58,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-13 04:58:58,927 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:58:58,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 04:58:58,928 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 1096 transitions, 24481 flow [2022-12-13 04:58:58,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:58:58,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:58:58,928 INFO L214 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-13 04:58:58,935 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-13 04:58:59,135 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,SelfDestructingSolverStorable9 [2022-12-13 04:58:59,135 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-13 04:58:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:58:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1659784692, now seen corresponding path program 2 times [2022-12-13 04:58:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:58:59,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909211293] [2022-12-13 04:58:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:58:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:58:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:58:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:58:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:58:59,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909211293] [2022-12-13 04:58:59,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909211293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:58:59,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553023269] [2022-12-13 04:58:59,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:58:59,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:58:59,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:58:59,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:58:59,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 04:59:00,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:59:00,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:59:00,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 04:59:00,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:00,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:59:00,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:00,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-13 04:59:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:00,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:00,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:00,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 75 [2022-12-13 04:59:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:00,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553023269] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:00,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:00,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 19 [2022-12-13 04:59:00,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845826799] [2022-12-13 04:59:00,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:00,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 04:59:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:00,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 04:59:00,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-12-13 04:59:00,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 04:59:00,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 1096 transitions, 24481 flow. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:00,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:00,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 04:59:00,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:59:02,179 INFO L130 PetriNetUnfolder]: 2868/4533 cut-off events. [2022-12-13 04:59:02,179 INFO L131 PetriNetUnfolder]: For 5858/5858 co-relation queries the response was YES. [2022-12-13 04:59:02,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52781 conditions, 4533 events. 2868/4533 cut-off events. For 5858/5858 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25188 event pairs, 42 based on Foata normal form. 2/3659 useless extension candidates. Maximal degree in co-relation 27434. Up to 4106 conditions per place. [2022-12-13 04:59:02,207 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 1300 selfloop transitions, 170 changer transitions 31/1501 dead transitions. [2022-12-13 04:59:02,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 1501 transitions, 36574 flow [2022-12-13 04:59:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 04:59:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 04:59:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 130 transitions. [2022-12-13 04:59:02,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 04:59:02,209 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2022-12-13 04:59:02,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 1501 transitions, 36574 flow [2022-12-13 04:59:02,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 1470 transitions, 35800 flow [2022-12-13 04:59:02,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:59:02,301 INFO L89 Accepts]: Start accepts. Operand has 102 places, 1470 transitions, 35800 flow [2022-12-13 04:59:02,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:59:02,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:59:02,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 1470 transitions, 35800 flow [2022-12-13 04:59:02,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 1470 transitions, 35800 flow [2022-12-13 04:59:02,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:59:05,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:59:05,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2803 [2022-12-13 04:59:05,103 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 1469 transitions, 35776 flow [2022-12-13 04:59:05,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:05,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:59:05,103 INFO L214 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-13 04:59:05,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 04:59:05,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:05,308 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-13 04:59:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:59:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -489914340, now seen corresponding path program 3 times [2022-12-13 04:59:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:59:05,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666866419] [2022-12-13 04:59:05,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:59:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:59:05,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666866419] [2022-12-13 04:59:05,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666866419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:59:05,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341161263] [2022-12-13 04:59:05,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 04:59:05,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:05,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:59:05,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:59:05,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 04:59:05,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 04:59:05,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:59:05,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 04:59:05,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:05,950 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 14 treesize of output 14 [2022-12-13 04:59:05,954 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-13 04:59:05,989 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-13 04:59:06,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:59:06,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 35 treesize of output 33 [2022-12-13 04:59:06,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:59:06,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:06,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-13 04:59:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:06,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:06,542 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~min2~0 c_~min1~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse1))) (or (not (< .cse0 c_~min3~0)) (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0)))) (or .cse2 (forall ((v_ArrVal_367 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse1))) (or (not (< .cse3 c_~min3~0)) (< .cse3 c_~min2~0))))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse2 (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_367 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse1) c_~min3~0))))) is different from false [2022-12-13 04:59:07,123 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse9 (<= c_~min2~0 c_~min3~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse10 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_366))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse3))) (or (< (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< .cse2 c_~min2~0) (not (< .cse2 c_~min3~0))))))) (forall ((v_ArrVal_366 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_366))) (or (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_367 (Array Int Int))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse3))) (or (not (< .cse5 c_~min3~0)) (<= c_~min2~0 .cse5) (= c_~min1~0 .cse5))))))) (forall ((v_ArrVal_366 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_366))) (let ((.cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_367 (Array Int Int))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse3))) (or (= .cse6 .cse7) (not (< .cse6 c_~min3~0)) (<= c_~min2~0 .cse6)))) (not (< .cse7 c_~min1~0)))))) (or (and (or .cse9 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse10)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_366))) (or (< (select (select .cse11 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse3) c_~min3~0))))) (forall ((v_ArrVal_366 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_366))) (let ((.cse14 (select (select .cse13 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_367 (Array Int Int))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse3))) (or (< .cse12 c_~min2~0) (not (< .cse12 c_~min3~0))))) (= c_~min2~0 .cse14) (not (< .cse14 c_~min1~0)))))) (or .cse9 (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_366))) (let ((.cse16 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (< (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse3) c_~min3~0) (= c_~min3~0 .cse16) (not (< .cse16 c_~min1~0))))))) (or (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_366))) (let ((.cse18 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (< (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_367) c_~A~0.base) .cse3) c_~min3~0) (= c_~min2~0 .cse18) (not (< .cse18 c_~min1~0)))))) .cse10))) is different from false [2022-12-13 04:59:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 04:59:07,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341161263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:07,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:07,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-12-13 04:59:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875256452] [2022-12-13 04:59:07,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:07,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 04:59:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 04:59:07,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=384, Unknown=4, NotChecked=82, Total=552 [2022-12-13 04:59:07,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 04:59:07,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 1469 transitions, 35776 flow. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:07,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:07,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 04:59:07,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:59:09,974 INFO L130 PetriNetUnfolder]: 4224/6705 cut-off events. [2022-12-13 04:59:09,974 INFO L131 PetriNetUnfolder]: For 9851/9851 co-relation queries the response was YES. [2022-12-13 04:59:09,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85073 conditions, 6705 events. 4224/6705 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 40796 event pairs, 26 based on Foata normal form. 8/5443 useless extension candidates. Maximal degree in co-relation 34117. Up to 6138 conditions per place. [2022-12-13 04:59:10,019 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 1944 selfloop transitions, 404 changer transitions 59/2407 dead transitions. [2022-12-13 04:59:10,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 2407 transitions, 63557 flow [2022-12-13 04:59:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 04:59:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 04:59:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 226 transitions. [2022-12-13 04:59:10,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4829059829059829 [2022-12-13 04:59:10,021 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2022-12-13 04:59:10,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 2407 transitions, 63557 flow [2022-12-13 04:59:10,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 2348 transitions, 61951 flow [2022-12-13 04:59:10,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:59:10,129 INFO L89 Accepts]: Start accepts. Operand has 118 places, 2348 transitions, 61951 flow [2022-12-13 04:59:10,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:59:10,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:59:10,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 2348 transitions, 61951 flow [2022-12-13 04:59:10,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 2348 transitions, 61951 flow [2022-12-13 04:59:10,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:59:10,208 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:59:10,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 04:59:10,209 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 2348 transitions, 61951 flow [2022-12-13 04:59:10,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:10,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:59:10,210 INFO L214 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-13 04:59:10,218 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-13 04:59:10,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:10,415 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-13 04:59:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:59:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash -405363456, now seen corresponding path program 4 times [2022-12-13 04:59:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:59:10,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561667246] [2022-12-13 04:59:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:59:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:10,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:59:10,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561667246] [2022-12-13 04:59:10,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561667246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:59:10,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656365422] [2022-12-13 04:59:10,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 04:59:10,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:10,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:59:10,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:59:10,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 04:59:10,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 04:59:10,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:59:10,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 04:59:10,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:11,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:11,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 46 [2022-12-13 04:59:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:11,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:11,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:11,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 75 [2022-12-13 04:59:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:11,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656365422] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:11,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:11,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 21 [2022-12-13 04:59:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770316026] [2022-12-13 04:59:11,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:11,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 04:59:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 04:59:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-12-13 04:59:11,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 04:59:11,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 2348 transitions, 61951 flow. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:11,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:11,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 04:59:11,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:59:16,680 INFO L130 PetriNetUnfolder]: 5187/8335 cut-off events. [2022-12-13 04:59:16,680 INFO L131 PetriNetUnfolder]: For 9831/9831 co-relation queries the response was YES. [2022-12-13 04:59:16,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114487 conditions, 8335 events. 5187/8335 cut-off events. For 9831/9831 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 53616 event pairs, 10 based on Foata normal form. 13/6824 useless extension candidates. Maximal degree in co-relation 47593. Up to 7690 conditions per place. [2022-12-13 04:59:16,736 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 2615 selfloop transitions, 507 changer transitions 140/3262 dead transitions. [2022-12-13 04:59:16,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 3262 transitions, 92561 flow [2022-12-13 04:59:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 04:59:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 04:59:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 314 transitions. [2022-12-13 04:59:16,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33547008547008544 [2022-12-13 04:59:16,739 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2022-12-13 04:59:16,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 3262 transitions, 92561 flow [2022-12-13 04:59:16,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 3122 transitions, 88494 flow [2022-12-13 04:59:16,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:59:16,875 INFO L89 Accepts]: Start accepts. Operand has 149 places, 3122 transitions, 88494 flow [2022-12-13 04:59:16,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:59:16,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:59:16,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 3122 transitions, 88494 flow [2022-12-13 04:59:16,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 3122 transitions, 88494 flow [2022-12-13 04:59:16,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:59:16,987 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:59:16,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 04:59:16,987 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 3122 transitions, 88494 flow [2022-12-13 04:59:16,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:16,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:59:16,988 INFO L214 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-13 04:59:16,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 04:59:17,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 04:59:17,192 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-13 04:59:17,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:59:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash -897140114, now seen corresponding path program 5 times [2022-12-13 04:59:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:59:17,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039814335] [2022-12-13 04:59:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:59:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:17,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:59:17,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039814335] [2022-12-13 04:59:17,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039814335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:59:17,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899574739] [2022-12-13 04:59:17,907 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 04:59:17,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:17,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:59:17,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:59:17,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 04:59:17,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:59:17,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:59:17,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 04:59:17,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:18,236 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-13 04:59:18,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 69 [2022-12-13 04:59:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:18,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:18,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:18,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 75 [2022-12-13 04:59:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:18,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899574739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:18,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:18,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 6] total 20 [2022-12-13 04:59:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390404758] [2022-12-13 04:59:18,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:18,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 04:59:18,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:18,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 04:59:18,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-13 04:59:18,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 04:59:18,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 3122 transitions, 88494 flow. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:18,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:18,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 04:59:18,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:59:25,290 INFO L130 PetriNetUnfolder]: 6909/11204 cut-off events. [2022-12-13 04:59:25,290 INFO L131 PetriNetUnfolder]: For 16076/16076 co-relation queries the response was YES. [2022-12-13 04:59:25,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165425 conditions, 11204 events. 6909/11204 cut-off events. For 16076/16076 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 77005 event pairs, 4 based on Foata normal form. 13/9246 useless extension candidates. Maximal degree in co-relation 67854. Up to 10395 conditions per place. [2022-12-13 04:59:25,369 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 3225 selfloop transitions, 1182 changer transitions 181/4588 dead transitions. [2022-12-13 04:59:25,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 4588 transitions, 139192 flow [2022-12-13 04:59:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 04:59:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 04:59:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 311 transitions. [2022-12-13 04:59:25,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35180995475113125 [2022-12-13 04:59:25,371 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2022-12-13 04:59:25,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 4588 transitions, 139192 flow [2022-12-13 04:59:25,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 4407 transitions, 133651 flow [2022-12-13 04:59:25,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:59:25,557 INFO L89 Accepts]: Start accepts. Operand has 176 places, 4407 transitions, 133651 flow [2022-12-13 04:59:25,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:59:25,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:59:25,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 4407 transitions, 133651 flow [2022-12-13 04:59:25,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 4407 transitions, 133651 flow [2022-12-13 04:59:25,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:59:25,702 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:59:25,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 04:59:25,702 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 4407 transitions, 133651 flow [2022-12-13 04:59:25,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:25,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:59:25,703 INFO L214 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-13 04:59:25,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 04:59:25,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:25,907 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-13 04:59:25,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:59:25,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1517112875, now seen corresponding path program 1 times [2022-12-13 04:59:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:59:25,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819577619] [2022-12-13 04:59:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:25,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:59:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:25,959 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-13 04:59:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:59:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819577619] [2022-12-13 04:59:25,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819577619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:59:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188340052] [2022-12-13 04:59:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:25,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:25,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:59:25,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:59:26,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 04:59:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:26,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 04:59:26,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:26,142 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-13 04:59:26,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:26,158 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-13 04:59:26,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188340052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:26,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:26,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 04:59:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943294563] [2022-12-13 04:59:26,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:59:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:59:26,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:59:26,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 04:59:26,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 4407 transitions, 133651 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-13 04:59:26,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:26,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 04:59:26,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:59:32,087 INFO L130 PetriNetUnfolder]: 5941/9505 cut-off events. [2022-12-13 04:59:32,087 INFO L131 PetriNetUnfolder]: For 19755/19755 co-relation queries the response was YES. [2022-12-13 04:59:32,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148476 conditions, 9505 events. 5941/9505 cut-off events. For 19755/19755 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 61687 event pairs, 18 based on Foata normal form. 0/8012 useless extension candidates. Maximal degree in co-relation 64729. Up to 8769 conditions per place. [2022-12-13 04:59:32,159 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 3522 selfloop transitions, 179 changer transitions 0/3877 dead transitions. [2022-12-13 04:59:32,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 3877 transitions, 124698 flow [2022-12-13 04:59:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:59:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:59:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-13 04:59:32,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5615384615384615 [2022-12-13 04:59:32,160 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2022-12-13 04:59:32,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 3877 transitions, 124698 flow [2022-12-13 04:59:32,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 3877 transitions, 124698 flow [2022-12-13 04:59:32,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:59:32,324 INFO L89 Accepts]: Start accepts. Operand has 180 places, 3877 transitions, 124698 flow [2022-12-13 04:59:32,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:59:32,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:59:32,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 3877 transitions, 124698 flow [2022-12-13 04:59:32,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 3877 transitions, 124698 flow [2022-12-13 04:59:32,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:59:32,451 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:59:32,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 04:59:32,452 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 3877 transitions, 124698 flow [2022-12-13 04:59:32,452 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-13 04:59:32,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:59:32,452 INFO L214 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-13 04:59:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 04:59:32,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:32,657 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-13 04:59:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:59:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1930927530, now seen corresponding path program 6 times [2022-12-13 04:59:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:59:32,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98529771] [2022-12-13 04:59:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:59:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:33,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:59:33,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98529771] [2022-12-13 04:59:33,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98529771] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:59:33,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219786695] [2022-12-13 04:59:33,197 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 04:59:33,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:33,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:59:33,199 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:59:33,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 04:59:33,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 04:59:33,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:59:33,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 04:59:33,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:33,301 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 14 treesize of output 14 [2022-12-13 04:59:33,304 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-13 04:59:33,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:59:33,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 35 treesize of output 33 [2022-12-13 04:59:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:59:33,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 35 treesize of output 33 [2022-12-13 04:59:33,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 04:59:33,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:33,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-13 04:59:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:33,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:34,093 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~min2~0 c_~min1~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_570 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_570) c_~A~0.base) .cse1))) (or (not (< .cse0 c_~min3~0)) (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0)))) (or .cse2 (forall ((v_ArrVal_570 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_570) c_~A~0.base) .cse1))) (or (not (< .cse3 c_~min3~0)) (< .cse3 c_~min2~0))))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse2 (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_570 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_570) c_~A~0.base) .cse1) c_~min3~0))))) is different from false [2022-12-13 04:59:34,453 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse3 (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_570) c_~A~0.base) .cse1))) (or (not (< .cse11 c_~min3~0)) (< .cse11 c_~min2~0))))) (.cse6 (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_570) c_~A~0.base) .cse1) c_~min3~0))) (.cse5 (< c_~min3~0 c_~min2~0)) (.cse4 (<= c_~min2~0 c_~min3~0)) (.cse7 (< .cse9 c_~min1~0))) (and (or (let ((.cse2 (= c_~min2~0 c_~min1~0))) (and (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_570) c_~A~0.base) .cse1))) (or (not (< .cse0 c_~min3~0)) (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0)))) (or .cse2 .cse3) (or (and (or .cse4 (= c_~min1~0 c_~min3~0)) (or .cse2 .cse5)) .cse6))) .cse7) (or (let ((.cse10 (= c_~min2~0 .cse9))) (and (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_569) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_570) c_~A~0.base) .cse1))) (or (not (< .cse8 c_~min3~0)) (= .cse9 .cse8) (<= c_~min2~0 .cse8)))) (or .cse3 .cse10) (or .cse6 (and (or .cse5 .cse10) (or .cse4 (= .cse9 c_~min3~0)))))) (not .cse7))))) is different from false [2022-12-13 04:59:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:34,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219786695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:34,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:34,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-13 04:59:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989364984] [2022-12-13 04:59:34,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:34,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 04:59:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 04:59:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=8, NotChecked=78, Total=506 [2022-12-13 04:59:34,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 04:59:34,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 3877 transitions, 124698 flow. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:34,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:34,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 04:59:34,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:59:41,098 INFO L130 PetriNetUnfolder]: 6513/10451 cut-off events. [2022-12-13 04:59:41,099 INFO L131 PetriNetUnfolder]: For 24668/24668 co-relation queries the response was YES. [2022-12-13 04:59:41,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173064 conditions, 10451 events. 6513/10451 cut-off events. For 24668/24668 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 69445 event pairs, 18 based on Foata normal form. 5/8824 useless extension candidates. Maximal degree in co-relation 79476. Up to 9629 conditions per place. [2022-12-13 04:59:41,173 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 3651 selfloop transitions, 489 changer transitions 72/4290 dead transitions. [2022-12-13 04:59:41,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 4290 transitions, 146602 flow [2022-12-13 04:59:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 04:59:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 04:59:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-12-13 04:59:41,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4653846153846154 [2022-12-13 04:59:41,175 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2022-12-13 04:59:41,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 4290 transitions, 146602 flow [2022-12-13 04:59:41,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 4218 transitions, 144079 flow [2022-12-13 04:59:41,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:59:41,352 INFO L89 Accepts]: Start accepts. Operand has 189 places, 4218 transitions, 144079 flow [2022-12-13 04:59:41,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:59:41,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:59:41,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 4218 transitions, 144079 flow [2022-12-13 04:59:41,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 4218 transitions, 144079 flow [2022-12-13 04:59:41,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:59:41,469 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:59:41,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 04:59:41,469 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 4218 transitions, 144079 flow [2022-12-13 04:59:41,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:41,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:59:41,469 INFO L214 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-13 04:59:41,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 04:59:41,673 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,SelfDestructingSolverStorable15 [2022-12-13 04:59:41,674 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-13 04:59:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:59:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 322368152, now seen corresponding path program 7 times [2022-12-13 04:59:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:59:41,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669391168] [2022-12-13 04:59:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:59:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:42,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-13 04:59:42,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:59:42,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669391168] [2022-12-13 04:59:42,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669391168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:59:42,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565446244] [2022-12-13 04:59:42,234 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 04:59:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:42,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:59:42,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:59:42,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 04:59:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:42,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 04:59:42,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:42,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:42,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-12-13 04:59:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:42,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:42,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:42,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 73 [2022-12-13 04:59:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:43,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565446244] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:43,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:43,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 18 [2022-12-13 04:59:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726476270] [2022-12-13 04:59:43,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:43,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 04:59:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 04:59:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-12-13 04:59:43,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 04:59:43,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 4218 transitions, 144079 flow. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:43,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:43,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 04:59:43,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:59:51,525 INFO L130 PetriNetUnfolder]: 6658/10672 cut-off events. [2022-12-13 04:59:51,525 INFO L131 PetriNetUnfolder]: For 30006/30006 co-relation queries the response was YES. [2022-12-13 04:59:51,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186558 conditions, 10672 events. 6658/10672 cut-off events. For 30006/30006 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 71195 event pairs, 18 based on Foata normal form. 1/9009 useless extension candidates. Maximal degree in co-relation 88972. Up to 9812 conditions per place. [2022-12-13 04:59:51,613 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 3349 selfloop transitions, 1006 changer transitions 22/4455 dead transitions. [2022-12-13 04:59:51,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 4455 transitions, 160887 flow [2022-12-13 04:59:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:59:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:59:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 154 transitions. [2022-12-13 04:59:51,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3701923076923077 [2022-12-13 04:59:51,616 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2022-12-13 04:59:51,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 4455 transitions, 160887 flow [2022-12-13 04:59:51,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 4433 transitions, 160080 flow [2022-12-13 04:59:51,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:59:51,820 INFO L89 Accepts]: Start accepts. Operand has 204 places, 4433 transitions, 160080 flow [2022-12-13 04:59:51,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:59:51,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:59:51,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 4433 transitions, 160080 flow [2022-12-13 04:59:51,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 4433 transitions, 160080 flow [2022-12-13 04:59:51,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:59:51,949 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:59:51,950 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 04:59:51,950 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 4433 transitions, 160080 flow [2022-12-13 04:59:51,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:51,950 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:59:51,950 INFO L214 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-13 04:59:51,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 04:59:52,152 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,SelfDestructingSolverStorable16 [2022-12-13 04:59:52,153 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-13 04:59:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:59:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash -820541460, now seen corresponding path program 8 times [2022-12-13 04:59:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:59:52,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206337893] [2022-12-13 04:59:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:59:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:59:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:59:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:52,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:59:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206337893] [2022-12-13 04:59:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206337893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:59:52,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926994410] [2022-12-13 04:59:52,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:59:52,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:59:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:59:52,495 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:59:52,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 04:59:52,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:59:52,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:59:52,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 04:59:52,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:59:53,061 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-13 04:59:53,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-12-13 04:59:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:53,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:59:53,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:59:53,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 73 [2022-12-13 04:59:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:59:53,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926994410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:59:53,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:59:53,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 04:59:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324002918] [2022-12-13 04:59:53,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:59:53,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 04:59:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:59:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 04:59:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-13 04:59:53,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-13 04:59:53,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 4433 transitions, 160080 flow. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:59:53,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:59:53,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-13 04:59:53,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:00,588 INFO L130 PetriNetUnfolder]: 6702/10756 cut-off events. [2022-12-13 05:00:00,589 INFO L131 PetriNetUnfolder]: For 34778/34778 co-relation queries the response was YES. [2022-12-13 05:00:00,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198052 conditions, 10756 events. 6702/10756 cut-off events. For 34778/34778 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 71856 event pairs, 18 based on Foata normal form. 1/9113 useless extension candidates. Maximal degree in co-relation 95052. Up to 9884 conditions per place. [2022-12-13 05:00:00,676 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 4113 selfloop transitions, 289 changer transitions 7/4487 dead transitions. [2022-12-13 05:00:00,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 4487 transitions, 170869 flow [2022-12-13 05:00:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:00:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:00:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-12-13 05:00:00,677 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3769230769230769 [2022-12-13 05:00:00,678 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2022-12-13 05:00:00,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 4487 transitions, 170869 flow [2022-12-13 05:00:00,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 4480 transitions, 170600 flow [2022-12-13 05:00:00,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:00,889 INFO L89 Accepts]: Start accepts. Operand has 213 places, 4480 transitions, 170600 flow [2022-12-13 05:00:00,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:00,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:00,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 4480 transitions, 170600 flow [2022-12-13 05:00:01,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 4480 transitions, 170600 flow [2022-12-13 05:00:01,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:01,037 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:01,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 05:00:01,038 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 4480 transitions, 170600 flow [2022-12-13 05:00:01,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:01,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:01,038 INFO L214 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-13 05:00:01,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 05:00:01,243 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,SelfDestructingSolverStorable17 [2022-12-13 05:00:01,243 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-13 05:00:01,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -95785446, now seen corresponding path program 2 times [2022-12-13 05:00:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:01,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858633783] [2022-12-13 05:00:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:01,310 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-13 05:00:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:01,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858633783] [2022-12-13 05:00:01,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858633783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:01,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928483041] [2022-12-13 05:00:01,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:00:01,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:01,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:01,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 05:00:01,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 05:00:01,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:01,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 05:00:01,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 05:00:01,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 05:00:01,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928483041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:00:01,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 05:00:01,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-12-13 05:00:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420125867] [2022-12-13 05:00:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:00:01,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:00:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:00:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:00:01,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 05:00:01,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 4480 transitions, 170600 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-13 05:00:01,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:01,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 05:00:01,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:10,050 INFO L130 PetriNetUnfolder]: 6085/9775 cut-off events. [2022-12-13 05:00:10,050 INFO L131 PetriNetUnfolder]: For 41076/41076 co-relation queries the response was YES. [2022-12-13 05:00:10,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188887 conditions, 9775 events. 6085/9775 cut-off events. For 41076/41076 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 64317 event pairs, 18 based on Foata normal form. 0/8401 useless extension candidates. Maximal degree in co-relation 99195. Up to 8977 conditions per place. [2022-12-13 05:00:10,135 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 3516 selfloop transitions, 481 changer transitions 0/4080 dead transitions. [2022-12-13 05:00:10,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 4080 transitions, 163522 flow [2022-12-13 05:00:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:00:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:00:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 05:00:10,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41346153846153844 [2022-12-13 05:00:10,137 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2022-12-13 05:00:10,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 4080 transitions, 163522 flow [2022-12-13 05:00:10,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 4080 transitions, 163522 flow [2022-12-13 05:00:10,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:10,335 INFO L89 Accepts]: Start accepts. Operand has 207 places, 4080 transitions, 163522 flow [2022-12-13 05:00:10,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:10,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:10,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 4080 transitions, 163522 flow [2022-12-13 05:00:10,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 4080 transitions, 163522 flow [2022-12-13 05:00:10,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:10,475 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:10,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 05:00:10,476 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 4080 transitions, 163522 flow [2022-12-13 05:00:10,476 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-13 05:00:10,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:10,476 INFO L214 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-13 05:00:10,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:10,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:10,676 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-13 05:00:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash -86881275, now seen corresponding path program 9 times [2022-12-13 05:00:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:10,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248447528] [2022-12-13 05:00:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:10,768 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-13 05:00:10,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:10,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248447528] [2022-12-13 05:00:10,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248447528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:00:10,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:00:10,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 05:00:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714337604] [2022-12-13 05:00:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:00:10,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:00:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:00:10,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:00:10,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 05:00:10,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 4080 transitions, 163522 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-13 05:00:10,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:10,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 05:00:10,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:17,563 INFO L130 PetriNetUnfolder]: 5478/9108 cut-off events. [2022-12-13 05:00:17,563 INFO L131 PetriNetUnfolder]: For 49438/49438 co-relation queries the response was YES. [2022-12-13 05:00:17,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184130 conditions, 9108 events. 5478/9108 cut-off events. For 49438/49438 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 62562 event pairs, 18 based on Foata normal form. 274/8270 useless extension candidates. Maximal degree in co-relation 92359. Up to 8340 conditions per place. [2022-12-13 05:00:17,700 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 2449 selfloop transitions, 226 changer transitions 1200/3947 dead transitions. [2022-12-13 05:00:17,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 3947 transitions, 165964 flow [2022-12-13 05:00:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 05:00:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 05:00:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-13 05:00:17,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-13 05:00:17,702 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2022-12-13 05:00:17,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 3947 transitions, 165964 flow [2022-12-13 05:00:17,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 2747 transitions, 114823 flow [2022-12-13 05:00:17,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:17,861 INFO L89 Accepts]: Start accepts. Operand has 206 places, 2747 transitions, 114823 flow [2022-12-13 05:00:17,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:17,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:17,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 2747 transitions, 114823 flow [2022-12-13 05:00:17,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 2747 transitions, 114823 flow [2022-12-13 05:00:17,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:17,954 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:17,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 05:00:17,956 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 2747 transitions, 114823 flow [2022-12-13 05:00:17,956 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-13 05:00:17,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:17,956 INFO L214 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-13 05:00:17,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 05:00:17,957 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-13 05:00:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 426926207, now seen corresponding path program 10 times [2022-12-13 05:00:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:17,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783567929] [2022-12-13 05:00:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:18,003 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-13 05:00:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:18,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783567929] [2022-12-13 05:00:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783567929] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:18,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72624856] [2022-12-13 05:00:18,004 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 05:00:18,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:18,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:18,005 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:18,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 05:00:18,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 05:00:18,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:18,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:18,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:18,145 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-13 05:00:18,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:18,191 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-13 05:00:18,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72624856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:18,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:18,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 16 [2022-12-13 05:00:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765776839] [2022-12-13 05:00:18,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:18,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 05:00:18,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 05:00:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-13 05:00:18,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 05:00:18,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 2747 transitions, 114823 flow. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:18,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:18,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 05:00:18,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:21,348 INFO L130 PetriNetUnfolder]: 2357/3847 cut-off events. [2022-12-13 05:00:21,348 INFO L131 PetriNetUnfolder]: For 27391/27391 co-relation queries the response was YES. [2022-12-13 05:00:21,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81404 conditions, 3847 events. 2357/3847 cut-off events. For 27391/27391 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21311 event pairs, 6 based on Foata normal form. 228/3499 useless extension candidates. Maximal degree in co-relation 54660. Up to 3513 conditions per place. [2022-12-13 05:00:21,379 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 947 selfloop transitions, 308 changer transitions 409/1664 dead transitions. [2022-12-13 05:00:21,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 1664 transitions, 72237 flow [2022-12-13 05:00:21,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 05:00:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 05:00:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 201 transitions. [2022-12-13 05:00:21,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30923076923076925 [2022-12-13 05:00:21,380 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2022-12-13 05:00:21,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 1664 transitions, 72237 flow [2022-12-13 05:00:21,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 1255 transitions, 54873 flow [2022-12-13 05:00:21,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:21,560 INFO L89 Accepts]: Start accepts. Operand has 150 places, 1255 transitions, 54873 flow [2022-12-13 05:00:21,570 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:21,570 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:21,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 1255 transitions, 54873 flow [2022-12-13 05:00:21,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 1255 transitions, 54873 flow [2022-12-13 05:00:21,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:21,593 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:21,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 05:00:21,594 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 1255 transitions, 54873 flow [2022-12-13 05:00:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:21,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:21,594 INFO L214 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-13 05:00:21,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:21,799 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,SelfDestructingSolverStorable20 [2022-12-13 05:00:21,799 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-13 05:00:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash -532552599, now seen corresponding path program 1 times [2022-12-13 05:00:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:21,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911342100] [2022-12-13 05:00:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:21,866 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-13 05:00:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:21,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911342100] [2022-12-13 05:00:21,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911342100] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:21,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685238633] [2022-12-13 05:00:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:21,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:21,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:21,868 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:21,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 05:00:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:21,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:21,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:22,009 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-13 05:00:22,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:22,056 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-13 05:00:22,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685238633] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:22,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:22,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 05:00:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820262968] [2022-12-13 05:00:22,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:22,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 05:00:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 05:00:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 05:00:22,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 05:00:22,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 1255 transitions, 54873 flow. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:22,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:22,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 05:00:22,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:23,936 INFO L130 PetriNetUnfolder]: 3307/5216 cut-off events. [2022-12-13 05:00:23,937 INFO L131 PetriNetUnfolder]: For 22003/22003 co-relation queries the response was YES. [2022-12-13 05:00:23,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116862 conditions, 5216 events. 3307/5216 cut-off events. For 22003/22003 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 29003 event pairs, 6 based on Foata normal form. 0/4049 useless extension candidates. Maximal degree in co-relation 99401. Up to 5071 conditions per place. [2022-12-13 05:00:23,985 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 1707 selfloop transitions, 395 changer transitions 0/2117 dead transitions. [2022-12-13 05:00:23,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 2117 transitions, 97128 flow [2022-12-13 05:00:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 05:00:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 05:00:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 171 transitions. [2022-12-13 05:00:23,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4275 [2022-12-13 05:00:23,986 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2022-12-13 05:00:23,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 2117 transitions, 97128 flow [2022-12-13 05:00:24,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 2117 transitions, 97128 flow [2022-12-13 05:00:24,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:24,102 INFO L89 Accepts]: Start accepts. Operand has 165 places, 2117 transitions, 97128 flow [2022-12-13 05:00:24,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:24,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:24,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 2117 transitions, 97128 flow [2022-12-13 05:00:24,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 2117 transitions, 97128 flow [2022-12-13 05:00:24,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:24,173 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:24,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 05:00:24,174 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 2117 transitions, 97128 flow [2022-12-13 05:00:24,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:24,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:24,174 INFO L214 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-13 05:00:24,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:24,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 05:00:24,377 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-13 05:00:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash 392400425, now seen corresponding path program 2 times [2022-12-13 05:00:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:24,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368359673] [2022-12-13 05:00:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:24,457 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-13 05:00:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:24,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368359673] [2022-12-13 05:00:24,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368359673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:24,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289956009] [2022-12-13 05:00:24,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:00:24,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:24,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:24,460 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:24,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 05:00:24,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:00:24,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:24,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:24,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:24,622 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-13 05:00:24,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:24,670 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-13 05:00:24,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289956009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:24,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:24,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 05:00:24,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023175190] [2022-12-13 05:00:24,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:24,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 05:00:24,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:24,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 05:00:24,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 05:00:24,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 05:00:24,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 2117 transitions, 97128 flow. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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-13 05:00:24,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:24,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 05:00:24,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:27,576 INFO L130 PetriNetUnfolder]: 3453/5486 cut-off events. [2022-12-13 05:00:27,576 INFO L131 PetriNetUnfolder]: For 24669/24669 co-relation queries the response was YES. [2022-12-13 05:00:27,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128341 conditions, 5486 events. 3453/5486 cut-off events. For 24669/24669 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 31110 event pairs, 6 based on Foata normal form. 0/4285 useless extension candidates. Maximal degree in co-relation 109255. Up to 5333 conditions per place. [2022-12-13 05:00:27,628 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 1911 selfloop transitions, 349 changer transitions 0/2275 dead transitions. [2022-12-13 05:00:27,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 2275 transitions, 108988 flow [2022-12-13 05:00:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 05:00:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 05:00:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-12-13 05:00:27,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-13 05:00:27,629 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2022-12-13 05:00:27,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 2275 transitions, 108988 flow [2022-12-13 05:00:27,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 2275 transitions, 108988 flow [2022-12-13 05:00:27,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:27,743 INFO L89 Accepts]: Start accepts. Operand has 176 places, 2275 transitions, 108988 flow [2022-12-13 05:00:27,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:27,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:27,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 2275 transitions, 108988 flow [2022-12-13 05:00:27,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 2275 transitions, 108988 flow [2022-12-13 05:00:27,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:27,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:27,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 05:00:27,817 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 2275 transitions, 108988 flow [2022-12-13 05:00:27,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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-13 05:00:27,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:27,817 INFO L214 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-13 05:00:27,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:28,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:28,022 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-13 05:00:28,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash 476785835, now seen corresponding path program 3 times [2022-12-13 05:00:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:28,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203541172] [2022-12-13 05:00:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:28,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:28,082 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-13 05:00:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:28,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203541172] [2022-12-13 05:00:28,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203541172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:28,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472252978] [2022-12-13 05:00:28,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:00:28,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:28,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:28,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 05:00:28,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 05:00:28,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:28,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:28,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:28,239 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-13 05:00:28,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:28,285 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-13 05:00:28,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472252978] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:28,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:28,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 05:00:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197857849] [2022-12-13 05:00:28,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:28,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:00:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:00:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:00:28,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 05:00:28,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 2275 transitions, 108988 flow. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 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-13 05:00:28,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:28,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 05:00:28,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:31,329 INFO L130 PetriNetUnfolder]: 3408/5391 cut-off events. [2022-12-13 05:00:31,329 INFO L131 PetriNetUnfolder]: For 26213/26213 co-relation queries the response was YES. [2022-12-13 05:00:31,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131313 conditions, 5391 events. 3408/5391 cut-off events. For 26213/26213 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 30259 event pairs, 6 based on Foata normal form. 0/4230 useless extension candidates. Maximal degree in co-relation 111851. Up to 5240 conditions per place. [2022-12-13 05:00:31,385 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 1891 selfloop transitions, 308 changer transitions 0/2214 dead transitions. [2022-12-13 05:00:31,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 2214 transitions, 110422 flow [2022-12-13 05:00:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:00:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:00:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-12-13 05:00:31,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 05:00:31,387 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2022-12-13 05:00:31,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 2214 transitions, 110422 flow [2022-12-13 05:00:31,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 2214 transitions, 110422 flow [2022-12-13 05:00:31,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:31,518 INFO L89 Accepts]: Start accepts. Operand has 182 places, 2214 transitions, 110422 flow [2022-12-13 05:00:31,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:31,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:31,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 2214 transitions, 110422 flow [2022-12-13 05:00:31,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 2214 transitions, 110422 flow [2022-12-13 05:00:31,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:31,597 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:31,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 05:00:31,598 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 2214 transitions, 110422 flow [2022-12-13 05:00:31,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 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-13 05:00:31,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:31,598 INFO L214 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-13 05:00:31,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:31,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:31,804 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-13 05:00:31,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1895956891, now seen corresponding path program 4 times [2022-12-13 05:00:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:31,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747944542] [2022-12-13 05:00:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:31,863 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-13 05:00:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:31,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747944542] [2022-12-13 05:00:31,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747944542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030566119] [2022-12-13 05:00:31,864 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 05:00:31,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:31,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:31,872 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:31,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 05:00:31,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 05:00:31,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:31,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:31,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:32,010 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-13 05:00:32,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:32,052 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-13 05:00:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030566119] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:32,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:32,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 15 [2022-12-13 05:00:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83426407] [2022-12-13 05:00:32,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:32,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:00:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:32,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:00:32,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:00:32,053 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:00:32,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 2214 transitions, 110422 flow. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:32,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:32,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:00:32,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:35,205 INFO L130 PetriNetUnfolder]: 3371/5304 cut-off events. [2022-12-13 05:00:35,206 INFO L131 PetriNetUnfolder]: For 24919/24919 co-relation queries the response was YES. [2022-12-13 05:00:35,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134457 conditions, 5304 events. 3371/5304 cut-off events. For 24919/24919 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 29476 event pairs, 6 based on Foata normal form. 0/4175 useless extension candidates. Maximal degree in co-relation 114779. Up to 5155 conditions per place. [2022-12-13 05:00:35,260 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 1816 selfloop transitions, 348 changer transitions 0/2164 dead transitions. [2022-12-13 05:00:35,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 2164 transitions, 112084 flow [2022-12-13 05:00:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 05:00:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 05:00:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2022-12-13 05:00:35,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3129411764705882 [2022-12-13 05:00:35,262 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 168 predicate places. [2022-12-13 05:00:35,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 2164 transitions, 112084 flow [2022-12-13 05:00:35,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 2164 transitions, 112084 flow [2022-12-13 05:00:35,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:35,396 INFO L89 Accepts]: Start accepts. Operand has 198 places, 2164 transitions, 112084 flow [2022-12-13 05:00:35,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:35,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:35,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 2164 transitions, 112084 flow [2022-12-13 05:00:35,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 2164 transitions, 112084 flow [2022-12-13 05:00:35,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:35,470 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:35,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 05:00:35,471 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 2164 transitions, 112084 flow [2022-12-13 05:00:35,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:35,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:35,472 INFO L214 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-13 05:00:35,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:35,672 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,SelfDestructingSolverStorable24 [2022-12-13 05:00:35,672 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-13 05:00:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash 753047279, now seen corresponding path program 5 times [2022-12-13 05:00:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:35,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223536402] [2022-12-13 05:00:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:35,733 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-13 05:00:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223536402] [2022-12-13 05:00:35,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223536402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079479218] [2022-12-13 05:00:35,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 05:00:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:35,736 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:35,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 05:00:35,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:00:35,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:35,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:35,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:35,906 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-13 05:00:35,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:35,950 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-13 05:00:35,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079479218] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:35,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:35,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 15 [2022-12-13 05:00:35,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761725528] [2022-12-13 05:00:35,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:35,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:00:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:00:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:00:35,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:00:35,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 2164 transitions, 112084 flow. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:35,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:35,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:00:35,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:38,946 INFO L130 PetriNetUnfolder]: 3334/5217 cut-off events. [2022-12-13 05:00:38,947 INFO L131 PetriNetUnfolder]: For 24471/24471 co-relation queries the response was YES. [2022-12-13 05:00:38,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137427 conditions, 5217 events. 3334/5217 cut-off events. For 24471/24471 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28596 event pairs, 6 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 117577. Up to 5070 conditions per place. [2022-12-13 05:00:39,003 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 1777 selfloop transitions, 340 changer transitions 0/2117 dead transitions. [2022-12-13 05:00:39,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 2117 transitions, 113630 flow [2022-12-13 05:00:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 05:00:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 05:00:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2022-12-13 05:00:39,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2823529411764706 [2022-12-13 05:00:39,004 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2022-12-13 05:00:39,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 2117 transitions, 113630 flow [2022-12-13 05:00:39,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 2117 transitions, 113630 flow [2022-12-13 05:00:39,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:39,128 INFO L89 Accepts]: Start accepts. Operand has 214 places, 2117 transitions, 113630 flow [2022-12-13 05:00:39,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:39,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:39,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 2117 transitions, 113630 flow [2022-12-13 05:00:39,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 2117 transitions, 113630 flow [2022-12-13 05:00:39,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:39,206 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:39,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 05:00:39,206 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 2117 transitions, 113630 flow [2022-12-13 05:00:39,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:00:39,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:39,206 INFO L214 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-13 05:00:39,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:39,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 05:00:39,416 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-13 05:00:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash -666123777, now seen corresponding path program 6 times [2022-12-13 05:00:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:39,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185643668] [2022-12-13 05:00:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:39,473 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-13 05:00:39,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:39,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185643668] [2022-12-13 05:00:39,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185643668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:39,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453630857] [2022-12-13 05:00:39,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 05:00:39,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:39,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:39,480 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:39,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 05:00:39,589 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 05:00:39,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:39,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:39,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:39,643 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-13 05:00:39,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:39,697 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-13 05:00:39,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453630857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:39,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:39,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 05:00:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753867408] [2022-12-13 05:00:39,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:39,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:00:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:00:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:00:39,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 05:00:39,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 2117 transitions, 113630 flow. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 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-13 05:00:39,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:39,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 05:00:39,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:42,759 INFO L130 PetriNetUnfolder]: 3721/5820 cut-off events. [2022-12-13 05:00:42,759 INFO L131 PetriNetUnfolder]: For 29835/29835 co-relation queries the response was YES. [2022-12-13 05:00:42,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159164 conditions, 5820 events. 3721/5820 cut-off events. For 29835/29835 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 32571 event pairs, 6 based on Foata normal form. 0/4559 useless extension candidates. Maximal degree in co-relation 137457. Up to 5655 conditions per place. [2022-12-13 05:00:42,823 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 2064 selfloop transitions, 277 changer transitions 0/2369 dead transitions. [2022-12-13 05:00:42,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 2369 transitions, 132007 flow [2022-12-13 05:00:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 05:00:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 05:00:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-13 05:00:42,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 05:00:42,825 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2022-12-13 05:00:42,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 2369 transitions, 132007 flow [2022-12-13 05:00:42,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 2369 transitions, 132007 flow [2022-12-13 05:00:42,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:42,968 INFO L89 Accepts]: Start accepts. Operand has 222 places, 2369 transitions, 132007 flow [2022-12-13 05:00:42,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:42,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:42,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 2369 transitions, 132007 flow [2022-12-13 05:00:43,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 2369 transitions, 132007 flow [2022-12-13 05:00:43,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:43,055 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:43,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 05:00:43,055 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 2369 transitions, 132007 flow [2022-12-13 05:00:43,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 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-13 05:00:43,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:43,056 INFO L214 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-13 05:00:43,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:43,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 05:00:43,256 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-13 05:00:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1438945535, now seen corresponding path program 7 times [2022-12-13 05:00:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:43,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303846382] [2022-12-13 05:00:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:43,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:43,475 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-13 05:00:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:43,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303846382] [2022-12-13 05:00:43,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303846382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:43,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428032058] [2022-12-13 05:00:43,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 05:00:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:43,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:43,477 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:43,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 05:00:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:43,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:43,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:43,620 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-13 05:00:43,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:43,669 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-13 05:00:43,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428032058] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:43,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:43,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 05:00:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358253201] [2022-12-13 05:00:43,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:43,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:00:43,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:00:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:00:43,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 05:00:43,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 2369 transitions, 132007 flow. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 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-13 05:00:43,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:43,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 05:00:43,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:46,994 INFO L130 PetriNetUnfolder]: 3766/5899 cut-off events. [2022-12-13 05:00:46,995 INFO L131 PetriNetUnfolder]: For 34405/34405 co-relation queries the response was YES. [2022-12-13 05:00:46,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167084 conditions, 5899 events. 3766/5899 cut-off events. For 34405/34405 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 33233 event pairs, 6 based on Foata normal form. 0/4632 useless extension candidates. Maximal degree in co-relation 144613. Up to 5732 conditions per place. [2022-12-13 05:00:47,055 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 1961 selfloop transitions, 425 changer transitions 0/2414 dead transitions. [2022-12-13 05:00:47,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 2414 transitions, 139311 flow [2022-12-13 05:00:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 05:00:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 05:00:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 145 transitions. [2022-12-13 05:00:47,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2022-12-13 05:00:47,057 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2022-12-13 05:00:47,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 2414 transitions, 139311 flow [2022-12-13 05:00:47,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 2414 transitions, 139311 flow [2022-12-13 05:00:47,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:47,196 INFO L89 Accepts]: Start accepts. Operand has 234 places, 2414 transitions, 139311 flow [2022-12-13 05:00:47,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:47,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:47,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 2414 transitions, 139311 flow [2022-12-13 05:00:47,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 2414 transitions, 139311 flow [2022-12-13 05:00:47,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:47,289 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:47,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 05:00:47,289 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 2414 transitions, 139311 flow [2022-12-13 05:00:47,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 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-13 05:00:47,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:47,290 INFO L214 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-13 05:00:47,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 05:00:47,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:47,494 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-13 05:00:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1156112081, now seen corresponding path program 8 times [2022-12-13 05:00:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:47,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962313369] [2022-12-13 05:00:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:47,546 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-13 05:00:47,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:47,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962313369] [2022-12-13 05:00:47,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962313369] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:47,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801713015] [2022-12-13 05:00:47,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:00:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:47,548 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 05:00:47,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:00:47,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:00:47,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 05:00:47,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:47,680 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-13 05:00:47,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:00:47,711 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-13 05:00:47,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801713015] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:00:47,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:00:47,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 05:00:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330659572] [2022-12-13 05:00:47,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:00:47,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 05:00:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:00:47,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 05:00:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-13 05:00:47,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 05:00:47,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 2414 transitions, 139311 flow. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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-13 05:00:47,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:00:47,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 05:00:47,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:00:51,740 INFO L130 PetriNetUnfolder]: 3721/5804 cut-off events. [2022-12-13 05:00:51,740 INFO L131 PetriNetUnfolder]: For 36377/36377 co-relation queries the response was YES. [2022-12-13 05:00:51,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169986 conditions, 5804 events. 3721/5804 cut-off events. For 36377/36377 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 32413 event pairs, 6 based on Foata normal form. 0/4577 useless extension candidates. Maximal degree in co-relation 147239. Up to 5639 conditions per place. [2022-12-13 05:00:51,807 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 1976 selfloop transitions, 349 changer transitions 0/2353 dead transitions. [2022-12-13 05:00:51,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 2353 transitions, 140387 flow [2022-12-13 05:00:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:00:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:00:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 05:00:51,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41714285714285715 [2022-12-13 05:00:51,808 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2022-12-13 05:00:51,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 2353 transitions, 140387 flow [2022-12-13 05:00:51,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 2353 transitions, 140387 flow [2022-12-13 05:00:51,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:00:51,964 INFO L89 Accepts]: Start accepts. Operand has 239 places, 2353 transitions, 140387 flow [2022-12-13 05:00:51,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:00:52,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:00:52,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 2353 transitions, 140387 flow [2022-12-13 05:00:52,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 2353 transitions, 140387 flow [2022-12-13 05:00:52,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:00:52,058 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:00:52,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 05:00:52,059 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 2353 transitions, 140387 flow [2022-12-13 05:00:52,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 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-13 05:00:52,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:00:52,059 INFO L214 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-13 05:00:52,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 05:00:52,259 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,SelfDestructingSolverStorable28 [2022-12-13 05:00:52,259 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-13 05:00:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:00:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1559522985, now seen corresponding path program 1 times [2022-12-13 05:00:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:00:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736044586] [2022-12-13 05:00:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:00:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:53,255 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-13 05:00:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:00:53,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736044586] [2022-12-13 05:00:53,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736044586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:00:53,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850535987] [2022-12-13 05:00:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:00:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:00:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:00:53,257 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:00:53,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 05:00:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:00:53,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 05:00:53,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:00:53,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:00:53,373 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 19 treesize of output 23 [2022-12-13 05:00:53,375 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-13 05:00:53,409 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-13 05:00:53,439 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-13 05:00:54,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:00:54,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:00:54,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 81 [2022-12-13 05:00:54,242 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-13 05:00:54,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:01:00,049 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-13 05:01:00,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850535987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:01:00,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:01:00,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 30 [2022-12-13 05:01:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196332154] [2022-12-13 05:01:00,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:01:00,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 05:01:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:01:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 05:01:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=859, Unknown=12, NotChecked=0, Total=992 [2022-12-13 05:01:00,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:01:00,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 2353 transitions, 140387 flow. Second operand has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:01:00,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:01:00,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:01:00,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:01:20,161 INFO L130 PetriNetUnfolder]: 5536/8718 cut-off events. [2022-12-13 05:01:20,161 INFO L131 PetriNetUnfolder]: For 46522/46522 co-relation queries the response was YES. [2022-12-13 05:01:20,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265354 conditions, 8718 events. 5536/8718 cut-off events. For 46522/46522 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 53514 event pairs, 4 based on Foata normal form. 8/6999 useless extension candidates. Maximal degree in co-relation 188089. Up to 8553 conditions per place. [2022-12-13 05:01:20,267 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 3114 selfloop transitions, 642 changer transitions 58/3814 dead transitions. [2022-12-13 05:01:20,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 3814 transitions, 235993 flow [2022-12-13 05:01:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 05:01:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 05:01:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 247 transitions. [2022-12-13 05:01:20,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4295652173913043 [2022-12-13 05:01:20,269 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2022-12-13 05:01:20,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 3814 transitions, 235993 flow [2022-12-13 05:01:20,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 3756 transitions, 232325 flow [2022-12-13 05:01:20,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:01:20,521 INFO L89 Accepts]: Start accepts. Operand has 261 places, 3756 transitions, 232325 flow [2022-12-13 05:01:20,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:01:20,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:01:20,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 3756 transitions, 232325 flow [2022-12-13 05:01:20,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 3756 transitions, 232325 flow [2022-12-13 05:01:20,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:01:20,700 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:01:20,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-13 05:01:20,701 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 3756 transitions, 232325 flow [2022-12-13 05:01:20,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:01:20,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:01:20,701 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:01:20,706 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-13 05:01:20,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:01:20,902 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-13 05:01:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:01:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1456226980, now seen corresponding path program 9 times [2022-12-13 05:01:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:01:20,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301659650] [2022-12-13 05:01:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:01:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:01:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:01:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:01:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:01:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301659650] [2022-12-13 05:01:21,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301659650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:01:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901658141] [2022-12-13 05:01:21,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:01:21,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:01:21,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:01:21,979 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:01:21,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 05:01:22,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 05:01:22,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:01:22,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 05:01:22,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:01:22,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:01:22,120 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 19 treesize of output 23 [2022-12-13 05:01:22,127 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-13 05:01:22,170 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-13 05:01:22,210 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-13 05:01:22,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:01:22,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:01:22,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 108 [2022-12-13 05:01:23,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-13 05:01:23,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:01:42,340 WARN L233 SmtUtils]: Spent 10.65s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:01:49,716 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:02:08,309 WARN L233 SmtUtils]: Spent 17.49s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:02:10,687 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse16 (< c_~min3~0 c_~min2~0)) (.cse34 (<= c_~min2~0 c_~min3~0)) (.cse3 (+ c_~A~0.offset 4))) (and (or .cse0 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base)) (.cse4 (* ~M~0 4))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset .cse4 4)))) (or (< 0 ~M~0) (< .cse1 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse2 .cse3) c_~min1~0) (< (select .cse2 c_~A~0.offset) c_~min1~0) (not (< .cse1 c_~min3~0)) (< (select .cse2 (+ c_~A~0.offset .cse4)) c_~min3~0)))))) (or .cse0 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base)) (.cse8 (* ~M~0 4))) (let ((.cse5 (select .cse7 (+ c_~A~0.offset .cse8 4))) (.cse6 (select .cse7 (+ c_~A~0.offset .cse8)))) (or (not (< .cse5 .cse6)) (< 0 ~M~0) (< .cse5 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse7 .cse3) c_~min1~0) (< (select .cse7 c_~A~0.offset) c_~min1~0) (not (< .cse6 c_~min3~0))))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (or (< (select .cse9 .cse3) c_~min1~0) (< (select .cse9 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse10 (* ~M~0 4))) (let ((.cse11 (select .cse9 (+ c_~A~0.offset .cse10)))) (or (< 0 ~M~0) (< (select .cse9 (+ c_~A~0.offset .cse10 4)) .cse11) (< (+ 2 ~M~0) c_~N~0) (<= c_~min2~0 .cse11) (= c_~min1~0 .cse11) (not (< .cse11 c_~min3~0))))))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse15 (select .cse12 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse13 (* ~M~0 4))) (let ((.cse14 (select .cse12 (+ c_~A~0.offset .cse13)))) (or (< 0 ~M~0) (< (select .cse12 (+ c_~A~0.offset .cse13 4)) .cse14) (< (+ 2 ~M~0) c_~N~0) (= .cse14 .cse15) (<= c_~min2~0 .cse14) (not (< .cse14 c_~min3~0)))))) (< (select .cse12 c_~A~0.offset) c_~min1~0) (not (< .cse15 c_~min1~0)))))) (or .cse16 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse19 (select .cse17 .cse3)) (.cse18 (* ~M~0 4))) (or (< (select .cse17 (+ c_~A~0.offset .cse18 4)) c_~min3~0) (= c_~min2~0 .cse19) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse17 c_~A~0.offset) c_~min1~0) (not (< .cse19 c_~min1~0)) (< (select .cse17 (+ c_~A~0.offset .cse18)) c_~min3~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse24 (* ~M~0 4))) (let ((.cse21 (select .cse23 (+ c_~A~0.offset .cse24))) (.cse20 (select .cse23 (+ c_~A~0.offset .cse24 4)))) (or (not (< .cse20 .cse21)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse21 c_~min3~0)) (= .cse20 .cse22) (<= c_~min2~0 .cse20))))) (< (select .cse23 c_~A~0.offset) c_~min1~0) (not (< .cse22 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse28 (select .cse25 .cse3)) (.cse29 (select .cse25 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse26 (* ~M~0 4))) (let ((.cse27 (select .cse25 (+ c_~A~0.offset .cse26)))) (or (< 0 ~M~0) (< (select .cse25 (+ c_~A~0.offset .cse26 4)) .cse27) (< (+ 2 ~M~0) c_~N~0) (= .cse27 .cse28) (<= c_~min2~0 .cse27) (not (< .cse27 c_~min3~0)))))) (not (< .cse29 c_~min1~0)) (not (< .cse28 .cse29)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse31 (select .cse30 c_~A~0.offset))) (or (< (select .cse30 .cse3) .cse31) (forall ((~M~0 Int)) (let ((.cse33 (* ~M~0 4))) (let ((.cse32 (select .cse30 (+ c_~A~0.offset .cse33 4)))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse32 .cse31) (not (< .cse32 c_~min3~0)) (< (select .cse30 (+ c_~A~0.offset .cse33)) c_~min3~0) (<= c_~min2~0 .cse32))))) (not (< .cse31 c_~min1~0)))))) (or .cse34 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse3)) (.cse38 (select .cse36 c_~A~0.offset)) (.cse37 (* ~M~0 4))) (or (= c_~min3~0 .cse35) (< (select .cse36 (+ c_~A~0.offset .cse37 4)) c_~min3~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse38 c_~min1~0)) (not (< .cse35 .cse38)) (< (select .cse36 (+ c_~A~0.offset .cse37)) c_~min3~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse40 (select .cse41 .cse3)) (.cse43 (select .cse41 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse42 (* ~M~0 4))) (let ((.cse39 (select .cse41 (+ c_~A~0.offset .cse42 4)))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse39 .cse40) (not (< .cse39 c_~min3~0)) (< (select .cse41 (+ c_~A~0.offset .cse42)) c_~min3~0) (<= c_~min2~0 .cse39))))) (not (< .cse43 c_~min1~0)) (not (< .cse40 .cse43)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse44 (select .cse45 c_~A~0.offset))) (or (= c_~min2~0 .cse44) (< (select .cse45 .cse3) .cse44) (forall ((~M~0 Int)) (let ((.cse47 (* ~M~0 4))) (let ((.cse46 (select .cse45 (+ c_~A~0.offset .cse47 4)))) (or (< 0 ~M~0) (< .cse46 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse46 c_~min3~0)) (< (select .cse45 (+ c_~A~0.offset .cse47)) c_~min3~0))))) (not (< .cse44 c_~min1~0)))))) (or .cse0 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base)) (.cse50 (* ~M~0 4))) (let ((.cse48 (select .cse49 (+ c_~A~0.offset .cse50)))) (or (< .cse48 c_~min2~0) (< 0 ~M~0) (< (select .cse49 (+ c_~A~0.offset .cse50 4)) .cse48) (< (+ 2 ~M~0) c_~N~0) (< (select .cse49 .cse3) c_~min1~0) (< (select .cse49 c_~A~0.offset) c_~min1~0) (not (< .cse48 c_~min3~0))))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse51 (select .cse53 .cse3)) (.cse55 (select .cse53 c_~A~0.offset))) (or (= c_~min2~0 .cse51) (forall ((~M~0 Int)) (let ((.cse54 (* ~M~0 4))) (let ((.cse52 (select .cse53 (+ c_~A~0.offset .cse54)))) (or (< .cse52 c_~min2~0) (< 0 ~M~0) (< (select .cse53 (+ c_~A~0.offset .cse54 4)) .cse52) (< (+ 2 ~M~0) c_~N~0) (not (< .cse52 c_~min3~0)))))) (not (< .cse55 c_~min1~0)) (not (< .cse51 .cse55)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse60 (select .cse58 .cse3)) (.cse61 (select .cse58 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse59 (* ~M~0 4))) (let ((.cse56 (select .cse58 (+ c_~A~0.offset .cse59 4))) (.cse57 (select .cse58 (+ c_~A~0.offset .cse59)))) (or (not (< .cse56 .cse57)) (< 0 ~M~0) (< .cse56 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse57 c_~min3~0)))))) (= c_~min2~0 .cse60) (not (< .cse61 c_~min1~0)) (not (< .cse60 .cse61)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse64 (select .cse65 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse66 (* ~M~0 4))) (let ((.cse63 (select .cse65 (+ c_~A~0.offset .cse66))) (.cse62 (select .cse65 (+ c_~A~0.offset .cse66 4)))) (or (not (< .cse62 .cse63)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse63 c_~min3~0)) (= .cse62 .cse64) (<= c_~min2~0 .cse62))))) (< (select .cse65 .cse3) .cse64) (not (< .cse64 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse68 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse69 (* ~M~0 4))) (let ((.cse67 (select .cse68 (+ c_~A~0.offset .cse69 4)))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse67) (not (< .cse67 c_~min3~0)) (< (select .cse68 (+ c_~A~0.offset .cse69)) c_~min3~0) (<= c_~min2~0 .cse67))))) (< (select .cse68 .cse3) c_~min1~0) (< (select .cse68 c_~A~0.offset) c_~min1~0)))) (or .cse16 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse70 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse72 (select .cse70 .cse3)) (.cse73 (select .cse70 c_~A~0.offset)) (.cse71 (* ~M~0 4))) (or (< (select .cse70 (+ c_~A~0.offset .cse71 4)) c_~min3~0) (= c_~min2~0 .cse72) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse73 c_~min1~0)) (not (< .cse72 .cse73)) (< (select .cse70 (+ c_~A~0.offset .cse71)) c_~min3~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse74 (select .cse75 .cse3))) (or (= c_~min2~0 .cse74) (< (select .cse75 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse77 (* ~M~0 4))) (let ((.cse76 (select .cse75 (+ c_~A~0.offset .cse77)))) (or (< .cse76 c_~min2~0) (< 0 ~M~0) (< (select .cse75 (+ c_~A~0.offset .cse77 4)) .cse76) (< (+ 2 ~M~0) c_~N~0) (not (< .cse76 c_~min3~0)))))) (not (< .cse74 c_~min1~0)))))) (or .cse34 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse78 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse80 (select .cse78 c_~A~0.offset)) (.cse79 (* ~M~0 4))) (or (< (select .cse78 (+ c_~A~0.offset .cse79 4)) c_~min3~0) (< 0 ~M~0) (< (select .cse78 .cse3) .cse80) (= c_~min3~0 .cse80) (< (+ 2 ~M~0) c_~N~0) (not (< .cse80 c_~min1~0)) (< (select .cse78 (+ c_~A~0.offset .cse79)) c_~min3~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse85 (select .cse83 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse84 (* ~M~0 4))) (let ((.cse81 (select .cse83 (+ c_~A~0.offset .cse84 4))) (.cse82 (select .cse83 (+ c_~A~0.offset .cse84)))) (or (not (< .cse81 .cse82)) (< 0 ~M~0) (< .cse81 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse82 c_~min3~0)))))) (= c_~min2~0 .cse85) (< (select .cse83 c_~A~0.offset) c_~min1~0) (not (< .cse85 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse88 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse89 (* ~M~0 4))) (let ((.cse87 (select .cse88 (+ c_~A~0.offset .cse89))) (.cse86 (select .cse88 (+ c_~A~0.offset .cse89 4)))) (or (not (< .cse86 .cse87)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse86) (not (< .cse87 c_~min3~0)) (<= c_~min2~0 .cse86))))) (< (select .cse88 .cse3) c_~min1~0) (< (select .cse88 c_~A~0.offset) c_~min1~0)))) (or (and (or .cse34 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse16)) (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse90 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base)) (.cse91 (* ~M~0 4))) (or (< (select .cse90 (+ c_~A~0.offset .cse91 4)) c_~min3~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse90 .cse3) c_~min1~0) (< (select .cse90 c_~A~0.offset) c_~min1~0) (< (select .cse90 (+ c_~A~0.offset .cse91)) c_~min3~0))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse92 (select .cse93 c_~A~0.offset))) (or (= c_~min2~0 .cse92) (< (select .cse93 .cse3) .cse92) (forall ((~M~0 Int)) (let ((.cse95 (* ~M~0 4))) (let ((.cse94 (select .cse93 (+ c_~A~0.offset .cse95)))) (or (< .cse94 c_~min2~0) (< 0 ~M~0) (< (select .cse93 (+ c_~A~0.offset .cse95 4)) .cse94) (< (+ 2 ~M~0) c_~N~0) (not (< .cse94 c_~min3~0)))))) (not (< .cse92 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse98 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse96 (select .cse98 .cse3))) (or (= c_~min2~0 .cse96) (forall ((~M~0 Int)) (let ((.cse99 (* ~M~0 4))) (let ((.cse97 (select .cse98 (+ c_~A~0.offset .cse99 4)))) (or (< 0 ~M~0) (< .cse97 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse97 c_~min3~0)) (< (select .cse98 (+ c_~A~0.offset .cse99)) c_~min3~0))))) (< (select .cse98 c_~A~0.offset) c_~min1~0) (not (< .cse96 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse103 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse102 (select .cse103 .cse3)) (.cse105 (select .cse103 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse104 (* ~M~0 4))) (let ((.cse101 (select .cse103 (+ c_~A~0.offset .cse104))) (.cse100 (select .cse103 (+ c_~A~0.offset .cse104 4)))) (or (not (< .cse100 .cse101)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse101 c_~min3~0)) (= .cse100 .cse102) (<= c_~min2~0 .cse100))))) (not (< .cse105 c_~min1~0)) (not (< .cse102 .cse105)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse108 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse107 (select .cse108 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse109 (* ~M~0 4))) (let ((.cse106 (select .cse108 (+ c_~A~0.offset .cse109 4)))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (= .cse106 .cse107) (not (< .cse106 c_~min3~0)) (< (select .cse108 (+ c_~A~0.offset .cse109)) c_~min3~0) (<= c_~min2~0 .cse106))))) (< (select .cse108 c_~A~0.offset) c_~min1~0) (not (< .cse107 c_~min1~0)))))) (or (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse110 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse112 (select .cse110 c_~A~0.offset)) (.cse111 (* ~M~0 4))) (or (< (select .cse110 (+ c_~A~0.offset .cse111 4)) c_~min3~0) (= c_~min2~0 .cse112) (< 0 ~M~0) (< (select .cse110 .cse3) .cse112) (< (+ 2 ~M~0) c_~N~0) (not (< .cse112 c_~min1~0)) (< (select .cse110 (+ c_~A~0.offset .cse111)) c_~min3~0))))) .cse16) (or .cse34 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int)) (let ((.cse114 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse113 (select .cse114 .cse3)) (.cse115 (* ~M~0 4))) (or (= c_~min3~0 .cse113) (< (select .cse114 (+ c_~A~0.offset .cse115 4)) c_~min3~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse114 c_~A~0.offset) c_~min1~0) (not (< .cse113 c_~min1~0)) (< (select .cse114 (+ c_~A~0.offset .cse115)) c_~min3~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse118 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse116 (select .cse118 .cse3)) (.cse120 (select .cse118 c_~A~0.offset))) (or (= c_~min2~0 .cse116) (forall ((~M~0 Int)) (let ((.cse119 (* ~M~0 4))) (let ((.cse117 (select .cse118 (+ c_~A~0.offset .cse119 4)))) (or (< 0 ~M~0) (< .cse117 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse117 c_~min3~0)) (< (select .cse118 (+ c_~A~0.offset .cse119)) c_~min3~0))))) (not (< .cse120 c_~min1~0)) (not (< .cse116 .cse120)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse121 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse124 (select .cse121 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse122 (* ~M~0 4))) (let ((.cse123 (select .cse121 (+ c_~A~0.offset .cse122)))) (or (< 0 ~M~0) (< (select .cse121 (+ c_~A~0.offset .cse122 4)) .cse123) (= .cse124 .cse123) (< (+ 2 ~M~0) c_~N~0) (<= c_~min2~0 .cse123) (not (< .cse123 c_~min3~0)))))) (< (select .cse121 .cse3) .cse124) (not (< .cse124 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int))) (let ((.cse127 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse129 (select .cse127 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse128 (* ~M~0 4))) (let ((.cse125 (select .cse127 (+ c_~A~0.offset .cse128 4))) (.cse126 (select .cse127 (+ c_~A~0.offset .cse128)))) (or (not (< .cse125 .cse126)) (< 0 ~M~0) (< .cse125 c_~min2~0) (< (+ 2 ~M~0) c_~N~0) (not (< .cse126 c_~min3~0)))))) (= c_~min2~0 .cse129) (< (select .cse127 .cse3) .cse129) (not (< .cse129 c_~min1~0)))))))) is different from false [2022-12-13 05:02:12,775 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse46 (<= c_~min2~0 c_~min3~0)) (.cse33 (< c_~min3~0 c_~min2~0)) (.cse4 (+ c_~A~0.offset 4))) (and (or .cse0 (forall ((v_ArrVal_1325 (Array Int Int)) (~M~0 Int) (v_ArrVal_1324 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base)) (.cse5 (* ~M~0 4))) (let ((.cse3 (select .cse1 (+ c_~A~0.offset .cse5 4))) (.cse2 (select .cse1 (+ c_~A~0.offset .cse5)))) (or (< (select .cse1 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (not (< .cse2 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse3 c_~min2~0) (< (select .cse1 .cse4) c_~min1~0) (not (< .cse3 .cse2))))))) (or .cse0 (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base)) (.cse8 (* ~M~0 4))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset .cse8 4)))) (or (not (< .cse6 c_~min3~0)) (< (select .cse7 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< .cse6 c_~min2~0) (< (select .cse7 (+ c_~A~0.offset .cse8)) c_~min3~0) (< (select .cse7 .cse4) c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse10 (select .cse9 c_~A~0.offset))) (or (< (select .cse9 .cse4) .cse10) (forall ((~M~0 Int)) (let ((.cse13 (* ~M~0 4))) (let ((.cse12 (select .cse9 (+ c_~A~0.offset .cse13 4))) (.cse11 (select .cse9 (+ c_~A~0.offset .cse13)))) (or (< 0 ~M~0) (not (< .cse11 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse12 c_~min2~0) (not (< .cse12 .cse11)))))) (= c_~min2~0 .cse10) (not (< .cse10 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse4))) (or (not (< .cse14 c_~min1~0)) (< (select .cse15 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse18 (* ~M~0 4))) (let ((.cse16 (select .cse15 (+ c_~A~0.offset .cse18 4))) (.cse17 (select .cse15 (+ c_~A~0.offset .cse18)))) (or (< 0 ~M~0) (<= c_~min2~0 .cse16) (not (< .cse17 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse16 .cse14) (not (< .cse16 .cse17)))))))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse4)) (.cse23 (select .cse20 c_~A~0.offset))) (or (= c_~min2~0 .cse19) (forall ((~M~0 Int)) (let ((.cse21 (* ~M~0 4))) (let ((.cse22 (select .cse20 (+ c_~A~0.offset .cse21)))) (or (< (select .cse20 (+ c_~A~0.offset .cse21 4)) .cse22) (< 0 ~M~0) (not (< .cse22 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse22 c_~min2~0))))) (not (< .cse19 .cse23)) (not (< .cse23 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse4))) (or (= c_~min2~0 .cse24) (not (< .cse24 c_~min1~0)) (< (select .cse25 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse28 (* ~M~0 4))) (let ((.cse27 (select .cse25 (+ c_~A~0.offset .cse28 4))) (.cse26 (select .cse25 (+ c_~A~0.offset .cse28)))) (or (< 0 ~M~0) (not (< .cse26 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse27 c_~min2~0) (not (< .cse27 .cse26)))))))))) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse31 (* ~M~0 4)) (.cse29 (select .cse30 .cse4)) (.cse32 (select .cse30 c_~A~0.offset))) (or (= c_~min2~0 .cse29) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse30 (+ c_~A~0.offset .cse31 4)) c_~min3~0) (< (select .cse30 (+ c_~A~0.offset .cse31)) c_~min3~0) (not (< .cse29 .cse32)) (not (< .cse32 c_~min1~0)))))) .cse33) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse35 (select .cse38 c_~A~0.offset)) (.cse34 (select .cse38 .cse4))) (or (not (< .cse34 .cse35)) (not (< .cse35 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse39 (* ~M~0 4))) (let ((.cse36 (select .cse38 (+ c_~A~0.offset .cse39 4))) (.cse37 (select .cse38 (+ c_~A~0.offset .cse39)))) (or (< 0 ~M~0) (<= c_~min2~0 .cse36) (not (< .cse37 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse36 .cse34) (not (< .cse36 .cse37)))))))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (or (< (select .cse40 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse42 (* ~M~0 4))) (let ((.cse41 (select .cse40 (+ c_~A~0.offset .cse42 4)))) (or (not (< .cse41 c_~min3~0)) (= c_~min1~0 .cse41) (< 0 ~M~0) (<= c_~min2~0 .cse41) (< (+ 2 ~M~0) c_~N~0) (< (select .cse40 (+ c_~A~0.offset .cse42)) c_~min3~0))))) (< (select .cse40 .cse4) c_~min1~0)))) (or .cse0 (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base)) (.cse44 (* ~M~0 4))) (let ((.cse45 (select .cse43 (+ c_~A~0.offset .cse44)))) (or (< (select .cse43 c_~A~0.offset) c_~min1~0) (< (select .cse43 (+ c_~A~0.offset .cse44 4)) .cse45) (< 0 ~M~0) (not (< .cse45 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse45 c_~min2~0) (< (select .cse43 .cse4) c_~min1~0)))))) (or .cse46 (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse49 (* ~M~0 4)) (.cse48 (select .cse47 c_~A~0.offset))) (or (< (select .cse47 .cse4) .cse48) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse47 (+ c_~A~0.offset .cse49 4)) c_~min3~0) (< (select .cse47 (+ c_~A~0.offset .cse49)) c_~min3~0) (not (< .cse48 c_~min1~0)) (= .cse48 c_~min3~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (or (< (select .cse50 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse51 (* ~M~0 4))) (let ((.cse52 (select .cse50 (+ c_~A~0.offset .cse51)))) (or (< (select .cse50 (+ c_~A~0.offset .cse51 4)) .cse52) (<= c_~min2~0 .cse52) (< 0 ~M~0) (not (< .cse52 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse52))))) (< (select .cse50 .cse4) c_~min1~0)))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse56 (select .cse53 .cse4)) (.cse57 (select .cse53 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse54 (* ~M~0 4))) (let ((.cse55 (select .cse53 (+ c_~A~0.offset .cse54)))) (or (< (select .cse53 (+ c_~A~0.offset .cse54 4)) .cse55) (<= c_~min2~0 .cse55) (< 0 ~M~0) (not (< .cse55 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse56 .cse55))))) (not (< .cse56 .cse57)) (not (< .cse57 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse59 (select .cse58 c_~A~0.offset))) (or (< (select .cse58 .cse4) .cse59) (forall ((~M~0 Int)) (let ((.cse61 (* ~M~0 4))) (let ((.cse60 (select .cse58 (+ c_~A~0.offset .cse61 4)))) (or (not (< .cse60 c_~min3~0)) (= .cse59 .cse60) (< 0 ~M~0) (<= c_~min2~0 .cse60) (< (+ 2 ~M~0) c_~N~0) (< (select .cse58 (+ c_~A~0.offset .cse61)) c_~min3~0))))) (not (< .cse59 c_~min1~0)))))) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse62 (select .cse63 .cse4)) (.cse64 (* ~M~0 4))) (or (= c_~min2~0 .cse62) (not (< .cse62 c_~min1~0)) (< (select .cse63 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse63 (+ c_~A~0.offset .cse64 4)) c_~min3~0) (< (select .cse63 (+ c_~A~0.offset .cse64)) c_~min3~0))))) .cse33) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse66 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse65 (select .cse66 .cse4))) (or (= c_~min2~0 .cse65) (not (< .cse65 c_~min1~0)) (< (select .cse66 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse68 (* ~M~0 4))) (let ((.cse67 (select .cse66 (+ c_~A~0.offset .cse68 4)))) (or (not (< .cse67 c_~min3~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< .cse67 c_~min2~0) (< (select .cse66 (+ c_~A~0.offset .cse68)) c_~min3~0))))))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse71 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse70 (select .cse71 .cse4)) (.cse73 (select .cse71 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse72 (* ~M~0 4))) (let ((.cse69 (select .cse71 (+ c_~A~0.offset .cse72 4)))) (or (not (< .cse69 c_~min3~0)) (< 0 ~M~0) (<= c_~min2~0 .cse69) (< (+ 2 ~M~0) c_~N~0) (= .cse69 .cse70) (< (select .cse71 (+ c_~A~0.offset .cse72)) c_~min3~0))))) (not (< .cse70 .cse73)) (not (< .cse73 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse74 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse75 (select .cse74 c_~A~0.offset))) (or (< (select .cse74 .cse4) .cse75) (forall ((~M~0 Int)) (let ((.cse78 (* ~M~0 4))) (let ((.cse76 (select .cse74 (+ c_~A~0.offset .cse78 4))) (.cse77 (select .cse74 (+ c_~A~0.offset .cse78)))) (or (= .cse75 .cse76) (< 0 ~M~0) (<= c_~min2~0 .cse76) (not (< .cse77 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse76 .cse77)))))) (not (< .cse75 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse80 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse79 (select .cse80 .cse4))) (or (not (< .cse79 c_~min1~0)) (< (select .cse80 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse82 (* ~M~0 4))) (let ((.cse81 (select .cse80 (+ c_~A~0.offset .cse82 4)))) (or (not (< .cse81 c_~min3~0)) (< 0 ~M~0) (<= c_~min2~0 .cse81) (< (+ 2 ~M~0) c_~N~0) (= .cse81 .cse79) (< (select .cse80 (+ c_~A~0.offset .cse82)) c_~min3~0))))))))) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse83 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse84 (* ~M~0 4)) (.cse85 (select .cse83 .cse4)) (.cse86 (select .cse83 c_~A~0.offset))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse83 (+ c_~A~0.offset .cse84 4)) c_~min3~0) (= .cse85 c_~min3~0) (< (select .cse83 (+ c_~A~0.offset .cse84)) c_~min3~0) (not (< .cse85 .cse86)) (not (< .cse86 c_~min1~0)))))) .cse46) (or (and (or .cse46 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse33)) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse88 (* ~M~0 4)) (.cse87 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (or (< (select .cse87 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse87 (+ c_~A~0.offset .cse88 4)) c_~min3~0) (< (select .cse87 (+ c_~A~0.offset .cse88)) c_~min3~0) (< (select .cse87 .cse4) c_~min1~0))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse89 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse92 (select .cse89 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse90 (* ~M~0 4))) (let ((.cse91 (select .cse89 (+ c_~A~0.offset .cse90)))) (or (< (select .cse89 (+ c_~A~0.offset .cse90 4)) .cse91) (<= c_~min2~0 .cse91) (< 0 ~M~0) (not (< .cse91 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse92 .cse91))))) (< (select .cse89 .cse4) .cse92) (not (< .cse92 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse96 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse93 (select .cse96 .cse4)) (.cse98 (select .cse96 c_~A~0.offset))) (or (= c_~min2~0 .cse93) (forall ((~M~0 Int)) (let ((.cse97 (* ~M~0 4))) (let ((.cse95 (select .cse96 (+ c_~A~0.offset .cse97 4))) (.cse94 (select .cse96 (+ c_~A~0.offset .cse97)))) (or (< 0 ~M~0) (not (< .cse94 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse95 c_~min2~0) (not (< .cse95 .cse94)))))) (not (< .cse93 .cse98)) (not (< .cse98 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse100 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse99 (select .cse100 .cse4))) (or (= c_~min2~0 .cse99) (not (< .cse99 c_~min1~0)) (< (select .cse100 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse101 (* ~M~0 4))) (let ((.cse102 (select .cse100 (+ c_~A~0.offset .cse101)))) (or (< (select .cse100 (+ c_~A~0.offset .cse101 4)) .cse102) (< 0 ~M~0) (not (< .cse102 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse102 c_~min2~0))))))))) (or .cse46 (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse104 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse103 (select .cse104 .cse4)) (.cse105 (* ~M~0 4))) (or (not (< .cse103 c_~min1~0)) (< (select .cse104 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< (select .cse104 (+ c_~A~0.offset .cse105 4)) c_~min3~0) (= .cse103 c_~min3~0) (< (select .cse104 (+ c_~A~0.offset .cse105)) c_~min3~0)))))) (or (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (~M~0 Int)) (let ((.cse106 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse108 (* ~M~0 4)) (.cse107 (select .cse106 c_~A~0.offset))) (or (< (select .cse106 .cse4) .cse107) (< 0 ~M~0) (= c_~min2~0 .cse107) (< (+ 2 ~M~0) c_~N~0) (< (select .cse106 (+ c_~A~0.offset .cse108 4)) c_~min3~0) (< (select .cse106 (+ c_~A~0.offset .cse108)) c_~min3~0) (not (< .cse107 c_~min1~0)))))) .cse33) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse111 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse109 (select .cse111 .cse4)) (.cse113 (select .cse111 c_~A~0.offset))) (or (= c_~min2~0 .cse109) (forall ((~M~0 Int)) (let ((.cse112 (* ~M~0 4))) (let ((.cse110 (select .cse111 (+ c_~A~0.offset .cse112 4)))) (or (not (< .cse110 c_~min3~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< .cse110 c_~min2~0) (< (select .cse111 (+ c_~A~0.offset .cse112)) c_~min3~0))))) (not (< .cse109 .cse113)) (not (< .cse113 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse114 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (or (< (select .cse114 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse117 (* ~M~0 4))) (let ((.cse115 (select .cse114 (+ c_~A~0.offset .cse117 4))) (.cse116 (select .cse114 (+ c_~A~0.offset .cse117)))) (or (= c_~min1~0 .cse115) (< 0 ~M~0) (<= c_~min2~0 .cse115) (not (< .cse116 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (not (< .cse115 .cse116)))))) (< (select .cse114 .cse4) c_~min1~0)))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse118 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse119 (select .cse118 c_~A~0.offset))) (or (< (select .cse118 .cse4) .cse119) (forall ((~M~0 Int)) (let ((.cse121 (* ~M~0 4))) (let ((.cse120 (select .cse118 (+ c_~A~0.offset .cse121 4)))) (or (not (< .cse120 c_~min3~0)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< .cse120 c_~min2~0) (< (select .cse118 (+ c_~A~0.offset .cse121)) c_~min3~0))))) (= c_~min2~0 .cse119) (not (< .cse119 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse122 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse123 (select .cse122 c_~A~0.offset))) (or (< (select .cse122 .cse4) .cse123) (forall ((~M~0 Int)) (let ((.cse124 (* ~M~0 4))) (let ((.cse125 (select .cse122 (+ c_~A~0.offset .cse124)))) (or (< (select .cse122 (+ c_~A~0.offset .cse124 4)) .cse125) (< 0 ~M~0) (not (< .cse125 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (< .cse125 c_~min2~0))))) (= c_~min2~0 .cse123) (not (< .cse123 c_~min1~0)))))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (let ((.cse127 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1325) c_~A~0.base))) (let ((.cse126 (select .cse127 .cse4))) (or (not (< .cse126 c_~min1~0)) (< (select .cse127 c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse128 (* ~M~0 4))) (let ((.cse129 (select .cse127 (+ c_~A~0.offset .cse128)))) (or (< (select .cse127 (+ c_~A~0.offset .cse128 4)) .cse129) (<= c_~min2~0 .cse129) (< 0 ~M~0) (not (< .cse129 c_~min3~0)) (< (+ 2 ~M~0) c_~N~0) (= .cse126 .cse129))))))))))) is different from false [2022-12-13 05:02:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:02:13,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901658141] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:02:13,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:02:13,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33 [2022-12-13 05:02:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972167270] [2022-12-13 05:02:13,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:02:13,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 05:02:13,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:02:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 05:02:13,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=905, Unknown=2, NotChecked=126, Total=1190 [2022-12-13 05:02:13,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:02:13,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 3756 transitions, 232325 flow. Second operand has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:02:13,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:02:13,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:02:13,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:02:33,080 WARN L233 SmtUtils]: Spent 18.64s on a formula simplification. DAG size of input: 119 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:03:00,296 WARN L233 SmtUtils]: Spent 26.57s on a formula simplification. DAG size of input: 175 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:03:33,965 WARN L233 SmtUtils]: Spent 33.24s on a formula simplification. DAG size of input: 138 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:03:48,910 INFO L130 PetriNetUnfolder]: 5588/8808 cut-off events. [2022-12-13 05:03:48,911 INFO L131 PetriNetUnfolder]: For 44438/44438 co-relation queries the response was YES. [2022-12-13 05:03:48,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276958 conditions, 8808 events. 5588/8808 cut-off events. For 44438/44438 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 54259 event pairs, 4 based on Foata normal form. 3/7103 useless extension candidates. Maximal degree in co-relation 197589. Up to 8643 conditions per place. [2022-12-13 05:03:49,008 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 3468 selfloop transitions, 378 changer transitions 22/3868 dead transitions. [2022-12-13 05:03:49,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 3868 transitions, 247060 flow [2022-12-13 05:03:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 05:03:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 05:03:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 180 transitions. [2022-12-13 05:03:49,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-13 05:03:49,010 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places. [2022-12-13 05:03:49,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 3868 transitions, 247060 flow [2022-12-13 05:03:49,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 3846 transitions, 245625 flow [2022-12-13 05:03:49,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:03:49,260 INFO L89 Accepts]: Start accepts. Operand has 280 places, 3846 transitions, 245625 flow [2022-12-13 05:03:49,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:03:49,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:03:49,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 3846 transitions, 245625 flow [2022-12-13 05:03:49,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 3846 transitions, 245625 flow [2022-12-13 05:03:49,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:03:53,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [387] $Ultimate##0-->L46-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] and [544] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre15#1_29|)) |v_#memory_int_148|) (= |v_ULTIMATE.start_main_#t~pre15#1_29| |v_#pthreadsForks_63|) (= |v_#pthreadsForks_62| (+ |v_#pthreadsForks_63| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_37|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 05:03:53,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] $Ultimate##0-->L46-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_107 1) (let ((.cse0 (select (select |v_#memory_int_248| v_~A~0.base_103) (+ v_~A~0.offset_103 (* v_thread1Thread1of1ForFork1_~i~0_107 4) (- 4))))) (let ((.cse1 (< .cse0 v_~min1~0_126))) (or (and (= v_~min1~0_125 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_88| |v_thread1Thread1of1ForFork1_#t~mem3_87|) (not .cse1) (= v_~min1~0_126 v_~min1~0_125))))) (< v_thread1Thread1of1ForFork1_~i~0_107 (+ 1 v_~N~0_85))) InVars {~A~0.base=v_~A~0.base_103, ~A~0.offset=v_~A~0.offset_103, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_88|, #memory_int=|v_#memory_int_248|, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_126} OutVars{~A~0.base=v_~A~0.base_103, ~A~0.offset=v_~A~0.offset_103, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_63|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_87|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_71|, #memory_int=|v_#memory_int_248|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_107, ~N~0=v_~N~0_85, ~min1~0=v_~min1~0_125} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [544] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre15#1_29|)) |v_#memory_int_148|) (= |v_ULTIMATE.start_main_#t~pre15#1_29| |v_#pthreadsForks_63|) (= |v_#pthreadsForks_62| (+ |v_#pthreadsForks_63| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_37|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 05:03:53,518 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 05:03:53,519 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 05:03:53,715 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:03:53,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4456 [2022-12-13 05:03:53,716 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 3843 transitions, 245469 flow [2022-12-13 05:03:53,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:03:53,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:03:53,716 INFO L214 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-13 05:03:53,721 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-13 05:03:53,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:03:53,921 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-13 05:03:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:03:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash 305474797, now seen corresponding path program 2 times [2022-12-13 05:03:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:03:53,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557647323] [2022-12-13 05:03:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:03:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:03:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:03:55,048 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-13 05:03:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:03:55,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557647323] [2022-12-13 05:03:55,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557647323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:03:55,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473555215] [2022-12-13 05:03:55,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:03:55,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:03:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:03:55,049 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:03:55,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 05:03:55,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:03:55,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:03:55,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 05:03:55,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:03:55,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:03:55,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 98 [2022-12-13 05:03:56,558 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-13 05:03:56,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:04:00,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:04:00,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 715 treesize of output 1591 [2022-12-13 05:05:37,240 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 05:06:14,491 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:06:26,744 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:06:46,350 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-13 05:08:41,696 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 05:09:24,487 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 05:10:09,615 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:10:31,967 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:10:59,986 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:11:17,954 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:11:36,915 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-13 05:12:28,916 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. Received shutdown request... [2022-12-13 05:12:44,027 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:12:44,029 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:12:44,054 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 05:12:44,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 05:12:44,061 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-13 05:12:44,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:12:44,258 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 70ms.. [2022-12-13 05:12:44,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 05:12:44,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 05:12:44,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 05:12:44,260 INFO L445 BasicCegarLoop]: Path program histogram: [10, 9, 6, 2, 2, 1, 1, 1] [2022-12-13 05:12:44,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 05:12:44,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 05:12:44,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:12:44 BasicIcfg [2022-12-13 05:12:44,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 05:12:44,269 INFO L158 Benchmark]: Toolchain (without parser) took 841125.30ms. Allocated memory was 194.0MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 170.0MB in the beginning and 433.1MB in the end (delta: -263.1MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 05:12:44,269 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 194.0MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 05:12:44,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.62ms. Allocated memory is still 194.0MB. Free memory was 169.5MB in the beginning and 157.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 05:12:44,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.41ms. Allocated memory is still 194.0MB. Free memory was 157.4MB in the beginning and 155.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 05:12:44,270 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 194.0MB. Free memory was 155.9MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:12:44,270 INFO L158 Benchmark]: RCFGBuilder took 394.93ms. Allocated memory is still 194.0MB. Free memory was 154.3MB in the beginning and 133.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 05:12:44,271 INFO L158 Benchmark]: TraceAbstraction took 840392.42ms. Allocated memory was 194.0MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 132.3MB in the beginning and 433.1MB in the end (delta: -300.8MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 05:12:44,275 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.08ms. Allocated memory is still 194.0MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.62ms. Allocated memory is still 194.0MB. Free memory was 169.5MB in the beginning and 157.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.41ms. Allocated memory is still 194.0MB. Free memory was 157.4MB in the beginning and 155.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 194.0MB. Free memory was 155.9MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 394.93ms. Allocated memory is still 194.0MB. Free memory was 154.3MB in the beginning and 133.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 840392.42ms. Allocated memory was 194.0MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 132.3MB in the beginning and 433.1MB in the end (delta: -300.8MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 127 PlacesBefore, 30 PlacesAfterwards, 129 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 67 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 674, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 674, unknown conditional: 0, unknown unconditional: 674] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1062, Positive conditional cache size: 0, Positive unconditional cache size: 1062, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 32 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 42 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, 34 PlacesBefore, 34 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 36 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, 39 PlacesBefore, 39 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 178 TransitionsBefore, 178 TransitionsAfterwards, 12 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, 49 PlacesBefore, 49 PlacesAfterwards, 226 TransitionsBefore, 226 TransitionsAfterwards, 12 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, 54 PlacesBefore, 54 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 12 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, 59 PlacesBefore, 59 PlacesAfterwards, 211 TransitionsBefore, 211 TransitionsAfterwards, 12 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, 64 PlacesBefore, 64 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 12 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: 2.3s, 68 PlacesBefore, 67 PlacesAfterwards, 325 TransitionsBefore, 324 TransitionsAfterwards, 22 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, 90 PlacesBefore, 90 PlacesAfterwards, 1096 TransitionsBefore, 1096 TransitionsAfterwards, 18 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: 2.8s, 102 PlacesBefore, 101 PlacesAfterwards, 1470 TransitionsBefore, 1469 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, 118 PlacesBefore, 118 PlacesAfterwards, 2348 TransitionsBefore, 2348 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, 149 PlacesBefore, 149 PlacesAfterwards, 3122 TransitionsBefore, 3122 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, 176 PlacesBefore, 176 PlacesAfterwards, 4407 TransitionsBefore, 4407 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, 180 PlacesBefore, 180 PlacesAfterwards, 3877 TransitionsBefore, 3877 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, 189 PlacesBefore, 189 PlacesAfterwards, 4218 TransitionsBefore, 4218 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, 204 PlacesBefore, 204 PlacesAfterwards, 4433 TransitionsBefore, 4433 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, 213 PlacesBefore, 213 PlacesAfterwards, 4480 TransitionsBefore, 4480 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, 207 PlacesBefore, 207 PlacesAfterwards, 4080 TransitionsBefore, 4080 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 206 PlacesBefore, 206 PlacesAfterwards, 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: 0.0s, 150 PlacesBefore, 150 PlacesAfterwards, 1255 TransitionsBefore, 1255 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, 165 PlacesBefore, 165 PlacesAfterwards, 2117 TransitionsBefore, 2117 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, 176 PlacesBefore, 176 PlacesAfterwards, 2275 TransitionsBefore, 2275 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, 182 PlacesBefore, 182 PlacesAfterwards, 2214 TransitionsBefore, 2214 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, 198 PlacesBefore, 198 PlacesAfterwards, 2164 TransitionsBefore, 2164 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, 214 PlacesBefore, 214 PlacesAfterwards, 2117 TransitionsBefore, 2117 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 222 PlacesBefore, 222 PlacesAfterwards, 2369 TransitionsBefore, 2369 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, 234 PlacesBefore, 234 PlacesAfterwards, 2414 TransitionsBefore, 2414 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, 239 PlacesBefore, 239 PlacesAfterwards, 2353 TransitionsBefore, 2353 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, 261 PlacesBefore, 261 PlacesAfterwards, 3756 TransitionsBefore, 3756 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: 4.3s, 280 PlacesBefore, 277 PlacesAfterwards, 3846 TransitionsBefore, 3843 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 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 70ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 70ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 70ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 70ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 161 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: 840.3s, OverallIterations: 32, TraceHistogramMax: 2, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 207.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 51 mSolverCounterUnknown, 3933 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3933 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 682 IncrementalHoareTripleChecker+Unchecked, 782 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15667 IncrementalHoareTripleChecker+Invalid, 16675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 158 mSDtfsCounter, 15667 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 690 SyntacticMatches, 39 SemanticMatches, 606 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4178 ImplicationChecksByTransitivity, 152.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245625occurred in iteration=31, InterpolantAutomatonStates: 392, 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.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 74.8s InterpolantComputationTime, 1141 NumberOfCodeBlocks, 1128 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1501 ConstructedInterpolants, 49 QuantifiedInterpolants, 62556 SizeOfPredicates, 261 NumberOfNonLiveVariables, 4393 ConjunctsInSsa, 479 ConjunctsInUnsatCore, 73 InterpolantComputations, 11 PerfectInterpolantSequences, 85/216 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