/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:42:49,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:42:49,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:42:49,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:42:49,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:42:49,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:42:49,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:42:49,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:42:49,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:42:49,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:42:49,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:42:49,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:42:49,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:42:49,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:42:49,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:42:49,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:42:49,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:42:49,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:42:49,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:42:49,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:42:49,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:42:49,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:42:49,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:42:49,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:42:49,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:42:49,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:42:49,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:42:49,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:42:49,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:42:49,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:42:49,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:42:49,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:42:49,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:42:49,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:42:49,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:42:49,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:42:49,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:42:49,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:42:49,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:42:49,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:42:49,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:42:49,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:42:50,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:42:50,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:42:50,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:42:50,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:42:50,009 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:42:50,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:42:50,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:42:50,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:42:50,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:42:50,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:42:50,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:42:50,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:42:50,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:42:50,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:42:50,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:42:50,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:42:50,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:42:50,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:42:50,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:42:50,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:42:50,012 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:42:50,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:42:50,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:42:50,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:42:50,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:42:50,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:42:50,335 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:42:50,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-06 02:42:51,305 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:42:51,539 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:42:51,540 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-06 02:42:51,546 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcfed1ff6/10b5fd9391194e3bba5f4a9851a9bdfb/FLAG38dbaeb65 [2022-12-06 02:42:51,559 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcfed1ff6/10b5fd9391194e3bba5f4a9851a9bdfb [2022-12-06 02:42:51,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:42:51,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:42:51,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:42:51,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:42:51,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:42:51,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14df9047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51, skipping insertion in model container [2022-12-06 02:42:51,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:42:51,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:42:51,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:51,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:51,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:51,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:51,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:51,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:51,731 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-06 02:42:51,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:42:51,766 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:42:51,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:51,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:51,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:51,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:51,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:42:51,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:42:51,812 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-06 02:42:51,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:42:51,834 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:42:51,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51 WrapperNode [2022-12-06 02:42:51,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:42:51,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:42:51,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:42:51,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:42:51,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,893 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2022-12-06 02:42:51,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:42:51,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:42:51,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:42:51,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:42:51,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,928 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:42:51,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:42:51,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:42:51,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:42:51,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (1/1) ... [2022-12-06 02:42:51,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:42:51,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:51,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:42:51,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:42:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:42:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:42:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:42:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:42:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:42:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:42:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:42:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:42:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:42:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:42:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:42:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:42:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:42:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:42:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:42:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:42:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:42:52,006 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:42:52,143 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:42:52,145 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:42:52,442 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:42:52,570 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:42:52,575 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 02:42:52,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:42:52 BoogieIcfgContainer [2022-12-06 02:42:52,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:42:52,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:42:52,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:42:52,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:42:52,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:42:51" (1/3) ... [2022-12-06 02:42:52,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c29bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:42:52, skipping insertion in model container [2022-12-06 02:42:52,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:42:51" (2/3) ... [2022-12-06 02:42:52,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c29bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:42:52, skipping insertion in model container [2022-12-06 02:42:52,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:42:52" (3/3) ... [2022-12-06 02:42:52,583 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-12-06 02:42:52,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:42:52,599 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:42:52,599 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:42:52,753 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:42:52,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 02:42:52,860 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-06 02:42:52,860 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:42:52,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 02:42:52,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 02:42:52,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-06 02:42:52,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:52,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 02:42:52,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 274 flow [2022-12-06 02:42:52,945 INFO L130 PetriNetUnfolder]: 12/128 cut-off events. [2022-12-06 02:42:52,945 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:42:52,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 12/128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 02:42:52,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 02:42:52,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 02:42:57,644 INFO L203 LiptonReduction]: Total number of compositions: 104 [2022-12-06 02:42:57,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:42:57,658 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;@2f0daa47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:42:57,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:42:57,662 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 02:42:57,662 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:42:57,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:57,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:57,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:42:57,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash 192526010, now seen corresponding path program 1 times [2022-12-06 02:42:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:57,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924863421] [2022-12-06 02:42:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:57,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:58,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924863421] [2022-12-06 02:42:58,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924863421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:58,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:58,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:42:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87764791] [2022-12-06 02:42:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:58,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:42:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:58,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:42:58,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:42:58,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 02:42:58,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-06 02:42:58,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:58,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 02:42:58,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:58,125 INFO L130 PetriNetUnfolder]: 360/508 cut-off events. [2022-12-06 02:42:58,125 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 02:42:58,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 360/508 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1627 event pairs, 39 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-06 02:42:58,131 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2022-12-06 02:42:58,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2022-12-06 02:42:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:42:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:42:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 02:42:58,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2022-12-06 02:42:58,144 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-06 02:42:58,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:58,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 40 transitions, 187 flow [2022-12-06 02:42:58,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 40 transitions, 187 flow [2022-12-06 02:42:58,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 02:42:58,156 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:58,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 02:42:58,157 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 40 transitions, 187 flow [2022-12-06 02:42:58,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-06 02:42:58,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:58,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:58,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:42:58,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:42:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash -440998104, now seen corresponding path program 1 times [2022-12-06 02:42:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:58,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315172553] [2022-12-06 02:42:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:58,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:58,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315172553] [2022-12-06 02:42:58,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315172553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:42:58,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:42:58,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:42:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224956776] [2022-12-06 02:42:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:42:58,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:42:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:58,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:42:58,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:42:58,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 02:42:58,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 40 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:58,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:58,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 02:42:58,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:58,633 INFO L130 PetriNetUnfolder]: 675/987 cut-off events. [2022-12-06 02:42:58,633 INFO L131 PetriNetUnfolder]: For 227/231 co-relation queries the response was YES. [2022-12-06 02:42:58,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 987 events. 675/987 cut-off events. For 227/231 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4043 event pairs, 66 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 1193. Up to 705 conditions per place. [2022-12-06 02:42:58,639 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 95 selfloop transitions, 6 changer transitions 8/111 dead transitions. [2022-12-06 02:42:58,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 111 transitions, 744 flow [2022-12-06 02:42:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:42:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:42:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 02:42:58,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-06 02:42:58,642 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-06 02:42:58,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:58,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 111 transitions, 744 flow [2022-12-06 02:42:58,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 111 transitions, 744 flow [2022-12-06 02:42:58,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 02:43:00,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:43:00,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2052 [2022-12-06 02:43:00,694 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 110 transitions, 738 flow [2022-12-06 02:43:00,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:00,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:00,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:00,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:43:00,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:00,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1124651172, now seen corresponding path program 1 times [2022-12-06 02:43:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:00,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154976701] [2022-12-06 02:43:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:00,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:00,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154976701] [2022-12-06 02:43:00,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154976701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:00,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:00,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:43:00,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852662946] [2022-12-06 02:43:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:00,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:43:00,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:00,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:43:00,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:43:00,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:00,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 110 transitions, 738 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:00,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:00,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:00,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:00,950 INFO L130 PetriNetUnfolder]: 627/962 cut-off events. [2022-12-06 02:43:00,950 INFO L131 PetriNetUnfolder]: For 512/516 co-relation queries the response was YES. [2022-12-06 02:43:00,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 962 events. 627/962 cut-off events. For 512/516 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4070 event pairs, 92 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1649. Up to 568 conditions per place. [2022-12-06 02:43:00,955 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 111 selfloop transitions, 2 changer transitions 20/134 dead transitions. [2022-12-06 02:43:00,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 134 transitions, 1160 flow [2022-12-06 02:43:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:43:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:43:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 02:43:00,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 02:43:00,959 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 02:43:00,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:00,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 134 transitions, 1160 flow [2022-12-06 02:43:00,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 134 transitions, 1160 flow [2022-12-06 02:43:00,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 02:43:00,968 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:00,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:43:00,969 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 134 transitions, 1160 flow [2022-12-06 02:43:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:00,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:00,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:00,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:43:00,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash -17512187, now seen corresponding path program 1 times [2022-12-06 02:43:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:00,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474247408] [2022-12-06 02:43:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:01,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474247408] [2022-12-06 02:43:01,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474247408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:01,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:01,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:43:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850172133] [2022-12-06 02:43:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:01,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:43:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:01,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:43:01,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:43:01,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 02:43:01,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 134 transitions, 1160 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-06 02:43:01,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:01,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 02:43:01,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:01,146 INFO L130 PetriNetUnfolder]: 562/867 cut-off events. [2022-12-06 02:43:01,147 INFO L131 PetriNetUnfolder]: For 782/790 co-relation queries the response was YES. [2022-12-06 02:43:01,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 867 events. 562/867 cut-off events. For 782/790 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3343 event pairs, 123 based on Foata normal form. 8/709 useless extension candidates. Maximal degree in co-relation 2161. Up to 587 conditions per place. [2022-12-06 02:43:01,151 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 53 selfloop transitions, 0 changer transitions 54/109 dead transitions. [2022-12-06 02:43:01,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 109 transitions, 1141 flow [2022-12-06 02:43:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:43:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:43:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 02:43:01,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 02:43:01,153 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-06 02:43:01,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:01,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 109 transitions, 1141 flow [2022-12-06 02:43:01,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 109 transitions, 1141 flow [2022-12-06 02:43:01,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 02:43:01,158 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:01,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:43:01,158 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 109 transitions, 1141 flow [2022-12-06 02:43:01,158 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-06 02:43:01,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:01,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:01,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:43:01,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash 603620054, now seen corresponding path program 1 times [2022-12-06 02:43:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:01,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594644362] [2022-12-06 02:43:01,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:01,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:01,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:01,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594644362] [2022-12-06 02:43:01,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594644362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:01,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:01,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:43:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754575596] [2022-12-06 02:43:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:01,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:43:01,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:43:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:43:01,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 02:43:01,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 109 transitions, 1141 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:01,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:01,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 02:43:01,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:01,340 INFO L130 PetriNetUnfolder]: 503/774 cut-off events. [2022-12-06 02:43:01,341 INFO L131 PetriNetUnfolder]: For 1692/1777 co-relation queries the response was YES. [2022-12-06 02:43:01,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 conditions, 774 events. 503/774 cut-off events. For 1692/1777 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3101 event pairs, 59 based on Foata normal form. 5/650 useless extension candidates. Maximal degree in co-relation 2686. Up to 491 conditions per place. [2022-12-06 02:43:01,345 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 63 selfloop transitions, 6 changer transitions 51/122 dead transitions. [2022-12-06 02:43:01,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 122 transitions, 1499 flow [2022-12-06 02:43:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:43:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:43:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 02:43:01,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-06 02:43:01,350 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 02:43:01,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:01,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 122 transitions, 1499 flow [2022-12-06 02:43:01,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 122 transitions, 1499 flow [2022-12-06 02:43:01,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 02:43:01,359 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:01,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:43:01,359 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 122 transitions, 1499 flow [2022-12-06 02:43:01,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:01,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:01,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:01,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:43:01,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2115046665, now seen corresponding path program 1 times [2022-12-06 02:43:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:01,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132874490] [2022-12-06 02:43:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:01,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132874490] [2022-12-06 02:43:01,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132874490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:01,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:01,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:43:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846413907] [2022-12-06 02:43:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:01,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:43:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:01,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:43:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:43:01,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:01,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 122 transitions, 1499 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-06 02:43:01,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:01,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:01,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:01,637 INFO L130 PetriNetUnfolder]: 679/1031 cut-off events. [2022-12-06 02:43:01,637 INFO L131 PetriNetUnfolder]: For 2548/2632 co-relation queries the response was YES. [2022-12-06 02:43:01,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6661 conditions, 1031 events. 679/1031 cut-off events. For 2548/2632 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4146 event pairs, 49 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 4766. Up to 753 conditions per place. [2022-12-06 02:43:01,644 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 145 selfloop transitions, 22 changer transitions 51/219 dead transitions. [2022-12-06 02:43:01,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 219 transitions, 3130 flow [2022-12-06 02:43:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:43:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:43:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 02:43:01,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 02:43:01,645 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-06 02:43:01,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:01,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 219 transitions, 3130 flow [2022-12-06 02:43:01,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 219 transitions, 3130 flow [2022-12-06 02:43:01,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 02:43:01,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:01,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:43:01,655 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 219 transitions, 3130 flow [2022-12-06 02:43:01,655 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-06 02:43:01,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:01,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:43:01,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -771502965, now seen corresponding path program 2 times [2022-12-06 02:43:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631109332] [2022-12-06 02:43:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:01,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631109332] [2022-12-06 02:43:01,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631109332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:01,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:01,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:43:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755727717] [2022-12-06 02:43:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:01,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:43:01,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:43:01,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:43:01,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:01,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 219 transitions, 3130 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-06 02:43:01,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:01,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:01,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:02,020 INFO L130 PetriNetUnfolder]: 959/1444 cut-off events. [2022-12-06 02:43:02,020 INFO L131 PetriNetUnfolder]: For 3318/3414 co-relation queries the response was YES. [2022-12-06 02:43:02,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10852 conditions, 1444 events. 959/1444 cut-off events. For 3318/3414 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6010 event pairs, 42 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 8444. Up to 1152 conditions per place. [2022-12-06 02:43:02,032 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 270 selfloop transitions, 36 changer transitions 51/358 dead transitions. [2022-12-06 02:43:02,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 358 transitions, 5837 flow [2022-12-06 02:43:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:43:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:43:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 02:43:02,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 02:43:02,034 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2022-12-06 02:43:02,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:02,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 358 transitions, 5837 flow [2022-12-06 02:43:02,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 358 transitions, 5837 flow [2022-12-06 02:43:02,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 02:43:02,048 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:02,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 02:43:02,049 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 358 transitions, 5837 flow [2022-12-06 02:43:02,049 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-06 02:43:02,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:02,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:02,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:43:02,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1067316549, now seen corresponding path program 3 times [2022-12-06 02:43:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:02,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593770356] [2022-12-06 02:43:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:02,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593770356] [2022-12-06 02:43:02,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593770356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:02,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:02,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:43:02,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59446167] [2022-12-06 02:43:02,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:02,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:43:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:02,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:43:02,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:43:02,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:02,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 358 transitions, 5837 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-06 02:43:02,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:02,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:02,399 INFO L130 PetriNetUnfolder]: 983/1467 cut-off events. [2022-12-06 02:43:02,400 INFO L131 PetriNetUnfolder]: For 5030/5198 co-relation queries the response was YES. [2022-12-06 02:43:02,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12480 conditions, 1467 events. 983/1467 cut-off events. For 5030/5198 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6239 event pairs, 40 based on Foata normal form. 8/1133 useless extension candidates. Maximal degree in co-relation 9766. Up to 1175 conditions per place. [2022-12-06 02:43:02,454 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 265 selfloop transitions, 38 changer transitions 51/355 dead transitions. [2022-12-06 02:43:02,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 355 transitions, 6495 flow [2022-12-06 02:43:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:43:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:43:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-06 02:43:02,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 02:43:02,457 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2022-12-06 02:43:02,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:02,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 355 transitions, 6495 flow [2022-12-06 02:43:02,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 355 transitions, 6495 flow [2022-12-06 02:43:02,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 02:43:02,475 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:02,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 02:43:02,477 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 355 transitions, 6495 flow [2022-12-06 02:43:02,477 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-06 02:43:02,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:02,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:02,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:43:02,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash 899670099, now seen corresponding path program 4 times [2022-12-06 02:43:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:02,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10802297] [2022-12-06 02:43:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:02,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:02,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10802297] [2022-12-06 02:43:02,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10802297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:02,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:02,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:43:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451254939] [2022-12-06 02:43:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:02,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:43:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:02,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:43:02,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:43:02,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:02,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 355 transitions, 6495 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:02,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:02,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:02,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:02,952 INFO L130 PetriNetUnfolder]: 933/1404 cut-off events. [2022-12-06 02:43:02,952 INFO L131 PetriNetUnfolder]: For 4106/4202 co-relation queries the response was YES. [2022-12-06 02:43:02,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13223 conditions, 1404 events. 933/1404 cut-off events. For 4106/4202 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5836 event pairs, 42 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 10263. Up to 1114 conditions per place. [2022-12-06 02:43:02,967 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 253 selfloop transitions, 35 changer transitions 51/340 dead transitions. [2022-12-06 02:43:02,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 340 transitions, 6892 flow [2022-12-06 02:43:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:43:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:43:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 02:43:02,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 02:43:02,969 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2022-12-06 02:43:02,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:02,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 340 transitions, 6892 flow [2022-12-06 02:43:02,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 340 transitions, 6892 flow [2022-12-06 02:43:02,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 02:43:02,985 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:02,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 02:43:02,986 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 340 transitions, 6892 flow [2022-12-06 02:43:02,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:02,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:02,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:02,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 02:43:02,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1871483647, now seen corresponding path program 5 times [2022-12-06 02:43:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:02,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320931060] [2022-12-06 02:43:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:03,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320931060] [2022-12-06 02:43:03,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320931060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:03,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:03,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:43:03,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590403608] [2022-12-06 02:43:03,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:03,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:43:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:43:03,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:43:03,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:03,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 340 transitions, 6892 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:03,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:03,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:03,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:03,392 INFO L130 PetriNetUnfolder]: 962/1442 cut-off events. [2022-12-06 02:43:03,392 INFO L131 PetriNetUnfolder]: For 4702/4834 co-relation queries the response was YES. [2022-12-06 02:43:03,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14995 conditions, 1442 events. 962/1442 cut-off events. For 4702/4834 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6056 event pairs, 42 based on Foata normal form. 4/1124 useless extension candidates. Maximal degree in co-relation 11731. Up to 1150 conditions per place. [2022-12-06 02:43:03,403 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 263 selfloop transitions, 37 changer transitions 51/352 dead transitions. [2022-12-06 02:43:03,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 352 transitions, 7827 flow [2022-12-06 02:43:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:43:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:43:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 02:43:03,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2022-12-06 02:43:03,404 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2022-12-06 02:43:03,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:03,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 352 transitions, 7827 flow [2022-12-06 02:43:03,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 352 transitions, 7827 flow [2022-12-06 02:43:03,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 02:43:03,418 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:03,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 02:43:03,419 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 352 transitions, 7827 flow [2022-12-06 02:43:03,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:03,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:03,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:03,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 02:43:03,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1030448497, now seen corresponding path program 6 times [2022-12-06 02:43:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:03,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443652944] [2022-12-06 02:43:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443652944] [2022-12-06 02:43:03,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443652944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:03,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:43:03,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:43:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145146897] [2022-12-06 02:43:03,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:03,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:43:03,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:03,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:43:03,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:43:03,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:03,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 352 transitions, 7827 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:03,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:03,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:03,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:03,787 INFO L130 PetriNetUnfolder]: 963/1428 cut-off events. [2022-12-06 02:43:03,787 INFO L131 PetriNetUnfolder]: For 7574/7742 co-relation queries the response was YES. [2022-12-06 02:43:03,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16239 conditions, 1428 events. 963/1428 cut-off events. For 7574/7742 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5997 event pairs, 40 based on Foata normal form. 8/1120 useless extension candidates. Maximal degree in co-relation 12723. Up to 1138 conditions per place. [2022-12-06 02:43:03,796 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 248 selfloop transitions, 37 changer transitions 51/337 dead transitions. [2022-12-06 02:43:03,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 337 transitions, 8158 flow [2022-12-06 02:43:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:43:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:43:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-06 02:43:03,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 02:43:03,797 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2022-12-06 02:43:03,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:03,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 337 transitions, 8158 flow [2022-12-06 02:43:03,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 337 transitions, 8158 flow [2022-12-06 02:43:03,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 02:43:03,809 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:03,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 02:43:03,809 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 337 transitions, 8158 flow [2022-12-06 02:43:03,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:03,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:03,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:03,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 02:43:03,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1277602931, now seen corresponding path program 1 times [2022-12-06 02:43:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:03,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405541654] [2022-12-06 02:43:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405541654] [2022-12-06 02:43:04,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405541654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871046172] [2022-12-06 02:43:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:04,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:04,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:43:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:04,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 02:43:04,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:04,274 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 11 treesize of output 7 [2022-12-06 02:43:04,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:04,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:04,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:04,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 02:43:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:04,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:04,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871046172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:04,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:04,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 4] total 16 [2022-12-06 02:43:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775742624] [2022-12-06 02:43:04,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:04,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:43:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:43:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:43:04,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 02:43:04,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 337 transitions, 8158 flow. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 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-06 02:43:04,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:04,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 02:43:04,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:05,054 INFO L130 PetriNetUnfolder]: 1387/2084 cut-off events. [2022-12-06 02:43:05,054 INFO L131 PetriNetUnfolder]: For 8871/8975 co-relation queries the response was YES. [2022-12-06 02:43:05,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25663 conditions, 2084 events. 1387/2084 cut-off events. For 8871/8975 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9313 event pairs, 11 based on Foata normal form. 45/1648 useless extension candidates. Maximal degree in co-relation 21083. Up to 1785 conditions per place. [2022-12-06 02:43:05,069 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 398 selfloop transitions, 101 changer transitions 55/557 dead transitions. [2022-12-06 02:43:05,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 557 transitions, 14579 flow [2022-12-06 02:43:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:43:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:43:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-06 02:43:05,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2022-12-06 02:43:05,071 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 02:43:05,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:05,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 557 transitions, 14579 flow [2022-12-06 02:43:05,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 557 transitions, 14579 flow [2022-12-06 02:43:05,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 02:43:05,091 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:05,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 02:43:05,091 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 557 transitions, 14579 flow [2022-12-06 02:43:05,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 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-06 02:43:05,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:05,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:05,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:43:05,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 02:43:05,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 716842627, now seen corresponding path program 1 times [2022-12-06 02:43:05,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:05,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942156055] [2022-12-06 02:43:05,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:05,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:05,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942156055] [2022-12-06 02:43:05,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942156055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:05,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66204066] [2022-12-06 02:43:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:05,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:05,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:05,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:43:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:05,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:43:05,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:06,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:06,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:06,061 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 17 treesize of output 10 [2022-12-06 02:43:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:06,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:06,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:06,194 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 23 treesize of output 20 [2022-12-06 02:43:06,206 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:06,207 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 24 treesize of output 13 [2022-12-06 02:43:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:06,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66204066] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:06,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:06,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2022-12-06 02:43:06,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268757293] [2022-12-06 02:43:06,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:06,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:43:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:06,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:43:06,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:43:06,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:43:06,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 557 transitions, 14579 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-06 02:43:06,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:06,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:43:06,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:07,680 INFO L130 PetriNetUnfolder]: 1821/2741 cut-off events. [2022-12-06 02:43:07,681 INFO L131 PetriNetUnfolder]: For 12056/12056 co-relation queries the response was YES. [2022-12-06 02:43:07,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36635 conditions, 2741 events. 1821/2741 cut-off events. For 12056/12056 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12735 event pairs, 17 based on Foata normal form. 1/2054 useless extension candidates. Maximal degree in co-relation 30761. Up to 2430 conditions per place. [2022-12-06 02:43:07,763 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 519 selfloop transitions, 143 changer transitions 66/728 dead transitions. [2022-12-06 02:43:07,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 728 transitions, 20454 flow [2022-12-06 02:43:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:43:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:43:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 217 transitions. [2022-12-06 02:43:07,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4568421052631579 [2022-12-06 02:43:07,765 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-06 02:43:07,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:07,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 728 transitions, 20454 flow [2022-12-06 02:43:07,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 728 transitions, 20454 flow [2022-12-06 02:43:07,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:07,789 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:07,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 02:43:07,790 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 728 transitions, 20454 flow [2022-12-06 02:43:07,790 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-06 02:43:07,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:07,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:07,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:07,997 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,SelfDestructingSolverStorable12 [2022-12-06 02:43:07,997 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash -320912597, now seen corresponding path program 2 times [2022-12-06 02:43:07,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:07,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808332788] [2022-12-06 02:43:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:08,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808332788] [2022-12-06 02:43:08,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808332788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:08,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831460916] [2022-12-06 02:43:08,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:43:08,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:08,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:08,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:08,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:43:08,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:43:08,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:08,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:43:08,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:08,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:08,614 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 17 treesize of output 17 [2022-12-06 02:43:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:08,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:08,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:08,762 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 23 treesize of output 20 [2022-12-06 02:43:08,770 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:08,770 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 24 treesize of output 13 [2022-12-06 02:43:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:08,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831460916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:08,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:08,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2022-12-06 02:43:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301679265] [2022-12-06 02:43:08,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:08,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:43:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:43:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:43:08,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 02:43:08,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 728 transitions, 20454 flow. Second operand has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:08,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:08,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 02:43:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:11,090 INFO L130 PetriNetUnfolder]: 2674/4021 cut-off events. [2022-12-06 02:43:11,090 INFO L131 PetriNetUnfolder]: For 11536/11536 co-relation queries the response was YES. [2022-12-06 02:43:11,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58001 conditions, 4021 events. 2674/4021 cut-off events. For 11536/11536 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19971 event pairs, 21 based on Foata normal form. 2/3008 useless extension candidates. Maximal degree in co-relation 37338. Up to 3676 conditions per place. [2022-12-06 02:43:11,128 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 854 selfloop transitions, 285 changer transitions 85/1224 dead transitions. [2022-12-06 02:43:11,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1224 transitions, 36767 flow [2022-12-06 02:43:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:43:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:43:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 279 transitions. [2022-12-06 02:43:11,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-06 02:43:11,130 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2022-12-06 02:43:11,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:11,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 1224 transitions, 36767 flow [2022-12-06 02:43:11,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 1224 transitions, 36767 flow [2022-12-06 02:43:11,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:13,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:43:13,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2488 [2022-12-06 02:43:13,619 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 1223 transitions, 36737 flow [2022-12-06 02:43:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:13,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:13,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:13,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:13,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:13,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash 494241399, now seen corresponding path program 1 times [2022-12-06 02:43:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:13,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822026718] [2022-12-06 02:43:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:13,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:14,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:14,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822026718] [2022-12-06 02:43:14,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822026718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:14,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453799626] [2022-12-06 02:43:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:14,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:14,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:14,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:43:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:14,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 02:43:14,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:14,329 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-06 02:43:14,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:14,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:43:14,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:14,411 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 14 treesize of output 16 [2022-12-06 02:43:14,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:43:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:14,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:14,508 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_424 (Array Int Int))) (<= c_~res1~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~A~0.base) c_~A~0.offset) c_~res2~0))) (forall ((v_ArrVal_424 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ c_~res1~0 1)))) is different from false [2022-12-06 02:43:14,657 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-06 02:43:14,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453799626] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:14,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:14,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 02:43:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215829399] [2022-12-06 02:43:14,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:14,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:43:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:14,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:43:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=224, Unknown=13, NotChecked=32, Total=342 [2022-12-06 02:43:14,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:43:14,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 1223 transitions, 36737 flow. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:14,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:14,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:43:14,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:14,940 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_424 (Array Int Int))) (<= (+ .cse0 c_~res1~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~A~0.base) c_~A~0.offset) c_~res2~0))) (<= c_~res1~0 c_~res2~0) (< c_~res2~0 (+ c_~res1~0 1)) (forall ((v_ArrVal_424 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ .cse0 c_~res1~0 1))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_423))) (< (+ c_~res2~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~A~0.base) c_~A~0.offset)) (+ c_~res1~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) 1)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_423))) (<= (+ c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset)) (+ c_~res2~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-12-06 02:43:16,112 INFO L130 PetriNetUnfolder]: 3312/4957 cut-off events. [2022-12-06 02:43:16,112 INFO L131 PetriNetUnfolder]: For 16728/16728 co-relation queries the response was YES. [2022-12-06 02:43:16,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76378 conditions, 4957 events. 3312/4957 cut-off events. For 16728/16728 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25619 event pairs, 17 based on Foata normal form. 1/3667 useless extension candidates. Maximal degree in co-relation 48121. Up to 4612 conditions per place. [2022-12-06 02:43:16,150 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 1130 selfloop transitions, 247 changer transitions 97/1504 dead transitions. [2022-12-06 02:43:16,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1504 transitions, 48272 flow [2022-12-06 02:43:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:43:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:43:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 02:43:16,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5817307692307693 [2022-12-06 02:43:16,151 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2022-12-06 02:43:16,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:16,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 1504 transitions, 48272 flow [2022-12-06 02:43:16,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 1504 transitions, 48272 flow [2022-12-06 02:43:16,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:16,206 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:16,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 02:43:16,208 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 1504 transitions, 48272 flow [2022-12-06 02:43:16,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:16,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:16,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:16,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:16,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:43:16,413 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:16,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:16,414 INFO L85 PathProgramCache]: Analyzing trace with hash 378490045, now seen corresponding path program 1 times [2022-12-06 02:43:16,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:16,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483103369] [2022-12-06 02:43:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:16,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:16,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:16,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483103369] [2022-12-06 02:43:16,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483103369] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:16,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954847820] [2022-12-06 02:43:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:16,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:16,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:16,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:43:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:17,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 02:43:17,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:17,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:17,150 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 14 treesize of output 16 [2022-12-06 02:43:17,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:17,220 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 24 treesize of output 20 [2022-12-06 02:43:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:17,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:17,467 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_473 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_473) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 1)) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_473 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (<= c_~res1~0 (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_473) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-12-06 02:43:17,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:17,511 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 56 treesize of output 44 [2022-12-06 02:43:17,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-12-06 02:43:17,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:17,544 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:17,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 12 [2022-12-06 02:43:17,598 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-06 02:43:17,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954847820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:17,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:17,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2022-12-06 02:43:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702563854] [2022-12-06 02:43:17,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:17,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:43:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:43:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=231, Unknown=1, NotChecked=32, Total=342 [2022-12-06 02:43:17,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:43:17,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 1504 transitions, 48272 flow. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 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-06 02:43:17,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:17,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:43:17,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:19,479 INFO L130 PetriNetUnfolder]: 3632/5526 cut-off events. [2022-12-06 02:43:19,479 INFO L131 PetriNetUnfolder]: For 18723/18723 co-relation queries the response was YES. [2022-12-06 02:43:19,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90662 conditions, 5526 events. 3632/5526 cut-off events. For 18723/18723 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 29834 event pairs, 27 based on Foata normal form. 1/4080 useless extension candidates. Maximal degree in co-relation 58186. Up to 5173 conditions per place. [2022-12-06 02:43:19,517 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 1257 selfloop transitions, 310 changer transitions 134/1727 dead transitions. [2022-12-06 02:43:19,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 1727 transitions, 58833 flow [2022-12-06 02:43:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:43:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:43:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2022-12-06 02:43:19,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 02:43:19,519 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2022-12-06 02:43:19,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:19,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 1727 transitions, 58833 flow [2022-12-06 02:43:19,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 1727 transitions, 58833 flow [2022-12-06 02:43:19,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:19,576 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:19,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 02:43:19,576 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 1727 transitions, 58833 flow [2022-12-06 02:43:19,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 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-06 02:43:19,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:19,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:19,594 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-06 02:43:19,780 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,SelfDestructingSolverStorable15 [2022-12-06 02:43:19,783 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash 863848611, now seen corresponding path program 2 times [2022-12-06 02:43:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:19,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396627968] [2022-12-06 02:43:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:20,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:20,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396627968] [2022-12-06 02:43:20,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396627968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:20,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20697939] [2022-12-06 02:43:20,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:43:20,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:20,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:20,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:43:20,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:43:20,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:20,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 02:43:20,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:20,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:43:20,328 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 14 treesize of output 16 [2022-12-06 02:43:20,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:43:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:20,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:20,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:20,591 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 46 treesize of output 36 [2022-12-06 02:43:20,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-12-06 02:43:20,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:43:20,611 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:43:20,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:43:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:20,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20697939] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:20,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:20,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-12-06 02:43:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325425021] [2022-12-06 02:43:20,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:20,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:43:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:43:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=228, Unknown=8, NotChecked=0, Total=306 [2022-12-06 02:43:20,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:43:20,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 1727 transitions, 58833 flow. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:20,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:20,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:43:20,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:22,592 INFO L130 PetriNetUnfolder]: 3844/5875 cut-off events. [2022-12-06 02:43:22,593 INFO L131 PetriNetUnfolder]: For 24767/24767 co-relation queries the response was YES. [2022-12-06 02:43:22,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102009 conditions, 5875 events. 3844/5875 cut-off events. For 24767/24767 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32361 event pairs, 30 based on Foata normal form. 2/4327 useless extension candidates. Maximal degree in co-relation 63008. Up to 5522 conditions per place. [2022-12-06 02:43:22,638 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 1406 selfloop transitions, 233 changer transitions 153/1825 dead transitions. [2022-12-06 02:43:22,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1825 transitions, 65831 flow [2022-12-06 02:43:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:43:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:43:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-06 02:43:22,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-06 02:43:22,640 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2022-12-06 02:43:22,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:22,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 1825 transitions, 65831 flow [2022-12-06 02:43:22,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 1825 transitions, 65831 flow [2022-12-06 02:43:22,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:22,705 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:22,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 02:43:22,706 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 1825 transitions, 65831 flow [2022-12-06 02:43:22,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:22,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:22,706 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:22,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 02:43:22,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:43:22,912 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1172721472, now seen corresponding path program 3 times [2022-12-06 02:43:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:22,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448769019] [2022-12-06 02:43:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:22,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448769019] [2022-12-06 02:43:22,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448769019] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145630207] [2022-12-06 02:43:22,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:43:22,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:22,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:22,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:22,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:43:23,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:43:23,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:23,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:43:23,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:23,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:43:23,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145630207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:43:23,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:43:23,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 02:43:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054372032] [2022-12-06 02:43:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:43:23,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:43:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:23,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:43:23,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:43:23,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 02:43:23,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 1825 transitions, 65831 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:23,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:23,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 02:43:23,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:25,307 INFO L130 PetriNetUnfolder]: 4253/6644 cut-off events. [2022-12-06 02:43:25,307 INFO L131 PetriNetUnfolder]: For 36466/36466 co-relation queries the response was YES. [2022-12-06 02:43:25,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121049 conditions, 6644 events. 4253/6644 cut-off events. For 36466/36466 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 38839 event pairs, 39 based on Foata normal form. 0/5090 useless extension candidates. Maximal degree in co-relation 51290. Up to 6247 conditions per place. [2022-12-06 02:43:25,360 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 1718 selfloop transitions, 30 changer transitions 175/1982 dead transitions. [2022-12-06 02:43:25,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 1982 transitions, 75410 flow [2022-12-06 02:43:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:43:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:43:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 02:43:25,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 02:43:25,361 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2022-12-06 02:43:25,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:25,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 1982 transitions, 75410 flow [2022-12-06 02:43:25,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 1982 transitions, 75410 flow [2022-12-06 02:43:25,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:25,537 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:25,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 02:43:25,538 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 1982 transitions, 75410 flow [2022-12-06 02:43:25,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:25,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:25,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:25,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 02:43:25,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:25,743 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1322897389, now seen corresponding path program 4 times [2022-12-06 02:43:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:25,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772351954] [2022-12-06 02:43:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:25,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:25,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772351954] [2022-12-06 02:43:25,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772351954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779974388] [2022-12-06 02:43:25,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:43:25,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:25,984 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:26,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:43:26,094 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:43:26,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:26,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 02:43:26,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:26,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:43:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:26,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:26,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:26,236 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 24 treesize of output 21 [2022-12-06 02:43:26,244 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:26,244 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 23 treesize of output 12 [2022-12-06 02:43:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:26,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779974388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:26,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:26,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2022-12-06 02:43:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074294533] [2022-12-06 02:43:26,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:26,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:43:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:43:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:43:26,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:43:26,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 1982 transitions, 75410 flow. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-06 02:43:26,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:26,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:43:26,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:29,756 INFO L130 PetriNetUnfolder]: 5035/7877 cut-off events. [2022-12-06 02:43:29,756 INFO L131 PetriNetUnfolder]: For 54961/54961 co-relation queries the response was YES. [2022-12-06 02:43:29,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151470 conditions, 7877 events. 5035/7877 cut-off events. For 54961/54961 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 47724 event pairs, 33 based on Foata normal form. 4/6071 useless extension candidates. Maximal degree in co-relation 65056. Up to 7375 conditions per place. [2022-12-06 02:43:29,818 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 1935 selfloop transitions, 201 changer transitions 214/2383 dead transitions. [2022-12-06 02:43:29,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 2383 transitions, 95580 flow [2022-12-06 02:43:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:43:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:43:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-12-06 02:43:29,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5423076923076923 [2022-12-06 02:43:29,819 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2022-12-06 02:43:29,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:29,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 2383 transitions, 95580 flow [2022-12-06 02:43:29,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 2383 transitions, 95580 flow [2022-12-06 02:43:29,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:29,913 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:29,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 02:43:29,913 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 2383 transitions, 95580 flow [2022-12-06 02:43:29,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-06 02:43:29,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:29,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:29,918 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-06 02:43:30,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:30,119 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1996830951, now seen corresponding path program 5 times [2022-12-06 02:43:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:30,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984706072] [2022-12-06 02:43:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:30,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984706072] [2022-12-06 02:43:30,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984706072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:30,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260727954] [2022-12-06 02:43:30,480 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:43:30,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:30,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:30,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:30,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:43:30,569 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:43:30,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:30,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 02:43:30,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:30,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 02:43:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:30,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:30,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:30,715 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 23 treesize of output 20 [2022-12-06 02:43:30,723 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:30,724 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 24 treesize of output 13 [2022-12-06 02:43:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:30,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260727954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:30,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:30,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2022-12-06 02:43:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151813424] [2022-12-06 02:43:30,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:30,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:43:30,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:43:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:43:30,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:43:30,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 2383 transitions, 95580 flow. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:30,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:30,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:43:30,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:35,190 INFO L130 PetriNetUnfolder]: 5347/8361 cut-off events. [2022-12-06 02:43:35,190 INFO L131 PetriNetUnfolder]: For 68741/68741 co-relation queries the response was YES. [2022-12-06 02:43:35,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168774 conditions, 8361 events. 5347/8361 cut-off events. For 68741/68741 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 51227 event pairs, 42 based on Foata normal form. 4/6423 useless extension candidates. Maximal degree in co-relation 73090. Up to 7859 conditions per place. [2022-12-06 02:43:35,264 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 2073 selfloop transitions, 167 changer transitions 230/2503 dead transitions. [2022-12-06 02:43:35,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 2503 transitions, 105384 flow [2022-12-06 02:43:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:43:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:43:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-12-06 02:43:35,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48951048951048953 [2022-12-06 02:43:35,268 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2022-12-06 02:43:35,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:35,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 2503 transitions, 105384 flow [2022-12-06 02:43:35,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 2503 transitions, 105384 flow [2022-12-06 02:43:35,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:35,366 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:35,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 02:43:35,367 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 2503 transitions, 105384 flow [2022-12-06 02:43:35,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:35,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:35,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:35,373 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-06 02:43:35,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:35,571 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash -521749377, now seen corresponding path program 2 times [2022-12-06 02:43:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:35,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036133008] [2022-12-06 02:43:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:36,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036133008] [2022-12-06 02:43:36,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036133008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:36,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123179214] [2022-12-06 02:43:36,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:43:36,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:36,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:36,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:36,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:43:36,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:43:36,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:36,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:43:36,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:36,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:36,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 17 treesize of output 17 [2022-12-06 02:43:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:36,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:36,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:36,475 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 24 treesize of output 21 [2022-12-06 02:43:36,485 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:36,485 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 23 treesize of output 12 [2022-12-06 02:43:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:36,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123179214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:36,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:36,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2022-12-06 02:43:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084296779] [2022-12-06 02:43:36,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:36,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:43:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:43:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:43:36,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:43:36,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 2503 transitions, 105384 flow. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:36,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:36,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:43:36,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:41,728 INFO L130 PetriNetUnfolder]: 5527/8681 cut-off events. [2022-12-06 02:43:41,728 INFO L131 PetriNetUnfolder]: For 67649/67649 co-relation queries the response was YES. [2022-12-06 02:43:41,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184046 conditions, 8681 events. 5527/8681 cut-off events. For 67649/67649 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 53923 event pairs, 35 based on Foata normal form. 2/6665 useless extension candidates. Maximal degree in co-relation 78689. Up to 8179 conditions per place. [2022-12-06 02:43:41,808 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 2194 selfloop transitions, 181 changer transitions 253/2628 dead transitions. [2022-12-06 02:43:41,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 2628 transitions, 115866 flow [2022-12-06 02:43:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:43:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:43:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 197 transitions. [2022-12-06 02:43:41,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34440559440559443 [2022-12-06 02:43:41,809 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2022-12-06 02:43:41,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:41,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 2628 transitions, 115866 flow [2022-12-06 02:43:41,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 2628 transitions, 115866 flow [2022-12-06 02:43:41,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:41,920 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:41,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 02:43:41,921 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 2628 transitions, 115866 flow [2022-12-06 02:43:41,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:41,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:41,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:41,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:42,125 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,SelfDestructingSolverStorable20 [2022-12-06 02:43:42,125 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -192205089, now seen corresponding path program 3 times [2022-12-06 02:43:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975449708] [2022-12-06 02:43:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975449708] [2022-12-06 02:43:42,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975449708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33514025] [2022-12-06 02:43:42,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:43:42,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:42,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:42,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:42,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:43:42,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:43:42,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:42,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:43:42,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:43,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:43:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:43,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:43,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:43,096 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 24 treesize of output 21 [2022-12-06 02:43:43,115 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:43,115 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 23 treesize of output 12 [2022-12-06 02:43:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:43,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33514025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:43,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:43,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2022-12-06 02:43:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791780469] [2022-12-06 02:43:43,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:43,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:43:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:43,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:43:43,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-12-06 02:43:43,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:43:43,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 2628 transitions, 115866 flow. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:43,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:43,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:43:43,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:48,312 INFO L130 PetriNetUnfolder]: 5569/8752 cut-off events. [2022-12-06 02:43:48,313 INFO L131 PetriNetUnfolder]: For 69416/69416 co-relation queries the response was YES. [2022-12-06 02:43:48,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194334 conditions, 8752 events. 5569/8752 cut-off events. For 69416/69416 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 54498 event pairs, 46 based on Foata normal form. 2/6725 useless extension candidates. Maximal degree in co-relation 83705. Up to 8225 conditions per place. [2022-12-06 02:43:48,400 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 2190 selfloop transitions, 185 changer transitions 300/2675 dead transitions. [2022-12-06 02:43:48,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 2675 transitions, 123224 flow [2022-12-06 02:43:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:43:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:43:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 207 transitions. [2022-12-06 02:43:48,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2022-12-06 02:43:48,402 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2022-12-06 02:43:48,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:48,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 2675 transitions, 123224 flow [2022-12-06 02:43:48,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 2675 transitions, 123224 flow [2022-12-06 02:43:48,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:48,713 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:48,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-06 02:43:48,714 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 2675 transitions, 123224 flow [2022-12-06 02:43:48,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:48,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:48,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:48,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:48,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 02:43:48,915 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1575289425, now seen corresponding path program 4 times [2022-12-06 02:43:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:48,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117848778] [2022-12-06 02:43:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:49,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117848778] [2022-12-06 02:43:49,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117848778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:49,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776552480] [2022-12-06 02:43:49,353 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:43:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:49,355 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:43:49,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:43:49,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:49,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:43:49,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:49,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:49,581 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 17 treesize of output 17 [2022-12-06 02:43:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:49,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:49,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:49,778 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 24 treesize of output 21 [2022-12-06 02:43:49,788 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:49,788 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 23 treesize of output 12 [2022-12-06 02:43:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:49,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776552480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:49,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:49,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-12-06 02:43:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874050249] [2022-12-06 02:43:49,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:49,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:43:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:49,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:43:49,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-12-06 02:43:49,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:43:49,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 2675 transitions, 123224 flow. Second operand has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:49,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:49,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:43:49,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:56,348 INFO L130 PetriNetUnfolder]: 5895/9357 cut-off events. [2022-12-06 02:43:56,349 INFO L131 PetriNetUnfolder]: For 70251/70251 co-relation queries the response was YES. [2022-12-06 02:43:56,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217607 conditions, 9357 events. 5895/9357 cut-off events. For 70251/70251 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 59851 event pairs, 36 based on Foata normal form. 2/7182 useless extension candidates. Maximal degree in co-relation 92867. Up to 8830 conditions per place. [2022-12-06 02:43:56,436 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 2360 selfloop transitions, 261 changer transitions 336/2957 dead transitions. [2022-12-06 02:43:56,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 2957 transitions, 142299 flow [2022-12-06 02:43:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:43:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:43:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 264 transitions. [2022-12-06 02:43:56,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35013262599469497 [2022-12-06 02:43:56,437 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2022-12-06 02:43:56,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:56,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 2957 transitions, 142299 flow [2022-12-06 02:43:56,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 2957 transitions, 142299 flow [2022-12-06 02:43:56,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:56,560 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:56,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 02:43:56,560 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 2957 transitions, 142299 flow [2022-12-06 02:43:56,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:56,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:56,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:56,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:56,761 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,SelfDestructingSolverStorable22 [2022-12-06 02:43:56,761 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:43:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1952513867, now seen corresponding path program 5 times [2022-12-06 02:43:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:56,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500344945] [2022-12-06 02:43:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:57,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500344945] [2022-12-06 02:43:57,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500344945] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:57,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285104390] [2022-12-06 02:43:57,094 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:43:57,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:57,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:57,095 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:57,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 02:43:57,210 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:43:57,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:57,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:43:57,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:57,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:43:57,324 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 17 treesize of output 17 [2022-12-06 02:43:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:57,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:57,534 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:57,535 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 24 treesize of output 13 [2022-12-06 02:43:57,541 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:43:57,541 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 23 treesize of output 12 [2022-12-06 02:43:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:57,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285104390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:57,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:57,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 16 [2022-12-06 02:43:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212042045] [2022-12-06 02:43:57,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:57,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:43:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:43:57,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:43:57,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:43:57,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 2957 transitions, 142299 flow. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:57,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:57,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:43:57,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:08,514 INFO L130 PetriNetUnfolder]: 8376/13710 cut-off events. [2022-12-06 02:44:08,514 INFO L131 PetriNetUnfolder]: For 77984/77984 co-relation queries the response was YES. [2022-12-06 02:44:08,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332379 conditions, 13710 events. 8376/13710 cut-off events. For 77984/77984 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 97866 event pairs, 40 based on Foata normal form. 6/10564 useless extension candidates. Maximal degree in co-relation 137666. Up to 12912 conditions per place. [2022-12-06 02:44:08,699 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 3349 selfloop transitions, 948 changer transitions 703/5000 dead transitions. [2022-12-06 02:44:08,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 5000 transitions, 250987 flow [2022-12-06 02:44:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:44:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:44:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 274 transitions. [2022-12-06 02:44:08,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35128205128205126 [2022-12-06 02:44:08,700 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2022-12-06 02:44:08,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:08,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 5000 transitions, 250987 flow [2022-12-06 02:44:08,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 5000 transitions, 250987 flow [2022-12-06 02:44:08,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:08,954 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:08,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-06 02:44:08,955 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 5000 transitions, 250987 flow [2022-12-06 02:44:08,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:08,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:08,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:08,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:09,157 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,SelfDestructingSolverStorable23 [2022-12-06 02:44:09,157 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash -571318909, now seen corresponding path program 6 times [2022-12-06 02:44:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:09,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777558355] [2022-12-06 02:44:09,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:09,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:09,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777558355] [2022-12-06 02:44:09,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777558355] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:09,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333872097] [2022-12-06 02:44:09,575 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:44:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:09,577 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:44:09,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 02:44:09,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:44:09,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:09,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:44:09,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:09,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:44:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:09,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:10,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:10,075 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 24 treesize of output 21 [2022-12-06 02:44:10,084 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:44:10,084 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 23 treesize of output 12 [2022-12-06 02:44:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:10,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333872097] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:10,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:10,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2022-12-06 02:44:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427272353] [2022-12-06 02:44:10,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:10,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:44:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:44:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-12-06 02:44:10,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:44:10,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 5000 transitions, 250987 flow. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:10,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:10,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:44:10,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:30,578 INFO L130 PetriNetUnfolder]: 8418/13814 cut-off events. [2022-12-06 02:44:30,578 INFO L131 PetriNetUnfolder]: For 75961/75961 co-relation queries the response was YES. [2022-12-06 02:44:30,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348814 conditions, 13814 events. 8418/13814 cut-off events. For 75961/75961 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 99175 event pairs, 41 based on Foata normal form. 4/10644 useless extension candidates. Maximal degree in co-relation 144107. Up to 13016 conditions per place. [2022-12-06 02:44:30,715 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 4058 selfloop transitions, 257 changer transitions 752/5067 dead transitions. [2022-12-06 02:44:30,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 5067 transitions, 264531 flow [2022-12-06 02:44:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:44:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:44:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 230 transitions. [2022-12-06 02:44:30,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35384615384615387 [2022-12-06 02:44:30,717 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2022-12-06 02:44:30,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:30,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 5067 transitions, 264531 flow [2022-12-06 02:44:30,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 5067 transitions, 264531 flow [2022-12-06 02:44:30,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:30,959 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:30,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 02:44:30,960 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 5067 transitions, 264531 flow [2022-12-06 02:44:30,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:30,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:30,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:30,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:31,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:31,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2022625201, now seen corresponding path program 7 times [2022-12-06 02:44:31,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:31,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328912985] [2022-12-06 02:44:31,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:31,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:31,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:31,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328912985] [2022-12-06 02:44:31,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328912985] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:31,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977744830] [2022-12-06 02:44:31,563 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:44:31,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:31,583 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:44:31,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 02:44:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:31,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 02:44:31,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:31,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:31,791 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 17 treesize of output 17 [2022-12-06 02:44:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:31,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:31,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:31,910 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 24 treesize of output 21 [2022-12-06 02:44:31,920 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:44:31,920 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 23 treesize of output 12 [2022-12-06 02:44:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:32,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977744830] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:32,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:32,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 14 [2022-12-06 02:44:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94916367] [2022-12-06 02:44:32,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:32,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:44:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:44:32,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:44:32,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:44:32,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 5067 transitions, 264531 flow. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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-06 02:44:32,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:32,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:44:32,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:54,511 INFO L130 PetriNetUnfolder]: 8520/14016 cut-off events. [2022-12-06 02:44:54,511 INFO L131 PetriNetUnfolder]: For 83064/83064 co-relation queries the response was YES. [2022-12-06 02:44:54,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367542 conditions, 14016 events. 8520/14016 cut-off events. For 83064/83064 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 101216 event pairs, 37 based on Foata normal form. 2/10832 useless extension candidates. Maximal degree in co-relation 152166. Up to 13164 conditions per place. [2022-12-06 02:44:54,854 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 3753 selfloop transitions, 562 changer transitions 803/5167 dead transitions. [2022-12-06 02:44:54,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 5167 transitions, 280000 flow [2022-12-06 02:44:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:44:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:44:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-12-06 02:44:54,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40532544378698226 [2022-12-06 02:44:54,856 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 281 predicate places. [2022-12-06 02:44:54,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:54,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 5167 transitions, 280000 flow [2022-12-06 02:44:55,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 5167 transitions, 280000 flow [2022-12-06 02:44:55,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:55,100 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:55,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 02:44:55,100 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 5167 transitions, 280000 flow [2022-12-06 02:44:55,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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-06 02:44:55,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:55,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:55,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:55,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 02:44:55,301 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:44:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1622969579, now seen corresponding path program 8 times [2022-12-06 02:44:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:55,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737917741] [2022-12-06 02:44:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:55,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737917741] [2022-12-06 02:44:55,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737917741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:55,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478628987] [2022-12-06 02:44:55,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:44:55,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:55,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:55,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:44:55,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 02:44:55,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:44:55,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:55,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:44:55,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:55,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:44:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:56,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:56,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:44:56,073 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 24 treesize of output 21 [2022-12-06 02:44:56,082 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:44:56,082 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 23 treesize of output 12 [2022-12-06 02:44:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:56,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478628987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:56,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:56,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-12-06 02:44:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755976863] [2022-12-06 02:44:56,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:56,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:44:56,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:56,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:44:56,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-12-06 02:44:56,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:44:56,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 5167 transitions, 280000 flow. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:56,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:56,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:44:56,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:21,991 INFO L130 PetriNetUnfolder]: 8520/14012 cut-off events. [2022-12-06 02:45:21,991 INFO L131 PetriNetUnfolder]: For 83387/83387 co-relation queries the response was YES. [2022-12-06 02:45:22,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381447 conditions, 14012 events. 8520/14012 cut-off events. For 83387/83387 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 101179 event pairs, 37 based on Foata normal form. 4/10830 useless extension candidates. Maximal degree in co-relation 157973. Up to 13160 conditions per place. [2022-12-06 02:45:22,136 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 4136 selfloop transitions, 185 changer transitions 845/5166 dead transitions. [2022-12-06 02:45:22,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 5166 transitions, 290236 flow [2022-12-06 02:45:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:45:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:45:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 160 transitions. [2022-12-06 02:45:22,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3418803418803419 [2022-12-06 02:45:22,138 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 295 predicate places. [2022-12-06 02:45:22,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:22,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 325 places, 5166 transitions, 290236 flow [2022-12-06 02:45:22,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 5166 transitions, 290236 flow [2022-12-06 02:45:22,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:22,400 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:22,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-06 02:45:22,400 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 5166 transitions, 290236 flow [2022-12-06 02:45:22,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:22,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:22,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:22,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 02:45:22,601 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,SelfDestructingSolverStorable26 [2022-12-06 02:45:22,601 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash 374830337, now seen corresponding path program 6 times [2022-12-06 02:45:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:22,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432395796] [2022-12-06 02:45:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:22,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:22,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432395796] [2022-12-06 02:45:22,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432395796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:22,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397946573] [2022-12-06 02:45:22,940 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:45:22,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:22,942 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:45:22,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 02:45:23,055 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:45:23,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:45:23,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 02:45:23,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:23,070 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-06 02:45:23,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:45:23,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:45:23,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:23,169 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 14 treesize of output 16 [2022-12-06 02:45:23,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:45:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:23,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:23,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1057 (Array Int Int))) (<= c_~res2~0 (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_1057 (Array Int Int))) (< (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) .cse0)) (+ c_~res2~0 1))))) is different from false [2022-12-06 02:45:23,251 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))) (.cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1057 (Array Int Int))) (< (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) .cse0)) (+ c_~res2~0 .cse1 1))) (forall ((v_ArrVal_1057 (Array Int Int))) (<= (+ c_~res2~0 .cse1) (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) .cse0)))))) is different from false [2022-12-06 02:45:23,257 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_1057 (Array Int Int))) (<= (+ .cse0 c_~res2~0) (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) .cse1)))) (forall ((v_ArrVal_1057 (Array Int Int))) (< (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) .cse1)) (+ .cse0 c_~res2~0 1))))) is different from false [2022-12-06 02:45:23,288 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1056))) (<= (+ c_~res2~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (+ c_~res1~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1056))) (< (+ c_~res1~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) c_~A~0.offset)) (+ c_~res2~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) 1))))) is different from false [2022-12-06 02:45:23,293 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-06 02:45:23,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397946573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:23,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:23,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 02:45:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086522985] [2022-12-06 02:45:23,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:23,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:45:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:45:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=174, Unknown=7, NotChecked=124, Total=380 [2022-12-06 02:45:23,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:45:23,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 5166 transitions, 290236 flow. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:23,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:23,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:45:23,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:23,913 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (<= c_~res2~0 c_~res1~0) (forall ((v_ArrVal_1057 (Array Int Int))) (<= (+ .cse0 c_~res2~0) (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) c_~A~0.offset)))) (< c_~res1~0 (+ c_~res2~0 1)) (forall ((v_ArrVal_1057 (Array Int Int))) (< (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1057) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~res2~0 1))))) is different from false [2022-12-06 02:45:48,671 INFO L130 PetriNetUnfolder]: 8983/14791 cut-off events. [2022-12-06 02:45:48,672 INFO L131 PetriNetUnfolder]: For 106376/106376 co-relation queries the response was YES. [2022-12-06 02:45:48,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416540 conditions, 14791 events. 8983/14791 cut-off events. For 106376/106376 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 107952 event pairs, 42 based on Foata normal form. 3/11440 useless extension candidates. Maximal degree in co-relation 179941. Up to 13833 conditions per place. [2022-12-06 02:45:48,836 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 4163 selfloop transitions, 278 changer transitions 953/5461 dead transitions. [2022-12-06 02:45:48,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 5461 transitions, 317734 flow [2022-12-06 02:45:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:45:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:45:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2022-12-06 02:45:48,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2022-12-06 02:45:48,838 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 303 predicate places. [2022-12-06 02:45:48,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:48,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 333 places, 5461 transitions, 317734 flow [2022-12-06 02:45:49,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 333 places, 5461 transitions, 317734 flow [2022-12-06 02:45:49,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:49,118 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:49,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-06 02:45:49,119 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 5461 transitions, 317734 flow [2022-12-06 02:45:49,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:49,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:49,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:49,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 02:45:49,323 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,SelfDestructingSolverStorable27 [2022-12-06 02:45:49,324 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:45:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1870516325, now seen corresponding path program 7 times [2022-12-06 02:45:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:49,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795619293] [2022-12-06 02:45:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:49,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795619293] [2022-12-06 02:45:49,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795619293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:49,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618760849] [2022-12-06 02:45:49,651 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:45:49,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:49,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:49,652 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:45:49,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 02:45:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:49,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 02:45:49,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:49,772 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-06 02:45:49,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:45:49,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:45:49,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:45:49,888 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 14 treesize of output 16 [2022-12-06 02:45:49,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:45:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:49,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:50,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))))) (and (forall ((v_ArrVal_1110 (Array Int Int))) (<= (+ c_~res2~0 .cse0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) .cse1) c_~res1~0))) (forall ((v_ArrVal_1110 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) .cse1) c_~res1~0) (+ c_~res2~0 .cse0 1))))) is different from false [2022-12-06 02:45:50,018 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1110 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) .cse0) c_~res1~0) (+ .cse1 c_~res2~0 1))) (forall ((v_ArrVal_1110 (Array Int Int))) (<= (+ .cse1 c_~res2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) .cse0) c_~res1~0))))) is different from false [2022-12-06 02:45:50,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_1110 (Array Int Int))) (<= (+ .cse0 c_~res2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) c_~A~0.offset) c_~res1~0))) (forall ((v_ArrVal_1110 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ .cse0 c_~res2~0 1))))) is different from false [2022-12-06 02:45:50,035 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1109))) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res2~0 1)))) (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1109))) (<= (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1110) c_~A~0.base) c_~A~0.offset) c_~res1~0))))) is different from false [2022-12-06 02:45:50,040 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-06 02:45:50,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618760849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:50,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:50,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2022-12-06 02:45:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514868651] [2022-12-06 02:45:50,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:50,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:45:50,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:45:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=156, Unknown=6, NotChecked=116, Total=342 [2022-12-06 02:45:50,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:45:50,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 5461 transitions, 317734 flow. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-06 02:45:50,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:50,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:45:50,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:14,008 INFO L130 PetriNetUnfolder]: 9023/14886 cut-off events. [2022-12-06 02:46:14,008 INFO L131 PetriNetUnfolder]: For 118507/118507 co-relation queries the response was YES. [2022-12-06 02:46:14,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433130 conditions, 14886 events. 9023/14886 cut-off events. For 118507/118507 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 109119 event pairs, 48 based on Foata normal form. 3/11521 useless extension candidates. Maximal degree in co-relation 187811. Up to 13928 conditions per place. [2022-12-06 02:46:14,212 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 4209 selfloop transitions, 257 changer transitions 977/5510 dead transitions. [2022-12-06 02:46:14,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 5510 transitions, 331499 flow [2022-12-06 02:46:14,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:46:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:46:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 02:46:14,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2022-12-06 02:46:14,215 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 310 predicate places. [2022-12-06 02:46:14,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:14,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 5510 transitions, 331499 flow [2022-12-06 02:46:14,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 5510 transitions, 331499 flow [2022-12-06 02:46:14,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:14,503 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:14,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-06 02:46:14,504 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 5510 transitions, 331499 flow [2022-12-06 02:46:14,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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-06 02:46:14,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:14,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:14,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 02:46:14,708 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,SelfDestructingSolverStorable28 [2022-12-06 02:46:14,709 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1891652411, now seen corresponding path program 8 times [2022-12-06 02:46:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:14,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409938479] [2022-12-06 02:46:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409938479] [2022-12-06 02:46:14,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409938479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392636679] [2022-12-06 02:46:14,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:46:14,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:14,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:14,947 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:46:14,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 02:46:15,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:46:15,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:46:15,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 02:46:15,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:15,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:46:15,149 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 14 treesize of output 16 [2022-12-06 02:46:15,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:46:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:15,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:15,237 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))) (and (forall ((v_ArrVal_1159 (Array Int Int))) (< (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1159) c_~A~0.base) .cse0)) (+ c_~res1~0 1))) (forall ((v_ArrVal_1159 (Array Int Int))) (<= c_~res1~0 (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1159) c_~A~0.base) .cse0)))))) is different from false [2022-12-06 02:46:15,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:46:15,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 54 treesize of output 42 [2022-12-06 02:46:15,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-12-06 02:46:15,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:15,278 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:46:15,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2022-12-06 02:46:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:15,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392636679] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:15,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:15,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 02:46:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183100202] [2022-12-06 02:46:15,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:15,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:46:15,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:46:15,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=171, Unknown=1, NotChecked=28, Total=272 [2022-12-06 02:46:15,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:46:15,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 5510 transitions, 331499 flow. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:15,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:15,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:46:15,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:44,745 INFO L130 PetriNetUnfolder]: 9299/15346 cut-off events. [2022-12-06 02:46:44,745 INFO L131 PetriNetUnfolder]: For 141296/141296 co-relation queries the response was YES. [2022-12-06 02:46:44,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460838 conditions, 15346 events. 9299/15346 cut-off events. For 141296/141296 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 113096 event pairs, 42 based on Foata normal form. 4/11882 useless extension candidates. Maximal degree in co-relation 209656. Up to 14388 conditions per place. [2022-12-06 02:46:44,926 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 4383 selfloop transitions, 213 changer transitions 993/5656 dead transitions. [2022-12-06 02:46:44,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 5656 transitions, 351549 flow [2022-12-06 02:46:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:46:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:46:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 02:46:44,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2022-12-06 02:46:44,928 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 317 predicate places. [2022-12-06 02:46:44,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:44,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 347 places, 5656 transitions, 351549 flow [2022-12-06 02:46:45,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 347 places, 5656 transitions, 351549 flow [2022-12-06 02:46:45,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:45,303 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:45,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 376 [2022-12-06 02:46:45,304 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 5656 transitions, 351549 flow [2022-12-06 02:46:45,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:45,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:45,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:45,310 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-06 02:46:45,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:45,510 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:46:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash -174895631, now seen corresponding path program 9 times [2022-12-06 02:46:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:45,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178019207] [2022-12-06 02:46:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:45,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178019207] [2022-12-06 02:46:45,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178019207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:45,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622826867] [2022-12-06 02:46:45,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:46:45,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:45,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:45,943 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:46:45,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 02:46:46,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:46:46,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:46:46,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:46:46,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:46,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:46:46,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:46:46,238 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 17 treesize of output 10 [2022-12-06 02:46:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:46,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:46,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:46:46,313 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 20 treesize of output 19 [2022-12-06 02:46:46,321 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:46:46,321 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 19 treesize of output 12 [2022-12-06 02:46:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:46,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622826867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:46,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:46,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-12-06 02:46:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001622465] [2022-12-06 02:46:46,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:46,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:46:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:46:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:46:46,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:46:46,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 5656 transitions, 351549 flow. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:46,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:46,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:46:46,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:47:22,046 INFO L130 PetriNetUnfolder]: 9763/16124 cut-off events. [2022-12-06 02:47:22,046 INFO L131 PetriNetUnfolder]: For 148971/148971 co-relation queries the response was YES. [2022-12-06 02:47:22,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500258 conditions, 16124 events. 9763/16124 cut-off events. For 148971/148971 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 119885 event pairs, 37 based on Foata normal form. 7/12486 useless extension candidates. Maximal degree in co-relation 236385. Up to 15124 conditions per place. [2022-12-06 02:47:22,368 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 4586 selfloop transitions, 298 changer transitions 1087/5971 dead transitions. [2022-12-06 02:47:22,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 5971 transitions, 382760 flow [2022-12-06 02:47:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:47:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:47:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 207 transitions. [2022-12-06 02:47:22,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31846153846153846 [2022-12-06 02:47:22,370 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 341 predicate places. [2022-12-06 02:47:22,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:47:22,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 5971 transitions, 382760 flow [2022-12-06 02:47:22,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 5971 transitions, 382760 flow [2022-12-06 02:47:22,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:47:22,692 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:47:22,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 322 [2022-12-06 02:47:22,692 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 5971 transitions, 382760 flow [2022-12-06 02:47:22,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:47:22,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:47:22,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:47:22,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 02:47:22,897 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,SelfDestructingSolverStorable30 [2022-12-06 02:47:22,897 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:47:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:47:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash -760427231, now seen corresponding path program 9 times [2022-12-06 02:47:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:47:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701538183] [2022-12-06 02:47:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:47:22,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:47:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:47:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:47:23,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:47:23,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701538183] [2022-12-06 02:47:23,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701538183] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:47:23,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346506463] [2022-12-06 02:47:23,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:47:23,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:23,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:47:23,058 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:47:23,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 02:47:23,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:47:23,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:47:23,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 02:47:23,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:47:23,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:47:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:47:23,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:47:23,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:47:23,275 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 24 treesize of output 21 [2022-12-06 02:47:23,286 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:47:23,286 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 23 treesize of output 12 [2022-12-06 02:47:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:47:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346506463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:47:23,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:47:23,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2022-12-06 02:47:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627060018] [2022-12-06 02:47:23,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:47:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:47:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:47:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:47:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:47:23,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:47:23,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 5971 transitions, 382760 flow. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-06 02:47:23,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:47:23,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:47:23,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:48:07,085 INFO L130 PetriNetUnfolder]: 10103/16688 cut-off events. [2022-12-06 02:48:07,086 INFO L131 PetriNetUnfolder]: For 175123/175123 co-relation queries the response was YES. [2022-12-06 02:48:07,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533426 conditions, 16688 events. 10103/16688 cut-off events. For 175123/175123 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 124622 event pairs, 37 based on Foata normal form. 8/12891 useless extension candidates. Maximal degree in co-relation 251073. Up to 15688 conditions per place. [2022-12-06 02:48:07,470 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 4652 selfloop transitions, 278 changer transitions 1117/6119 dead transitions. [2022-12-06 02:48:07,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 6119 transitions, 404438 flow [2022-12-06 02:48:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:48:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:48:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-06 02:48:07,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5346153846153846 [2022-12-06 02:48:07,472 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 350 predicate places. [2022-12-06 02:48:07,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:48:07,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 380 places, 6119 transitions, 404438 flow [2022-12-06 02:48:07,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 380 places, 6119 transitions, 404438 flow [2022-12-06 02:48:07,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:48:07,856 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:48:07,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-06 02:48:07,856 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 6119 transitions, 404438 flow [2022-12-06 02:48:07,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-06 02:48:07,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:48:07,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:48:07,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 02:48:08,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:08,058 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:48:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:48:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash -124725229, now seen corresponding path program 10 times [2022-12-06 02:48:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:48:08,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199230926] [2022-12-06 02:48:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:48:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:48:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:48:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:48:08,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199230926] [2022-12-06 02:48:08,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199230926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:48:08,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779237878] [2022-12-06 02:48:08,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:48:08,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:48:08,332 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:48:08,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 02:48:08,454 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:48:08,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:48:08,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 02:48:08,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:48:08,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:48:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:08,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:48:08,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:48:08,561 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 24 treesize of output 21 [2022-12-06 02:48:08,578 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:48:08,578 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 23 treesize of output 12 [2022-12-06 02:48:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779237878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:48:08,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:48:08,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 10 [2022-12-06 02:48:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393822761] [2022-12-06 02:48:08,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:48:08,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:48:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:48:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:48:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:48:08,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:48:08,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 6119 transitions, 404438 flow. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 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-06 02:48:08,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:48:08,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:48:08,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:48:54,124 INFO L130 PetriNetUnfolder]: 10471/17274 cut-off events. [2022-12-06 02:48:54,124 INFO L131 PetriNetUnfolder]: For 202791/202791 co-relation queries the response was YES. [2022-12-06 02:48:54,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568314 conditions, 17274 events. 10471/17274 cut-off events. For 202791/202791 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 129515 event pairs, 52 based on Foata normal form. 6/13311 useless extension candidates. Maximal degree in co-relation 254349. Up to 16274 conditions per place. [2022-12-06 02:48:54,495 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 4860 selfloop transitions, 202 changer transitions 1143/6277 dead transitions. [2022-12-06 02:48:54,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 6277 transitions, 427373 flow [2022-12-06 02:48:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:48:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:48:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-12-06 02:48:54,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 02:48:54,497 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 359 predicate places. [2022-12-06 02:48:54,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:48:54,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 6277 transitions, 427373 flow [2022-12-06 02:48:54,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 6277 transitions, 427373 flow [2022-12-06 02:48:54,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:48:54,875 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:48:54,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 379 [2022-12-06 02:48:54,876 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 6277 transitions, 427373 flow [2022-12-06 02:48:54,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 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-06 02:48:54,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:48:54,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:48:54,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 02:48:55,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:55,086 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:48:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:48:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash -190636377, now seen corresponding path program 11 times [2022-12-06 02:48:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:48:55,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121107198] [2022-12-06 02:48:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:48:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:48:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:48:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:48:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121107198] [2022-12-06 02:48:55,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121107198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:48:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092281456] [2022-12-06 02:48:55,390 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:48:55,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:55,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:48:55,391 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:48:55,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 02:48:55,506 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:48:55,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:48:55,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 02:48:55,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:48:55,529 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-06 02:48:55,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:48:55,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:48:55,627 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 14 treesize of output 16 [2022-12-06 02:48:55,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:48:55,659 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 14 treesize of output 16 [2022-12-06 02:48:55,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:48:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:55,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:48:55,837 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1356) c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ c_~res1~0 1))) (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (<= c_~res1~0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1356) c_~A~0.base) c_~A~0.offset) c_~res2~0)))) is different from false [2022-12-06 02:48:55,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (and (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (<= (+ .cse0 c_~res1~0) (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1356) c_~A~0.base) c_~A~0.offset) c_~res2~0))) (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1356) c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ .cse0 c_~res1~0 1))))) is different from false [2022-12-06 02:48:55,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (<= (+ .cse0 c_~res1~0) (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1356) c_~A~0.base) c_~A~0.offset) c_~res2~0))) (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1356) c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ .cse0 c_~res1~0 1))))) is different from false [2022-12-06 02:48:55,861 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-06 02:48:55,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092281456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:48:55,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:48:55,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-12-06 02:48:55,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135067489] [2022-12-06 02:48:55,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:48:55,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:48:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:48:55,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:48:55,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=158, Unknown=7, NotChecked=84, Total=306 [2022-12-06 02:48:55,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:48:55,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 6277 transitions, 427373 flow. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 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-06 02:48:55,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:48:55,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:48:55,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:49:44,083 INFO L130 PetriNetUnfolder]: 10631/17546 cut-off events. [2022-12-06 02:49:44,084 INFO L131 PetriNetUnfolder]: For 231351/231351 co-relation queries the response was YES. [2022-12-06 02:49:44,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593664 conditions, 17546 events. 10631/17546 cut-off events. For 231351/231351 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 131765 event pairs, 30 based on Foata normal form. 4/13511 useless extension candidates. Maximal degree in co-relation 273405. Up to 16546 conditions per place. [2022-12-06 02:49:44,339 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 4775 selfloop transitions, 400 changer transitions 1159/6406 dead transitions. [2022-12-06 02:49:44,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 6406 transitions, 448817 flow [2022-12-06 02:49:44,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:49:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:49:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-12-06 02:49:44,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5879120879120879 [2022-12-06 02:49:44,341 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 365 predicate places. [2022-12-06 02:49:44,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:49:44,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 395 places, 6406 transitions, 448817 flow [2022-12-06 02:49:44,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 395 places, 6406 transitions, 448817 flow [2022-12-06 02:49:44,739 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:49:44,748 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:49:44,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 408 [2022-12-06 02:49:44,749 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 6406 transitions, 448817 flow [2022-12-06 02:49:44,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 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-06 02:49:44,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:49:44,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:49:44,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 02:49:44,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:49:44,954 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:49:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:49:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1785758993, now seen corresponding path program 10 times [2022-12-06 02:49:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:49:44,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377729998] [2022-12-06 02:49:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:49:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:49:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:49:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:49:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:49:45,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377729998] [2022-12-06 02:49:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377729998] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:49:45,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408719912] [2022-12-06 02:49:45,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:49:45,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:49:45,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:49:45,320 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:49:45,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 02:49:45,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:49:45,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:49:45,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:49:45,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:49:45,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:49:45,736 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 17 treesize of output 17 [2022-12-06 02:49:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:49:45,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:49:45,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:49:45,879 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 20 treesize of output 19 [2022-12-06 02:49:45,889 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:49:45,889 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 19 treesize of output 12 [2022-12-06 02:49:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:49:46,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408719912] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:49:46,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:49:46,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2022-12-06 02:49:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125573331] [2022-12-06 02:49:46,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:49:46,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:49:46,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:49:46,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:49:46,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:49:46,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:49:46,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 6406 transitions, 448817 flow. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:49:46,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:49:46,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:49:46,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:36,486 INFO L130 PetriNetUnfolder]: 11060/18241 cut-off events. [2022-12-06 02:50:36,487 INFO L131 PetriNetUnfolder]: For 235301/235301 co-relation queries the response was YES. [2022-12-06 02:50:36,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635551 conditions, 18241 events. 11060/18241 cut-off events. For 235301/235301 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 137727 event pairs, 30 based on Foata normal form. 2/14042 useless extension candidates. Maximal degree in co-relation 293500. Up to 17205 conditions per place. [2022-12-06 02:50:36,790 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 5098 selfloop transitions, 456 changer transitions 1198/6752 dead transitions. [2022-12-06 02:50:36,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 6752 transitions, 486223 flow [2022-12-06 02:50:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 02:50:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 02:50:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 239 transitions. [2022-12-06 02:50:36,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3282967032967033 [2022-12-06 02:50:36,791 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 392 predicate places. [2022-12-06 02:50:36,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:36,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 422 places, 6752 transitions, 486223 flow [2022-12-06 02:50:37,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 422 places, 6752 transitions, 486223 flow [2022-12-06 02:50:37,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:37,262 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:37,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 470 [2022-12-06 02:50:37,263 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 6752 transitions, 486223 flow [2022-12-06 02:50:37,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:37,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:37,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:37,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 02:50:37,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:37,466 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:50:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1920091723, now seen corresponding path program 11 times [2022-12-06 02:50:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:37,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850760869] [2022-12-06 02:50:37,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:37,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850760869] [2022-12-06 02:50:37,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850760869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:50:37,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271553091] [2022-12-06 02:50:37,911 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:50:37,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:50:37,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:50:37,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 02:50:38,026 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:50:38,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:50:38,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 02:50:38,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:50:38,049 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-06 02:50:38,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:50:38,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:50:38,133 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 14 treesize of output 16 [2022-12-06 02:50:38,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:50:38,168 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 14 treesize of output 16 [2022-12-06 02:50:38,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:50:38,244 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 17 treesize of output 17 [2022-12-06 02:50:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:38,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:50:38,469 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1457 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (<= c_~res1~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1457) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)) (< (+ ~M~0 1) c_~N~0))) (forall ((v_ArrVal_1457 (Array Int Int)) (~M~0 Int)) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1457) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 1)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-12-06 02:50:40,498 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (<= c_~res1~0 (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1457) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (< (+ ~M~0 1) c_~N~0))) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (< (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1457) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 1)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-12-06 02:50:40,652 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-06 02:50:40,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271553091] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:50:40,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:50:40,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 21 [2022-12-06 02:50:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543328070] [2022-12-06 02:50:40,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:50:40,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:50:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:40,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:50:40,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=347, Unknown=5, NotChecked=78, Total=506 [2022-12-06 02:50:40,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:50:40,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 6752 transitions, 486223 flow. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:40,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:40,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:50:40,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:44,767 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (and (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (<= (+ .cse0 c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1457) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (< (+ ~M~0 1) c_~N~0))) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (< (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1457) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ .cse0 c_~res1~0 1)) (< (+ ~M~0 1) c_~N~0)))))) (<= c_~N~0 1) (< 0 c_~N~0) (or (and (<= |c_thread3Thread1of1ForFork2_~i~2#1| c_~N~0) (= c_~res2~0 c_~res1~0)) (<= |c_thread3Thread1of1ForFork2_~i~2#1| 0))) is different from false [2022-12-06 02:51:47,563 INFO L130 PetriNetUnfolder]: 12581/20833 cut-off events. [2022-12-06 02:51:47,563 INFO L131 PetriNetUnfolder]: For 300149/300149 co-relation queries the response was YES. [2022-12-06 02:51:47,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745961 conditions, 20833 events. 12581/20833 cut-off events. For 300149/300149 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 161516 event pairs, 31 based on Foata normal form. 3/15952 useless extension candidates. Maximal degree in co-relation 340317. Up to 19797 conditions per place. [2022-12-06 02:51:47,924 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 4801 selfloop transitions, 1657 changer transitions 1381/7839 dead transitions. [2022-12-06 02:51:47,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 7839 transitions, 579502 flow [2022-12-06 02:51:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:51:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:51:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 314 transitions. [2022-12-06 02:51:47,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4025641025641026 [2022-12-06 02:51:47,928 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 421 predicate places. [2022-12-06 02:51:47,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:51:47,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 451 places, 7839 transitions, 579502 flow [2022-12-06 02:51:48,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 451 places, 7839 transitions, 579502 flow [2022-12-06 02:51:48,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:51:48,631 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:51:48,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 706 [2022-12-06 02:51:48,634 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 7839 transitions, 579502 flow [2022-12-06 02:51:48,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:51:48,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:51:48,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:51:48,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 02:51:48,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 02:51:48,839 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:51:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:51:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 192930537, now seen corresponding path program 12 times [2022-12-06 02:51:48,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:51:48,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090843339] [2022-12-06 02:51:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:51:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:51:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:51:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:51:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:51:49,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090843339] [2022-12-06 02:51:49,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090843339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:51:49,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187419556] [2022-12-06 02:51:49,378 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:51:49,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:51:49,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:51:49,380 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:51:49,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 02:51:49,509 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:51:49,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:51:49,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-06 02:51:49,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:51:49,525 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-06 02:51:49,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:51:49,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:51:49,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:51:49,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:51:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:51:49,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:51:51,621 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1510) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0 1))) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1510) c_~A~0.base))) (<= (+ (select .cse1 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse1 c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-12-06 02:51:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:51:51,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187419556] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:51:51,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:51:51,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 22 [2022-12-06 02:51:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805237648] [2022-12-06 02:51:51,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:51:51,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:51:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:51:51,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:51:51,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=406, Unknown=7, NotChecked=42, Total=552 [2022-12-06 02:51:51,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:51:51,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 7839 transitions, 579502 flow. Second operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:51:51,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:51:51,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:51:51,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:51:57,874 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (+ (select .cse1 c_~A~0.offset) c_~res1~0))) (and (forall ((~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (< .cse0 (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4))) 1)) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_1510 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1510) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))) 1))) (< (+ ~M~0 1) c_~N~0))) (<= c_~res2~0 c_~res1~0) (forall ((~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (<= (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) .cse0) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_1510 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1510) c_~A~0.base))) (<= (+ c_~res2~0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse3 c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) (< c_~res1~0 (+ c_~res2~0 1))))) is different from false [2022-12-06 02:53:12,721 INFO L130 PetriNetUnfolder]: 12668/21047 cut-off events. [2022-12-06 02:53:12,721 INFO L131 PetriNetUnfolder]: For 301236/301236 co-relation queries the response was YES. [2022-12-06 02:53:12,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774847 conditions, 21047 events. 12668/21047 cut-off events. For 301236/301236 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 164293 event pairs, 33 based on Foata normal form. 2/16133 useless extension candidates. Maximal degree in co-relation 356759. Up to 20011 conditions per place. [2022-12-06 02:53:12,995 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 5609 selfloop transitions, 939 changer transitions 1436/7984 dead transitions. [2022-12-06 02:53:12,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 7984 transitions, 606139 flow [2022-12-06 02:53:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:53:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:53:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 206 transitions. [2022-12-06 02:53:13,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3169230769230769 [2022-12-06 02:53:13,002 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 445 predicate places. [2022-12-06 02:53:13,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:13,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 7984 transitions, 606139 flow [2022-12-06 02:53:13,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 7984 transitions, 606139 flow [2022-12-06 02:53:13,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:13,545 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:13,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 543 [2022-12-06 02:53:13,545 INFO L495 AbstractCegarLoop]: Abstraction has has 475 places, 7984 transitions, 606139 flow [2022-12-06 02:53:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:13,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:13,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:13,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 02:53:13,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 02:53:13,749 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:53:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 343450883, now seen corresponding path program 13 times [2022-12-06 02:53:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:13,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381814790] [2022-12-06 02:53:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:14,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381814790] [2022-12-06 02:53:14,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381814790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:53:14,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048158341] [2022-12-06 02:53:14,156 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:53:14,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:53:14,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:53:14,157 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:53:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 02:53:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:14,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:53:14,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:53:14,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:53:14,444 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 17 treesize of output 17 [2022-12-06 02:53:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:14,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:53:14,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:53:14,572 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 20 treesize of output 19 [2022-12-06 02:53:14,581 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:53:14,582 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 19 treesize of output 12 [2022-12-06 02:53:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048158341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:53:14,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:53:14,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2022-12-06 02:53:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232793536] [2022-12-06 02:53:14,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:53:14,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:53:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:14,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:53:14,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-12-06 02:53:14,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:53:14,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 7984 transitions, 606139 flow. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:14,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:14,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:53:14,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:54:39,819 INFO L130 PetriNetUnfolder]: 12740/21230 cut-off events. [2022-12-06 02:54:39,819 INFO L131 PetriNetUnfolder]: For 299722/299722 co-relation queries the response was YES. [2022-12-06 02:54:39,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803066 conditions, 21230 events. 12740/21230 cut-off events. For 299722/299722 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 166603 event pairs, 30 based on Foata normal form. 2/16282 useless extension candidates. Maximal degree in co-relation 369036. Up to 20194 conditions per place. [2022-12-06 02:54:40,158 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 6331 selfloop transitions, 299 changer transitions 1477/8107 dead transitions. [2022-12-06 02:54:40,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 8107 transitions, 631731 flow [2022-12-06 02:54:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:54:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:54:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 208 transitions. [2022-12-06 02:54:40,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32 [2022-12-06 02:54:40,161 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 469 predicate places. [2022-12-06 02:54:40,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:54:40,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 499 places, 8107 transitions, 631731 flow [2022-12-06 02:54:40,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 499 places, 8107 transitions, 631731 flow [2022-12-06 02:54:40,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:54:40,901 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:54:40,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 741 [2022-12-06 02:54:40,902 INFO L495 AbstractCegarLoop]: Abstraction has has 499 places, 8107 transitions, 631731 flow [2022-12-06 02:54:40,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:54:40,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:54:40,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:54:40,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 02:54:41,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 02:54:41,109 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:54:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:54:41,109 INFO L85 PathProgramCache]: Analyzing trace with hash 414078905, now seen corresponding path program 14 times [2022-12-06 02:54:41,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:54:41,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79027166] [2022-12-06 02:54:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:41,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:54:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:54:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79027166] [2022-12-06 02:54:41,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79027166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:54:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060323528] [2022-12-06 02:54:41,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:54:41,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:41,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:54:41,412 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:54:41,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 02:54:41,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:54:41,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:54:41,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 02:54:41,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:54:41,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-06 02:54:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:41,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:54:41,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:54:41,810 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 20 treesize of output 19 [2022-12-06 02:54:41,819 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:54:41,819 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 19 treesize of output 12 [2022-12-06 02:54:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:54:41,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060323528] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:54:41,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:54:41,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-06 02:54:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291040871] [2022-12-06 02:54:41,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:54:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:54:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:54:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:54:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:54:41,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:54:41,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 8107 transitions, 631731 flow. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:54:41,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:54:41,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:54:41,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:07,963 INFO L130 PetriNetUnfolder]: 12742/21240 cut-off events. [2022-12-06 02:56:07,963 INFO L131 PetriNetUnfolder]: For 300210/300210 co-relation queries the response was YES. [2022-12-06 02:56:08,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824700 conditions, 21240 events. 12742/21240 cut-off events. For 300210/300210 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 166922 event pairs, 36 based on Foata normal form. 2/16290 useless extension candidates. Maximal degree in co-relation 378797. Up to 20204 conditions per place. [2022-12-06 02:56:08,291 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 6307 selfloop transitions, 311 changer transitions 1497/8115 dead transitions. [2022-12-06 02:56:08,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 8115 transitions, 648594 flow [2022-12-06 02:56:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:56:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:56:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 170 transitions. [2022-12-06 02:56:08,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-06 02:56:08,292 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 488 predicate places. [2022-12-06 02:56:08,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:08,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 518 places, 8115 transitions, 648594 flow [2022-12-06 02:56:08,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 518 places, 8115 transitions, 648594 flow [2022-12-06 02:56:08,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:08,989 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:08,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 697 [2022-12-06 02:56:08,989 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 8115 transitions, 648594 flow [2022-12-06 02:56:08,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:08,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:08,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:08,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 02:56:09,190 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:56:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -830553881, now seen corresponding path program 15 times [2022-12-06 02:56:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:09,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704653507] [2022-12-06 02:56:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:56:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:09,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704653507] [2022-12-06 02:56:09,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704653507] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:09,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853338054] [2022-12-06 02:56:09,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:56:09,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:09,482 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:56:09,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 02:56:09,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:56:09,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:56:09,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-06 02:56:09,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:09,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2022-12-06 02:56:09,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 02:56:09,746 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 14 treesize of output 16 [2022-12-06 02:56:09,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:56:09,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:56:09,846 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 17 treesize of output 10 [2022-12-06 02:56:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:56:09,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:56:10,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:56:10,088 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 250 treesize of output 182 [2022-12-06 02:56:10,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 146 [2022-12-06 02:56:10,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-12-06 02:56:10,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:56:10,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:56:10,150 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:56:10,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 12 [2022-12-06 02:56:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:56:10,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853338054] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:56:10,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:56:10,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2022-12-06 02:56:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068515012] [2022-12-06 02:56:10,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:56:10,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:56:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:56:10,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=513, Unknown=2, NotChecked=0, Total=600 [2022-12-06 02:56:10,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 02:56:10,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 8115 transitions, 648594 flow. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:10,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:10,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 02:56:10,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:56:45,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:56:45,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:56:45,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:45,315 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:56:45,315 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:56:45,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 02:56:45,500 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (25states, 0/26 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 378996 conditions, 9579 events (6221/9578 cut-off events. For 166843/166843 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 68721 event pairs, 18 based on Foata normal form. 0/8405 useless extension candidates. Maximal degree in co-relation 245240. Up to 8701 conditions per place.). [2022-12-06 02:56:45,501 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:56:45,501 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:56:45,501 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:56:45,501 INFO L458 BasicCegarLoop]: Path program histogram: [15, 11, 6, 2, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:45,504 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:56:45,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:56:45,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:56:45 BasicIcfg [2022-12-06 02:56:45,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:56:45,509 INFO L158 Benchmark]: Toolchain (without parser) took 833946.36ms. Allocated memory was 225.4MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 201.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 02:56:45,509 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 225.4MB. Free memory was 201.7MB in the beginning and 201.6MB in the end (delta: 89.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:56:45,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.49ms. Allocated memory is still 225.4MB. Free memory was 201.7MB in the beginning and 189.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.67ms. Allocated memory is still 225.4MB. Free memory was 189.2MB in the beginning and 187.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,510 INFO L158 Benchmark]: Boogie Preprocessor took 36.91ms. Allocated memory is still 225.4MB. Free memory was 187.1MB in the beginning and 185.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,510 INFO L158 Benchmark]: RCFGBuilder took 644.32ms. Allocated memory is still 225.4MB. Free memory was 185.3MB in the beginning and 153.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 02:56:45,510 INFO L158 Benchmark]: TraceAbstraction took 832930.22ms. Allocated memory was 225.4MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 153.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 02:56:45,515 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 225.4MB. Free memory was 201.7MB in the beginning and 201.6MB in the end (delta: 89.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.49ms. Allocated memory is still 225.4MB. Free memory was 201.7MB in the beginning and 189.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.67ms. Allocated memory is still 225.4MB. Free memory was 189.2MB in the beginning and 187.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.91ms. Allocated memory is still 225.4MB. Free memory was 187.1MB in the beginning and 185.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 644.32ms. Allocated memory is still 225.4MB. Free memory was 185.3MB in the beginning and 153.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 832930.22ms. Allocated memory was 225.4MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 153.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 126 PlacesBefore, 30 PlacesAfterwards, 128 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 673, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 680, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 680, unknown conditional: 0, unknown unconditional: 680] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1057, Positive conditional cache size: 0, Positive unconditional cache size: 1057, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 110 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.0s, 37 PlacesBefore, 36 PlacesAfterwards, 111 TransitionsBefore, 110 TransitionsAfterwards, 202 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, 39 PlacesBefore, 39 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 10 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, 45 PlacesBefore, 45 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 219 TransitionsBefore, 219 TransitionsAfterwards, 14 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, 55 PlacesBefore, 55 PlacesAfterwards, 358 TransitionsBefore, 358 TransitionsAfterwards, 16 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, 60 PlacesBefore, 60 PlacesAfterwards, 355 TransitionsBefore, 355 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 340 TransitionsBefore, 340 TransitionsAfterwards, 16 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, 70 PlacesBefore, 70 PlacesAfterwards, 352 TransitionsBefore, 352 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: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 337 TransitionsBefore, 337 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: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 557 TransitionsBefore, 557 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, 99 PlacesBefore, 99 PlacesAfterwards, 728 TransitionsBefore, 728 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: 2.4s, 129 PlacesBefore, 128 PlacesAfterwards, 1224 TransitionsBefore, 1223 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, 135 PlacesBefore, 135 PlacesAfterwards, 1504 TransitionsBefore, 1504 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, 146 PlacesBefore, 146 PlacesAfterwards, 1727 TransitionsBefore, 1727 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 1825 TransitionsBefore, 1825 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 156 PlacesBefore, 156 PlacesAfterwards, 1982 TransitionsBefore, 1982 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, 2383 TransitionsBefore, 2383 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, 175 PlacesBefore, 175 PlacesAfterwards, 2503 TransitionsBefore, 2503 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, 196 PlacesBefore, 196 PlacesAfterwards, 2628 TransitionsBefore, 2628 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 218 PlacesBefore, 218 PlacesAfterwards, 2675 TransitionsBefore, 2675 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, 246 PlacesBefore, 246 PlacesAfterwards, 2957 TransitionsBefore, 2957 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, 275 PlacesBefore, 275 PlacesAfterwards, 5000 TransitionsBefore, 5000 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, 299 PlacesBefore, 299 PlacesAfterwards, 5067 TransitionsBefore, 5067 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, 311 PlacesBefore, 311 PlacesAfterwards, 5167 TransitionsBefore, 5167 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, 325 PlacesBefore, 325 PlacesAfterwards, 5166 TransitionsBefore, 5166 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, 333 PlacesBefore, 333 PlacesAfterwards, 5461 TransitionsBefore, 5461 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, 340 PlacesBefore, 340 PlacesAfterwards, 5510 TransitionsBefore, 5510 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, 347 PlacesBefore, 347 PlacesAfterwards, 5656 TransitionsBefore, 5656 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, 371 PlacesBefore, 371 PlacesAfterwards, 5971 TransitionsBefore, 5971 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, 380 PlacesBefore, 380 PlacesAfterwards, 6119 TransitionsBefore, 6119 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, 389 PlacesBefore, 389 PlacesAfterwards, 6277 TransitionsBefore, 6277 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, 395 PlacesBefore, 395 PlacesAfterwards, 6406 TransitionsBefore, 6406 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, 422 PlacesBefore, 422 PlacesAfterwards, 6752 TransitionsBefore, 6752 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, 451 PlacesBefore, 451 PlacesAfterwards, 7839 TransitionsBefore, 7839 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, 475 PlacesBefore, 475 PlacesAfterwards, 7984 TransitionsBefore, 7984 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, 499 PlacesBefore, 499 PlacesAfterwards, 8107 TransitionsBefore, 8107 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, 518 PlacesBefore, 518 PlacesAfterwards, 8115 TransitionsBefore, 8115 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (25states, 0/26 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 378996 conditions, 9579 events (6221/9578 cut-off events. For 166843/166843 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 68721 event pairs, 18 based on Foata normal form. 0/8405 useless extension candidates. Maximal degree in co-relation 245240. Up to 8701 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (25states, 0/26 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 378996 conditions, 9579 events (6221/9578 cut-off events. For 166843/166843 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 68721 event pairs, 18 based on Foata normal form. 0/8405 useless extension candidates. Maximal degree in co-relation 245240. Up to 8701 conditions per place.). - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (25states, 0/26 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 378996 conditions, 9579 events (6221/9578 cut-off events. For 166843/166843 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 68721 event pairs, 18 based on Foata normal form. 0/8405 useless extension candidates. Maximal degree in co-relation 245240. Up to 8701 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (25states, 0/26 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 378996 conditions, 9579 events (6221/9578 cut-off events. For 166843/166843 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 68721 event pairs, 18 based on Foata normal form. 0/8405 useless extension candidates. Maximal degree in co-relation 245240. Up to 8701 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 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: 832.7s, OverallIterations: 40, TraceHistogramMax: 2, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 779.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 5083 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5083 mSDsluCounter, 1737 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1213 IncrementalHoareTripleChecker+Unchecked, 1469 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24237 IncrementalHoareTripleChecker+Invalid, 25906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 268 mSDtfsCounter, 24237 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1720 GetRequests, 802 SyntacticMatches, 95 SemanticMatches, 823 ConstructedPredicates, 21 IntricatePredicates, 2 DeprecatedPredicates, 6744 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=648594occurred in iteration=39, InterpolantAutomatonStates: 533, 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.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 1454 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 1948 ConstructedInterpolants, 81 QuantifiedInterpolants, 30125 SizeOfPredicates, 629 NumberOfNonLiveVariables, 6982 ConjunctsInSsa, 1448 ConjunctsInUnsatCore, 97 InterpolantComputations, 12 PerfectInterpolantSequences, 17/186 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