/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-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:11:00,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:11:00,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:11:00,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:11:00,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:11:00,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:11:00,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:11:00,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:11:00,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:11:00,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:11:00,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:11:00,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:11:00,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:11:00,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:11:00,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:11:00,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:11:00,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:11:00,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:11:00,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:11:00,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:11:00,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:11:00,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:11:00,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:11:00,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:11:00,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:11:00,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:11:00,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:11:00,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:11:00,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:11:00,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:11:00,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:11:00,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:11:00,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:11:00,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:11:00,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:11:00,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:11:00,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:11:00,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:11:00,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:11:00,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:11:00,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:11:00,851 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 03:11:00,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:11:00,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:11:00,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:11:00,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:11:00,881 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:11:00,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:11:00,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:11:00,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:11:00,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:11:00,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:11:00,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:11:00,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:11:00,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:11:00,882 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:11:00,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:11:00,883 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:11:00,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:11:00,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:11:00,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:11:00,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:11:00,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:11:00,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:11:00,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:11:00,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:11:00,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:11:00,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:11:00,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:11:00,884 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:11:00,884 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 03:11:01,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:11:01,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:11:01,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:11:01,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:11:01,166 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:11:01,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2022-12-06 03:11:02,297 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:11:02,461 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:11:02,461 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2022-12-06 03:11:02,468 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b938dd64b/cd3257aa04084363b7b2846a9e0f7a9c/FLAG972025757 [2022-12-06 03:11:02,480 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b938dd64b/cd3257aa04084363b7b2846a9e0f7a9c [2022-12-06 03:11:02,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:11:02,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:11:02,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:11:02,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:11:02,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:11:02,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bccfaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02, skipping insertion in model container [2022-12-06 03:11:02,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:11:02,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:11:02,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,678 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-queue-add-3.wvr.c[3412,3425] [2022-12-06 03:11:02,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:11:02,698 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:11:02,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:11:02,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:11:02,738 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-queue-add-3.wvr.c[3412,3425] [2022-12-06 03:11:02,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:11:02,753 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:11:02,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02 WrapperNode [2022-12-06 03:11:02,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:11:02,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:11:02,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:11:02,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:11:02,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,806 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-12-06 03:11:02,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:11:02,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:11:02,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:11:02,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:11:02,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,843 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:11:02,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:11:02,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:11:02,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:11:02,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (1/1) ... [2022-12-06 03:11:02,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:11:02,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:02,897 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 03:11:02,910 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 03:11:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:11:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:11:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:11:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:11:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:11:02,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:11:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:11:02,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:11:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 03:11:02,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 03:11:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:11:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:11:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:11:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:11:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:11:02,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:11:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:11:02,944 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 03:11:03,027 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:11:03,028 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:11:03,472 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:11:03,576 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:11:03,576 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 03:11:03,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:11:03 BoogieIcfgContainer [2022-12-06 03:11:03,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:11:03,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:11:03,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:11:03,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:11:03,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:11:02" (1/3) ... [2022-12-06 03:11:03,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc512b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:11:03, skipping insertion in model container [2022-12-06 03:11:03,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:11:02" (2/3) ... [2022-12-06 03:11:03,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc512b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:11:03, skipping insertion in model container [2022-12-06 03:11:03,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:11:03" (3/3) ... [2022-12-06 03:11:03,588 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2022-12-06 03:11:03,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:11:03,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:11:03,602 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:11:03,653 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 03:11:03,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 412 flow [2022-12-06 03:11:03,752 INFO L130 PetriNetUnfolder]: 18/191 cut-off events. [2022-12-06 03:11:03,752 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:11:03,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 18/191 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-06 03:11:03,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 412 flow [2022-12-06 03:11:03,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 380 flow [2022-12-06 03:11:03,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:03,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-06 03:11:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 380 flow [2022-12-06 03:11:03,831 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-06 03:11:03,832 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:11:03,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 18/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 109 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-06 03:11:03,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-06 03:11:03,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-06 03:11:11,897 INFO L203 LiptonReduction]: Total number of compositions: 152 [2022-12-06 03:11:11,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:11:11,916 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;@45276d23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:11:11,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 03:11:11,922 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 03:11:11,922 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:11:11,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:11,923 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 03:11:11,923 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 03:11:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1071479920, now seen corresponding path program 1 times [2022-12-06 03:11:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007762926] [2022-12-06 03:11:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:12,163 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 03:11:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:12,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007762926] [2022-12-06 03:11:12,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007762926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:12,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:11:12,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:11:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201849549] [2022-12-06 03:11:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:12,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 03:11:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:12,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 03:11:12,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 03:11:12,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 03:11:12,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:12,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:12,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 03:11:12,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:12,304 INFO L130 PetriNetUnfolder]: 321/458 cut-off events. [2022-12-06 03:11:12,304 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 03:11:12,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 458 events. 321/458 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1494 event pairs, 166 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 732. Up to 449 conditions per place. [2022-12-06 03:11:12,312 INFO L137 encePairwiseOnDemand]: 27/28 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-06 03:11:12,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2022-12-06 03:11:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 03:11:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 03:11:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2022-12-06 03:11:12,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-06 03:11:12,325 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-06 03:11:12,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:12,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-06 03:11:12,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-06 03:11:12,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 03:11:12,333 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:12,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 03:11:12,336 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 120 flow [2022-12-06 03:11:12,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:12,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:12,336 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 03:11:12,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:11:12,340 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 03:11:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 83975277, now seen corresponding path program 1 times [2022-12-06 03:11:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:12,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416661349] [2022-12-06 03:11:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:12,524 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 03:11:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:12,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416661349] [2022-12-06 03:11:12,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416661349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:12,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:11:12,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:11:12,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72190365] [2022-12-06 03:11:12,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:12,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:11:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:11:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:11:12,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 03:11:12,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:12,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:12,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 03:11:12,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:12,648 INFO L130 PetriNetUnfolder]: 330/496 cut-off events. [2022-12-06 03:11:12,649 INFO L131 PetriNetUnfolder]: For 48/50 co-relation queries the response was YES. [2022-12-06 03:11:12,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 496 events. 330/496 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1623 event pairs, 168 based on Foata normal form. 32/366 useless extension candidates. Maximal degree in co-relation 1078. Up to 481 conditions per place. [2022-12-06 03:11:12,652 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 23 selfloop transitions, 2 changer transitions 21/49 dead transitions. [2022-12-06 03:11:12,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 318 flow [2022-12-06 03:11:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:11:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:11:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 03:11:12,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2022-12-06 03:11:12,654 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-06 03:11:12,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:12,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 49 transitions, 318 flow [2022-12-06 03:11:12,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 49 transitions, 318 flow [2022-12-06 03:11:12,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 03:11:15,887 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:11:15,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3234 [2022-12-06 03:11:15,888 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 48 transitions, 312 flow [2022-12-06 03:11:15,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:15,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:15,889 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 03:11:15,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:11:15,889 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 03:11:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1516371576, now seen corresponding path program 1 times [2022-12-06 03:11:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:15,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884179054] [2022-12-06 03:11:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:16,066 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 03:11:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:16,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884179054] [2022-12-06 03:11:16,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884179054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:16,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:11:16,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:11:16,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791740830] [2022-12-06 03:11:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:16,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:11:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:11:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:11:16,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 03:11:16,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 48 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:16,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:16,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 03:11:16,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:16,216 INFO L130 PetriNetUnfolder]: 373/580 cut-off events. [2022-12-06 03:11:16,217 INFO L131 PetriNetUnfolder]: For 103/107 co-relation queries the response was YES. [2022-12-06 03:11:16,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 580 events. 373/580 cut-off events. For 103/107 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2121 event pairs, 195 based on Foata normal form. 31/433 useless extension candidates. Maximal degree in co-relation 1424. Up to 555 conditions per place. [2022-12-06 03:11:16,221 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 23 selfloop transitions, 2 changer transitions 31/59 dead transitions. [2022-12-06 03:11:16,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 502 flow [2022-12-06 03:11:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:11:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:11:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 03:11:16,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-06 03:11:16,223 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-06 03:11:16,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:16,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 59 transitions, 502 flow [2022-12-06 03:11:16,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 59 transitions, 502 flow [2022-12-06 03:11:16,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 03:11:16,228 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:16,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:11:16,229 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 59 transitions, 502 flow [2022-12-06 03:11:16,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:16,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:16,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:16,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:11:16,230 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 03:11:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash -512306346, now seen corresponding path program 1 times [2022-12-06 03:11:16,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:16,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555572657] [2022-12-06 03:11:16,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:16,352 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 03:11:16,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:16,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555572657] [2022-12-06 03:11:16,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555572657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:16,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:11:16,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:11:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933470829] [2022-12-06 03:11:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:16,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:11:16,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:11:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:11:16,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 03:11:16,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 59 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:11:16,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:16,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 03:11:16,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:16,433 INFO L130 PetriNetUnfolder]: 388/599 cut-off events. [2022-12-06 03:11:16,433 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-06 03:11:16,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 599 events. 388/599 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2079 event pairs, 76 based on Foata normal form. 18/429 useless extension candidates. Maximal degree in co-relation 1956. Up to 574 conditions per place. [2022-12-06 03:11:16,437 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 32 selfloop transitions, 3 changer transitions 29/67 dead transitions. [2022-12-06 03:11:16,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 700 flow [2022-12-06 03:11:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:11:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:11:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 03:11:16,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 03:11:16,438 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-06 03:11:16,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:16,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 67 transitions, 700 flow [2022-12-06 03:11:16,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 67 transitions, 700 flow [2022-12-06 03:11:16,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 03:11:16,442 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:16,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 03:11:16,443 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 67 transitions, 700 flow [2022-12-06 03:11:16,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 03:11:16,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:16,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:16,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 03:11:16,444 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 03:11:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash -354999472, now seen corresponding path program 2 times [2022-12-06 03:11:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708426780] [2022-12-06 03:11:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:16,634 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 03:11:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:16,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708426780] [2022-12-06 03:11:16,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708426780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:16,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:11:16,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:11:16,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851319591] [2022-12-06 03:11:16,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:16,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:11:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:11:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:11:16,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 03:11:16,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 67 transitions, 700 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:16,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:16,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 03:11:16,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:16,875 INFO L130 PetriNetUnfolder]: 575/923 cut-off events. [2022-12-06 03:11:16,875 INFO L131 PetriNetUnfolder]: For 536/536 co-relation queries the response was YES. [2022-12-06 03:11:16,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5348 conditions, 923 events. 575/923 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3673 event pairs, 56 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 3868. Up to 842 conditions per place. [2022-12-06 03:11:16,882 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 82 selfloop transitions, 10 changer transitions 57/151 dead transitions. [2022-12-06 03:11:16,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 151 transitions, 1896 flow [2022-12-06 03:11:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:11:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:11:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 03:11:16,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-06 03:11:16,887 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-06 03:11:16,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:16,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 151 transitions, 1896 flow [2022-12-06 03:11:16,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 151 transitions, 1896 flow [2022-12-06 03:11:16,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 03:11:16,897 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:16,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 03:11:16,898 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 151 transitions, 1896 flow [2022-12-06 03:11:16,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:16,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:16,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:16,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 03:11:16,898 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 03:11:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash -314766092, now seen corresponding path program 1 times [2022-12-06 03:11:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:16,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136586407] [2022-12-06 03:11:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:16,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:11:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:17,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136586407] [2022-12-06 03:11:17,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136586407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:17,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:11:17,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:11:17,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575041094] [2022-12-06 03:11:17,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:17,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:11:17,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:17,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:11:17,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:11:17,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 03:11:17,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 151 transitions, 1896 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 03:11:17,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:17,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 03:11:17,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:17,164 INFO L130 PetriNetUnfolder]: 391/663 cut-off events. [2022-12-06 03:11:17,164 INFO L131 PetriNetUnfolder]: For 732/732 co-relation queries the response was YES. [2022-12-06 03:11:17,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 663 events. 391/663 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2508 event pairs, 30 based on Foata normal form. 16/503 useless extension candidates. Maximal degree in co-relation 3272. Up to 632 conditions per place. [2022-12-06 03:11:17,177 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 79 selfloop transitions, 3 changer transitions 61/146 dead transitions. [2022-12-06 03:11:17,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 146 transitions, 2139 flow [2022-12-06 03:11:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:11:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:11:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 03:11:17,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:11:17,181 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-12-06 03:11:17,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:17,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 146 transitions, 2139 flow [2022-12-06 03:11:17,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 146 transitions, 2139 flow [2022-12-06 03:11:17,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 03:11:17,189 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:17,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 03:11:17,190 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 146 transitions, 2139 flow [2022-12-06 03:11:17,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 03:11:17,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:17,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:17,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 03:11:17,191 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 03:11:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -312557396, now seen corresponding path program 2 times [2022-12-06 03:11:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:17,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503755545] [2022-12-06 03:11:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:17,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:17,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503755545] [2022-12-06 03:11:17,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503755545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:17,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:11:17,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:11:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658669790] [2022-12-06 03:11:17,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:17,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:11:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:11:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:11:17,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 03:11:17,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 146 transitions, 2139 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:17,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:17,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 03:11:17,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:17,525 INFO L130 PetriNetUnfolder]: 724/1206 cut-off events. [2022-12-06 03:11:17,525 INFO L131 PetriNetUnfolder]: For 893/893 co-relation queries the response was YES. [2022-12-06 03:11:17,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9652 conditions, 1206 events. 724/1206 cut-off events. For 893/893 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5115 event pairs, 30 based on Foata normal form. 20/888 useless extension candidates. Maximal degree in co-relation 7786. Up to 1175 conditions per place. [2022-12-06 03:11:17,534 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 125 selfloop transitions, 19 changer transitions 75/222 dead transitions. [2022-12-06 03:11:17,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 222 transitions, 3701 flow [2022-12-06 03:11:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:11:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:11:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 03:11:17,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2022-12-06 03:11:17,536 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-06 03:11:17,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:17,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 222 transitions, 3701 flow [2022-12-06 03:11:17,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 222 transitions, 3701 flow [2022-12-06 03:11:17,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 03:11:17,547 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:17,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:11:17,549 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 222 transitions, 3701 flow [2022-12-06 03:11:17,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:17,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:17,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:17,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 03:11:17,550 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 03:11:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash 782660503, now seen corresponding path program 1 times [2022-12-06 03:11:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:17,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515051864] [2022-12-06 03:11:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:17,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515051864] [2022-12-06 03:11:17,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515051864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:17,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397095600] [2022-12-06 03:11:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:17,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:17,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:17,643 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 03:11:17,659 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 03:11:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:17,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:11:17,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:17,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:11:17,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397095600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:11:17,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:11:17,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 03:11:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41830230] [2022-12-06 03:11:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:11:17,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:11:17,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:17,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:11:17,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:11:17,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 03:11:17,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 222 transitions, 3701 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:17,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:17,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 03:11:17,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:18,238 INFO L130 PetriNetUnfolder]: 1107/1923 cut-off events. [2022-12-06 03:11:18,238 INFO L131 PetriNetUnfolder]: For 1837/1837 co-relation queries the response was YES. [2022-12-06 03:11:18,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17286 conditions, 1923 events. 1107/1923 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9842 event pairs, 42 based on Foata normal form. 98/1504 useless extension candidates. Maximal degree in co-relation 8745. Up to 1876 conditions per place. [2022-12-06 03:11:18,257 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 220 selfloop transitions, 4 changer transitions 148/375 dead transitions. [2022-12-06 03:11:18,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 375 transitions, 7019 flow [2022-12-06 03:11:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:11:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:11:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 03:11:18,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-06 03:11:18,260 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2022-12-06 03:11:18,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:18,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 375 transitions, 7019 flow [2022-12-06 03:11:18,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 375 transitions, 7019 flow [2022-12-06 03:11:18,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 03:11:22,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:11:22,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3817 [2022-12-06 03:11:22,077 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 374 transitions, 7001 flow [2022-12-06 03:11:22,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:22,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:22,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:22,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:22,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:22,278 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 03:11:22,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1946848215, now seen corresponding path program 1 times [2022-12-06 03:11:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:22,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897382834] [2022-12-06 03:11:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:22,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:22,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897382834] [2022-12-06 03:11:22,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897382834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:22,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294067858] [2022-12-06 03:11:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:22,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:22,769 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 03:11:22,791 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 03:11:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:22,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:11:22,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:22,957 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 23 treesize of output 7 [2022-12-06 03:11:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:22,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:23,006 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 03:11:23,007 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 25 treesize of output 16 [2022-12-06 03:11:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:23,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294067858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:23,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:23,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 03:11:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743877267] [2022-12-06 03:11:23,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:23,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:11:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:11:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-06 03:11:23,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:11:23,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 374 transitions, 7001 flow. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 03:11:23,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:23,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:11:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:24,405 INFO L130 PetriNetUnfolder]: 3460/5640 cut-off events. [2022-12-06 03:11:24,405 INFO L131 PetriNetUnfolder]: For 6159/6159 co-relation queries the response was YES. [2022-12-06 03:11:24,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54947 conditions, 5640 events. 3460/5640 cut-off events. For 6159/6159 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 32592 event pairs, 64 based on Foata normal form. 0/4141 useless extension candidates. Maximal degree in co-relation 34329. Up to 5356 conditions per place. [2022-12-06 03:11:24,448 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 686 selfloop transitions, 188 changer transitions 317/1193 dead transitions. [2022-12-06 03:11:24,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 1193 transitions, 24550 flow [2022-12-06 03:11:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 03:11:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 03:11:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 244 transitions. [2022-12-06 03:11:24,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44283121597096187 [2022-12-06 03:11:24,450 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2022-12-06 03:11:24,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:24,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 1193 transitions, 24550 flow [2022-12-06 03:11:24,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 1193 transitions, 24550 flow [2022-12-06 03:11:24,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-06 03:11:32,004 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:11:32,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7555 [2022-12-06 03:11:32,005 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 1191 transitions, 24510 flow [2022-12-06 03:11:32,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 03:11:32,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:32,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:32,020 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 03:11:32,210 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,SelfDestructingSolverStorable8 [2022-12-06 03:11:32,211 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 03:11:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash -322011602, now seen corresponding path program 1 times [2022-12-06 03:11:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:32,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223007008] [2022-12-06 03:11:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223007008] [2022-12-06 03:11:32,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223007008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809789235] [2022-12-06 03:11:32,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:32,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:32,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:32,675 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 03:11:32,707 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 03:11:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:32,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 03:11:32,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:32,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:32,933 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 18 treesize of output 20 [2022-12-06 03:11:32,962 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 23 treesize of output 7 [2022-12-06 03:11:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:32,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:33,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-12-06 03:11:33,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:11:33,054 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 45 treesize of output 41 [2022-12-06 03:11:33,058 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 24 treesize of output 18 [2022-12-06 03:11:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:33,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809789235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:33,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:33,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2022-12-06 03:11:33,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513943020] [2022-12-06 03:11:33,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:33,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:11:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:11:33,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=275, Unknown=1, NotChecked=34, Total=380 [2022-12-06 03:11:33,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 03:11:33,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 1191 transitions, 24510 flow. Second operand has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:33,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:33,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 03:11:33,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:37,332 INFO L130 PetriNetUnfolder]: 5658/9233 cut-off events. [2022-12-06 03:11:37,332 INFO L131 PetriNetUnfolder]: For 7168/7168 co-relation queries the response was YES. [2022-12-06 03:11:37,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98972 conditions, 9233 events. 5658/9233 cut-off events. For 7168/7168 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 59242 event pairs, 104 based on Foata normal form. 0/6877 useless extension candidates. Maximal degree in co-relation 58432. Up to 8749 conditions per place. [2022-12-06 03:11:37,413 INFO L137 encePairwiseOnDemand]: 10/31 looper letters, 1449 selfloop transitions, 580 changer transitions 562/2592 dead transitions. [2022-12-06 03:11:37,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 2592 transitions, 58369 flow [2022-12-06 03:11:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:11:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:11:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 319 transitions. [2022-12-06 03:11:37,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3215725806451613 [2022-12-06 03:11:37,415 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2022-12-06 03:11:37,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:37,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 2592 transitions, 58369 flow [2022-12-06 03:11:37,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 2592 transitions, 58369 flow [2022-12-06 03:11:37,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 1946 [2022-12-06 03:11:37,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] $Ultimate##0-->L47-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] and [856] L118-3-->L119-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre21#1_27|) (= (store |v_#memory_int_216| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_216| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre21#1_27|)) |v_#memory_int_215|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_216|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_19|, #memory_int=|v_#memory_int_215|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 03:11:41,947 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:11:41,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4532 [2022-12-06 03:11:41,948 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 2590 transitions, 58343 flow [2022-12-06 03:11:41,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:41,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:41,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:41,958 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 03:11:42,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:42,156 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 03:11:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash 561769088, now seen corresponding path program 2 times [2022-12-06 03:11:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:42,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066457893] [2022-12-06 03:11:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:11:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:42,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066457893] [2022-12-06 03:11:42,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066457893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790979637] [2022-12-06 03:11:42,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:11:42,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:42,660 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 03:11:42,662 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 03:11:42,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:11:42,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:11:42,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:11:42,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:42,840 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 200 treesize of output 198 [2022-12-06 03:11:42,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:42,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-06 03:11:42,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:11:42,983 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 03:11:43,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:43,089 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 18 treesize of output 20 [2022-12-06 03:11:43,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:11:43,119 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 18 treesize of output 20 [2022-12-06 03:11:43,157 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 19 treesize of output 7 [2022-12-06 03:11:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:43,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:43,200 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_414 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_414) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-12-06 03:11:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:43,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790979637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:43,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:43,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2022-12-06 03:11:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879307483] [2022-12-06 03:11:43,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:43,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 03:11:43,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:43,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 03:11:43,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=411, Unknown=6, NotChecked=42, Total=552 [2022-12-06 03:11:43,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 03:11:43,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 2590 transitions, 58343 flow. Second operand has 24 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 03:11:43,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:43,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 03:11:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:56,173 INFO L130 PetriNetUnfolder]: 15432/24418 cut-off events. [2022-12-06 03:11:56,173 INFO L131 PetriNetUnfolder]: For 12897/12897 co-relation queries the response was YES. [2022-12-06 03:11:56,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289476 conditions, 24418 events. 15432/24418 cut-off events. For 12897/12897 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 174940 event pairs, 224 based on Foata normal form. 66/18269 useless extension candidates. Maximal degree in co-relation 187789. Up to 23640 conditions per place. [2022-12-06 03:11:56,398 INFO L137 encePairwiseOnDemand]: 14/33 looper letters, 5349 selfloop transitions, 1299 changer transitions 984/7633 dead transitions. [2022-12-06 03:11:56,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 7633 transitions, 187091 flow [2022-12-06 03:11:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 03:11:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 03:11:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 361 transitions. [2022-12-06 03:11:56,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35288367546432065 [2022-12-06 03:11:56,402 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2022-12-06 03:11:56,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:56,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 7633 transitions, 187091 flow [2022-12-06 03:11:56,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 7633 transitions, 187091 flow [2022-12-06 03:11:56,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 5080 [2022-12-06 03:12:04,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 03:12:04,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:04,428 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 23 out of bounds for length 23 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 03:12:04,432 INFO L158 Benchmark]: Toolchain (without parser) took 61949.78ms. Allocated memory was 207.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 166.6MB in the beginning and 998.6MB in the end (delta: -832.0MB). Peak memory consumption was 993.1MB. Max. memory is 8.0GB. [2022-12-06 03:12:04,432 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:12:04,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.86ms. Allocated memory is still 207.6MB. Free memory was 166.6MB in the beginning and 153.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 03:12:04,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.27ms. Allocated memory is still 207.6MB. Free memory was 153.5MB in the beginning and 150.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 03:12:04,433 INFO L158 Benchmark]: Boogie Preprocessor took 37.01ms. Allocated memory is still 207.6MB. Free memory was 150.8MB in the beginning and 149.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:12:04,433 INFO L158 Benchmark]: RCFGBuilder took 734.97ms. Allocated memory is still 207.6MB. Free memory was 149.3MB in the beginning and 116.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 03:12:04,433 INFO L158 Benchmark]: TraceAbstraction took 60848.76ms. Allocated memory was 207.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 116.2MB in the beginning and 998.6MB in the end (delta: -882.3MB). Peak memory consumption was 942.7MB. Max. memory is 8.0GB. [2022-12-06 03:12:04,434 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.09ms. Allocated memory is still 207.6MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.86ms. Allocated memory is still 207.6MB. Free memory was 166.6MB in the beginning and 153.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.27ms. Allocated memory is still 207.6MB. Free memory was 153.5MB in the beginning and 150.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.01ms. Allocated memory is still 207.6MB. Free memory was 150.8MB in the beginning and 149.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 734.97ms. Allocated memory is still 207.6MB. Free memory was 149.3MB in the beginning and 116.8MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 60848.76ms. Allocated memory was 207.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 116.2MB in the beginning and 998.6MB in the end (delta: -882.3MB). Peak memory consumption was 942.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 173 PlacesBefore, 32 PlacesAfterwards, 181 TransitionsBefore, 28 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 112 TrivialYvCompositions, 29 ConcurrentYvCompositions, 11 ChoiceCompositions, 152 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 971, independent: 955, independent conditional: 955, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 971, independent: 955, independent conditional: 0, independent unconditional: 955, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 971, independent: 955, independent conditional: 0, independent unconditional: 955, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 971, independent: 955, independent conditional: 0, independent unconditional: 955, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 814, independent: 804, independent conditional: 0, independent unconditional: 804, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 814, independent: 797, independent conditional: 0, independent unconditional: 797, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 971, independent: 151, independent conditional: 0, independent unconditional: 151, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 814, unknown conditional: 0, unknown unconditional: 814] , Statistics on independence cache: Total cache size (in pairs): 1421, Positive cache size: 1411, Positive conditional cache size: 0, Positive unconditional cache size: 1411, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 64 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: 3.2s, 37 PlacesBefore, 36 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 116 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, 59 TransitionsBefore, 59 TransitionsAfterwards, 146 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, 41 PlacesBefore, 41 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 162 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, 46 PlacesBefore, 46 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 222 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, 48 PlacesBefore, 48 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 218 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, 51 PlacesBefore, 51 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 254 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: 3.8s, 56 PlacesBefore, 55 PlacesAfterwards, 375 TransitionsBefore, 374 TransitionsAfterwards, 414 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: 7.5s, 73 PlacesBefore, 71 PlacesAfterwards, 1193 TransitionsBefore, 1191 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 102 PlacesBefore, 100 PlacesAfterwards, 2592 TransitionsBefore, 2590 TransitionsAfterwards, 1946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 23 out of bounds for length 23 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 23 out of bounds for length 23: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 03:12:04,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...