/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:35:51,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:35:51,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:35:51,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:35:51,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:35:51,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:35:52,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:35:52,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:35:52,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:35:52,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:35:52,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:35:52,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:35:52,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:35:52,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:35:52,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:35:52,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:35:52,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:35:52,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:35:52,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:35:52,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:35:52,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:35:52,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:35:52,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:35:52,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:35:52,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:35:52,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:35:52,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:35:52,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:35:52,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:35:52,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:35:52,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:35:52,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:35:52,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:35:52,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:35:52,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:35:52,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:35:52,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:35:52,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:35:52,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:35:52,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:35:52,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:35:52,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:35:52,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:35:52,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:35:52,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:35:52,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:35:52,072 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:35:52,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:35:52,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:35:52,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:35:52,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:35:52,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:35:52,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:35:52,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:35:52,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:35:52,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:35:52,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:35:52,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:35:52,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:35:52,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:35:52,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:35:52,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:35:52,074 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:35:52,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:35:52,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:35:52,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:35:52,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:35:52,385 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:35:52,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-13 07:35:53,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:35:53,628 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:35:53,629 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-13 07:35:53,635 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8d52eec/c03918be33fe4bf5904f87e661d203df/FLAGc754c48e9 [2022-12-13 07:35:53,650 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a8d52eec/c03918be33fe4bf5904f87e661d203df [2022-12-13 07:35:53,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:35:53,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:35:53,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:35:53,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:35:53,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:35:53,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a268f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53, skipping insertion in model container [2022-12-13 07:35:53,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:35:53,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:35:53,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,847 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-13 07:35:53,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:35:53,860 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:35:53,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:35:53,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:35:53,896 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-13 07:35:53,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:35:53,907 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:35:53,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53 WrapperNode [2022-12-13 07:35:53,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:35:53,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:35:53,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:35:53,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:35:53,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,964 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-12-13 07:35:53,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:35:53,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:35:53,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:35:53,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:35:53,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,997 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:53,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:54,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:35:54,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:35:54,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:35:54,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:35:54,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (1/1) ... [2022-12-13 07:35:54,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:35:54,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:35:54,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:35:54,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:35:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:35:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:35:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:35:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:35:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:35:54,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:35:54,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:35:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:35:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 07:35:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:35:54,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:35:54,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:35:54,076 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:35:54,217 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:35:54,218 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:35:54,577 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:35:54,720 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:35:54,720 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 07:35:54,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:35:54 BoogieIcfgContainer [2022-12-13 07:35:54,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:35:54,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:35:54,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:35:54,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:35:54,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:35:53" (1/3) ... [2022-12-13 07:35:54,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ece581d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:35:54, skipping insertion in model container [2022-12-13 07:35:54,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:35:53" (2/3) ... [2022-12-13 07:35:54,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ece581d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:35:54, skipping insertion in model container [2022-12-13 07:35:54,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:35:54" (3/3) ... [2022-12-13 07:35:54,727 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-12-13 07:35:54,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:35:54,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:35:54,739 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:35:54,806 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 07:35:54,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 226 transitions, 484 flow [2022-12-13 07:35:54,929 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-13 07:35:54,930 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:35:54,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 222 events. 19/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-13 07:35:54,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 226 transitions, 484 flow [2022-12-13 07:35:54,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 210 transitions, 444 flow [2022-12-13 07:35:54,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:35:54,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-13 07:35:54,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 210 transitions, 444 flow [2022-12-13 07:35:55,020 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-12-13 07:35:55,021 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:35:55,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 210 events. 19/210 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-13 07:35:55,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-13 07:35:55,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-13 07:36:03,418 INFO L241 LiptonReduction]: Total number of compositions: 175 [2022-12-13 07:36:03,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:36:03,432 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;@255e578a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:36:03,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 07:36:03,437 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-13 07:36:03,437 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:36:03,437 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:36:03,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:36:03,438 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 2 more)] === [2022-12-13 07:36:03,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:36:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1402613233, now seen corresponding path program 1 times [2022-12-13 07:36:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:36:03,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153634285] [2022-12-13 07:36:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:36:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:36:04,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153634285] [2022-12-13 07:36:04,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153634285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:36:04,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:36:04,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:36:04,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313905390] [2022-12-13 07:36:04,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:36:04,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:36:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:36:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:36:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:36:04,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-13 07:36:04,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:04,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:36:04,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-13 07:36:04,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:36:04,493 INFO L130 PetriNetUnfolder]: 2592/3424 cut-off events. [2022-12-13 07:36:04,494 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-13 07:36:04,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3424 events. 2592/3424 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14384 event pairs, 355 based on Foata normal form. 0/2355 useless extension candidates. Maximal degree in co-relation 5848. Up to 1372 conditions per place. [2022-12-13 07:36:04,511 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 66 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2022-12-13 07:36:04,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 387 flow [2022-12-13 07:36:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:36:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:36:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-13 07:36:04,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2022-12-13 07:36:04,524 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-13 07:36:04,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 84 transitions, 387 flow [2022-12-13 07:36:04,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 75 transitions, 339 flow [2022-12-13 07:36:04,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:36:04,549 INFO L89 Accepts]: Start accepts. Operand has 47 places, 75 transitions, 339 flow [2022-12-13 07:36:04,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:36:04,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:36:04,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 75 transitions, 339 flow [2022-12-13 07:36:04,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 75 transitions, 339 flow [2022-12-13 07:36:04,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-13 07:36:04,570 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:36:04,571 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 07:36:04,572 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 75 transitions, 339 flow [2022-12-13 07:36:04,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:04,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:36:04,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:36:04,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:36:04,572 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 2 more)] === [2022-12-13 07:36:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:36:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1996718852, now seen corresponding path program 1 times [2022-12-13 07:36:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:36:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053888251] [2022-12-13 07:36:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:36:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:36:04,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053888251] [2022-12-13 07:36:04,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053888251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:36:04,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:36:04,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:36:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124996339] [2022-12-13 07:36:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:36:04,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:36:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:36:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:36:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:36:04,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 07:36:04,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 75 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:04,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:36:04,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 07:36:04,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:36:05,064 INFO L130 PetriNetUnfolder]: 3185/4324 cut-off events. [2022-12-13 07:36:05,064 INFO L131 PetriNetUnfolder]: For 761/823 co-relation queries the response was YES. [2022-12-13 07:36:05,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12386 conditions, 4324 events. 3185/4324 cut-off events. For 761/823 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 19781 event pairs, 569 based on Foata normal form. 192/3250 useless extension candidates. Maximal degree in co-relation 7137. Up to 2567 conditions per place. [2022-12-13 07:36:05,080 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 64 selfloop transitions, 2 changer transitions 45/121 dead transitions. [2022-12-13 07:36:05,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 121 transitions, 775 flow [2022-12-13 07:36:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:36:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:36:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 07:36:05,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-13 07:36:05,082 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-13 07:36:05,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 121 transitions, 775 flow [2022-12-13 07:36:05,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 76 transitions, 475 flow [2022-12-13 07:36:05,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:36:05,116 INFO L89 Accepts]: Start accepts. Operand has 49 places, 76 transitions, 475 flow [2022-12-13 07:36:05,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:36:05,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:36:05,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 76 transitions, 475 flow [2022-12-13 07:36:05,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 76 transitions, 475 flow [2022-12-13 07:36:05,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-13 07:36:06,973 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:36:06,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1859 [2022-12-13 07:36:06,976 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 75 transitions, 469 flow [2022-12-13 07:36:06,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:06,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:36:06,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:36:06,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:36:06,976 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 2 more)] === [2022-12-13 07:36:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:36:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1258964321, now seen corresponding path program 1 times [2022-12-13 07:36:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:36:06,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237022880] [2022-12-13 07:36:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:36:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:07,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:36:07,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237022880] [2022-12-13 07:36:07,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237022880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:36:07,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:36:07,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:36:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126310061] [2022-12-13 07:36:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:36:07,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:36:07,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:36:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:36:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:36:07,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 07:36:07,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 75 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:07,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:36:07,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 07:36:07,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:36:07,983 INFO L130 PetriNetUnfolder]: 4835/6430 cut-off events. [2022-12-13 07:36:07,983 INFO L131 PetriNetUnfolder]: For 1384/1384 co-relation queries the response was YES. [2022-12-13 07:36:07,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23156 conditions, 6430 events. 4835/6430 cut-off events. For 1384/1384 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 26111 event pairs, 278 based on Foata normal form. 72/5044 useless extension candidates. Maximal degree in co-relation 20140. Up to 4417 conditions per place. [2022-12-13 07:36:08,017 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 150 selfloop transitions, 17 changer transitions 2/169 dead transitions. [2022-12-13 07:36:08,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 169 transitions, 1364 flow [2022-12-13 07:36:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:36:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:36:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-13 07:36:08,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-13 07:36:08,022 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-13 07:36:08,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 169 transitions, 1364 flow [2022-12-13 07:36:08,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 167 transitions, 1348 flow [2022-12-13 07:36:08,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:36:08,067 INFO L89 Accepts]: Start accepts. Operand has 54 places, 167 transitions, 1348 flow [2022-12-13 07:36:08,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:36:08,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:36:08,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 167 transitions, 1348 flow [2022-12-13 07:36:08,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 167 transitions, 1348 flow [2022-12-13 07:36:08,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:36:08,077 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:36:08,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:36:08,080 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 167 transitions, 1348 flow [2022-12-13 07:36:08,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:08,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:36:08,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:36:08,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:36:08,081 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 2 more)] === [2022-12-13 07:36:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:36:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1021846978, now seen corresponding path program 1 times [2022-12-13 07:36:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:36:08,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56627206] [2022-12-13 07:36:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:08,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:36:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:36:08,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56627206] [2022-12-13 07:36:08,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56627206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:36:08,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891138278] [2022-12-13 07:36:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:08,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:36:08,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:36:08,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:36:08,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:36:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:08,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 07:36:08,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:36:08,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 07:36:09,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:36:09,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:36:09,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:36:09,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:36:09,479 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-13 07:36:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:09,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:36:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:10,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891138278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:36:10,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:36:10,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 25 [2022-12-13 07:36:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735884762] [2022-12-13 07:36:10,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:36:10,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 07:36:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:36:10,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 07:36:10,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=563, Unknown=9, NotChecked=0, Total=702 [2022-12-13 07:36:10,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-13 07:36:10,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 167 transitions, 1348 flow. Second operand has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:10,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:36:10,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-13 07:36:10,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:36:12,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:36:18,863 INFO L130 PetriNetUnfolder]: 16940/22611 cut-off events. [2022-12-13 07:36:18,864 INFO L131 PetriNetUnfolder]: For 10391/10391 co-relation queries the response was YES. [2022-12-13 07:36:18,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101034 conditions, 22611 events. 16940/22611 cut-off events. For 10391/10391 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 109960 event pairs, 1067 based on Foata normal form. 68/17624 useless extension candidates. Maximal degree in co-relation 42175. Up to 15910 conditions per place. [2022-12-13 07:36:19,000 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 733 selfloop transitions, 147 changer transitions 26/920 dead transitions. [2022-12-13 07:36:19,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 920 transitions, 9523 flow [2022-12-13 07:36:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 07:36:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 07:36:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 432 transitions. [2022-12-13 07:36:19,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44081632653061226 [2022-12-13 07:36:19,005 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2022-12-13 07:36:19,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 920 transitions, 9523 flow [2022-12-13 07:36:19,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 894 transitions, 9251 flow [2022-12-13 07:36:19,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:36:19,194 INFO L89 Accepts]: Start accepts. Operand has 81 places, 894 transitions, 9251 flow [2022-12-13 07:36:19,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:36:19,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:36:19,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 894 transitions, 9251 flow [2022-12-13 07:36:19,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 894 transitions, 9251 flow [2022-12-13 07:36:19,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:36:38,606 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 07:36:38,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19414 [2022-12-13 07:36:38,608 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 890 transitions, 9211 flow [2022-12-13 07:36:38,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:38,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:36:38,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:36:38,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 07:36:38,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:36:38,813 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 2 more)] === [2022-12-13 07:36:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:36:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1234036686, now seen corresponding path program 1 times [2022-12-13 07:36:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:36:38,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822761872] [2022-12-13 07:36:38,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:36:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:36:40,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822761872] [2022-12-13 07:36:40,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822761872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:36:40,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933462296] [2022-12-13 07:36:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:36:40,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:36:40,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:36:40,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:36:40,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:36:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:36:40,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 07:36:40,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:36:40,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:36:40,435 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 19 treesize of output 21 [2022-12-13 07:36:40,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:36:40,479 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 19 treesize of output 21 [2022-12-13 07:36:40,629 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 25 treesize of output 7 [2022-12-13 07:36:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:40,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:36:41,014 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 07:36:41,014 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 88 treesize of output 76 [2022-12-13 07:36:41,018 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 68 treesize of output 56 [2022-12-13 07:36:41,022 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 30 treesize of output 24 [2022-12-13 07:36:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:36:41,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933462296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:36:41,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:36:41,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2022-12-13 07:36:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568443437] [2022-12-13 07:36:41,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:36:41,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:36:41,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:36:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:36:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=328, Unknown=5, NotChecked=0, Total=420 [2022-12-13 07:36:41,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 07:36:41,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 890 transitions, 9211 flow. Second operand has 21 states, 21 states have (on average 6.333333333333333) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:36:41,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:36:41,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 07:36:41,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:36:52,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:36:54,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:36:56,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:36:59,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:37:07,179 INFO L130 PetriNetUnfolder]: 46572/62229 cut-off events. [2022-12-13 07:37:07,179 INFO L131 PetriNetUnfolder]: For 31970/31970 co-relation queries the response was YES. [2022-12-13 07:37:07,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333452 conditions, 62229 events. 46572/62229 cut-off events. For 31970/31970 co-relation queries the response was YES. Maximal size of possible extension queue 1832. Compared 352629 event pairs, 2598 based on Foata normal form. 49/48245 useless extension candidates. Maximal degree in co-relation 137997. Up to 46020 conditions per place. [2022-12-13 07:37:07,599 INFO L137 encePairwiseOnDemand]: 15/39 looper letters, 2337 selfloop transitions, 628 changer transitions 28/3007 dead transitions. [2022-12-13 07:37:07,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 3007 transitions, 37727 flow [2022-12-13 07:37:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 07:37:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-13 07:37:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 770 transitions. [2022-12-13 07:37:07,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4815509693558474 [2022-12-13 07:37:07,603 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2022-12-13 07:37:07,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 3007 transitions, 37727 flow [2022-12-13 07:37:07,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 2979 transitions, 37340 flow [2022-12-13 07:37:08,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:37:08,214 INFO L89 Accepts]: Start accepts. Operand has 117 places, 2979 transitions, 37340 flow [2022-12-13 07:37:08,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:37:08,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:37:08,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 2979 transitions, 37340 flow [2022-12-13 07:37:08,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 2979 transitions, 37340 flow [2022-12-13 07:37:08,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:37:08,303 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:37:08,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 07:37:08,305 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 2979 transitions, 37340 flow [2022-12-13 07:37:08,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.333333333333333) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:37:08,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:37:08,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:37:08,321 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-13 07:37:08,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:37:08,511 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 2 more)] === [2022-12-13 07:37:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:37:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 318124004, now seen corresponding path program 2 times [2022-12-13 07:37:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:37:08,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782338451] [2022-12-13 07:37:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:37:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:37:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:37:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:37:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782338451] [2022-12-13 07:37:09,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782338451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:37:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482867829] [2022-12-13 07:37:09,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:37:09,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:37:09,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:37:09,905 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:37:09,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:37:10,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:37:10,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:37:10,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 07:37:10,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:37:10,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:37:10,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:37:10,115 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 39 treesize of output 37 [2022-12-13 07:37:10,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:37:10,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 07:37:10,344 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 19 treesize of output 21 [2022-12-13 07:37:10,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:37:10,415 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 19 treesize of output 21 [2022-12-13 07:37:10,559 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 25 treesize of output 7 [2022-12-13 07:37:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:10,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:37:12,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:37:12,895 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 1362 treesize of output 1302 [2022-12-13 07:37:12,908 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 643 treesize of output 595 [2022-12-13 07:37:12,919 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 1238 treesize of output 1142 [2022-12-13 07:37:12,929 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 1142 treesize of output 950 [2022-12-13 07:37:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:14,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482867829] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:37:14,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:37:14,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-12-13 07:37:14,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554510575] [2022-12-13 07:37:14,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:37:14,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:37:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:37:14,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:37:14,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2022-12-13 07:37:14,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2022-12-13 07:37:14,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 2979 transitions, 37340 flow. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:37:14,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:37:14,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2022-12-13 07:37:14,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:37:44,938 INFO L130 PetriNetUnfolder]: 72315/97045 cut-off events. [2022-12-13 07:37:44,938 INFO L131 PetriNetUnfolder]: For 63303/63303 co-relation queries the response was YES. [2022-12-13 07:37:45,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603228 conditions, 97045 events. 72315/97045 cut-off events. For 63303/63303 co-relation queries the response was YES. Maximal size of possible extension queue 2907. Compared 588905 event pairs, 4423 based on Foata normal form. 10/74957 useless extension candidates. Maximal degree in co-relation 248982. Up to 72621 conditions per place. [2022-12-13 07:37:45,670 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 4133 selfloop transitions, 720 changer transitions 15/4919 dead transitions. [2022-12-13 07:37:45,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 4919 transitions, 71598 flow [2022-12-13 07:37:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:37:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:37:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 308 transitions. [2022-12-13 07:37:45,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5264957264957265 [2022-12-13 07:37:45,672 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2022-12-13 07:37:45,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 4919 transitions, 71598 flow [2022-12-13 07:37:46,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 4904 transitions, 71358 flow [2022-12-13 07:37:46,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:37:46,836 INFO L89 Accepts]: Start accepts. Operand has 131 places, 4904 transitions, 71358 flow [2022-12-13 07:37:46,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:37:46,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:37:46,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 4904 transitions, 71358 flow [2022-12-13 07:37:46,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 4904 transitions, 71358 flow [2022-12-13 07:37:46,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:37:46,979 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:37:46,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 07:37:46,980 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 4904 transitions, 71358 flow [2022-12-13 07:37:46,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:37:46,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:37:46,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:37:46,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:37:47,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:37:47,190 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 2 more)] === [2022-12-13 07:37:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:37:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1239408869, now seen corresponding path program 1 times [2022-12-13 07:37:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:37:47,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815284250] [2022-12-13 07:37:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:37:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:37:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:37:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:48,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:37:48,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815284250] [2022-12-13 07:37:48,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815284250] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:37:48,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375934267] [2022-12-13 07:37:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:37:48,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:37:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:37:48,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:37:48,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:37:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:37:48,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 07:37:48,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:37:48,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:37:48,672 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-13 07:37:48,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:37:48,707 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-13 07:37:48,762 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-13 07:37:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:48,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:37:48,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:37:48,937 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 174 treesize of output 162 [2022-12-13 07:37:48,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2022-12-13 07:37:48,943 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 122 treesize of output 110 [2022-12-13 07:37:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:37:49,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375934267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:37:49,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:37:49,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-12-13 07:37:49,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705334670] [2022-12-13 07:37:49,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:37:49,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:37:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:37:49,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:37:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=316, Unknown=7, NotChecked=0, Total=380 [2022-12-13 07:37:49,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2022-12-13 07:37:49,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 4904 transitions, 71358 flow. Second operand has 20 states, 20 states have (on average 7.4) internal successors, (148), 20 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:37:49,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:37:49,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2022-12-13 07:37:49,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:38:37,283 INFO L130 PetriNetUnfolder]: 89444/120037 cut-off events. [2022-12-13 07:38:37,283 INFO L131 PetriNetUnfolder]: For 105250/105250 co-relation queries the response was YES. [2022-12-13 07:38:37,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848134 conditions, 120037 events. 89444/120037 cut-off events. For 105250/105250 co-relation queries the response was YES. Maximal size of possible extension queue 3577. Compared 748103 event pairs, 5468 based on Foata normal form. 39/92795 useless extension candidates. Maximal degree in co-relation 312236. Up to 90261 conditions per place. [2022-12-13 07:38:38,261 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 5417 selfloop transitions, 680 changer transitions 12/6160 dead transitions. [2022-12-13 07:38:38,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 6160 transitions, 101924 flow [2022-12-13 07:38:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 07:38:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 07:38:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 344 transitions. [2022-12-13 07:38:38,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4642375168690958 [2022-12-13 07:38:38,268 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-13 07:38:38,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 6160 transitions, 101924 flow [2022-12-13 07:38:38,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 6148 transitions, 101711 flow [2022-12-13 07:38:39,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:38:39,673 INFO L89 Accepts]: Start accepts. Operand has 149 places, 6148 transitions, 101711 flow [2022-12-13 07:38:39,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:38:39,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:38:39,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 6148 transitions, 101711 flow [2022-12-13 07:38:39,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 6148 transitions, 101711 flow [2022-12-13 07:38:39,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:38:39,876 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:38:39,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 07:38:39,877 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 6148 transitions, 101711 flow [2022-12-13 07:38:39,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.4) internal successors, (148), 20 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:38:39,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:38:39,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:38:39,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 07:38:40,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:38:40,083 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 2 more)] === [2022-12-13 07:38:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:38:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 75139441, now seen corresponding path program 1 times [2022-12-13 07:38:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:38:40,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761783906] [2022-12-13 07:38:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:38:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:38:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:38:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:38:40,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:38:40,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761783906] [2022-12-13 07:38:40,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761783906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:38:40,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:38:40,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:38:40,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905518888] [2022-12-13 07:38:40,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:38:40,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:38:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:38:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:38:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:38:40,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2022-12-13 07:38:40,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 6148 transitions, 101711 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:38:40,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:38:40,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2022-12-13 07:38:40,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:39:35,956 INFO L130 PetriNetUnfolder]: 74719/104902 cut-off events. [2022-12-13 07:39:35,956 INFO L131 PetriNetUnfolder]: For 144745/144745 co-relation queries the response was YES. [2022-12-13 07:39:36,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803968 conditions, 104902 events. 74719/104902 cut-off events. For 144745/144745 co-relation queries the response was YES. Maximal size of possible extension queue 3384. Compared 720159 event pairs, 5186 based on Foata normal form. 2866/91198 useless extension candidates. Maximal degree in co-relation 293280. Up to 75516 conditions per place. [2022-12-13 07:39:36,611 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 3578 selfloop transitions, 1 changer transitions 1590/5353 dead transitions. [2022-12-13 07:39:36,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 5353 transitions, 99345 flow [2022-12-13 07:39:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:39:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:39:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 07:39:36,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2022-12-13 07:39:36,612 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-13 07:39:36,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 5353 transitions, 99345 flow [2022-12-13 07:39:37,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 3763 transitions, 69426 flow [2022-12-13 07:39:37,674 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:39:37,675 INFO L89 Accepts]: Start accepts. Operand has 143 places, 3763 transitions, 69426 flow [2022-12-13 07:39:37,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:39:37,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:39:37,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 3763 transitions, 69426 flow [2022-12-13 07:39:37,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 3763 transitions, 69426 flow [2022-12-13 07:39:37,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:39:37,810 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:39:37,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 07:39:37,810 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 3763 transitions, 69426 flow [2022-12-13 07:39:37,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:39:37,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:39:37,811 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:39:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:39:37,811 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 2 more)] === [2022-12-13 07:39:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:39:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1044491020, now seen corresponding path program 2 times [2022-12-13 07:39:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:39:37,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405371153] [2022-12-13 07:39:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:39:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:39:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:39:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:39:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:39:38,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405371153] [2022-12-13 07:39:38,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405371153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:39:38,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419045999] [2022-12-13 07:39:38,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:39:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:39:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:39:38,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:39:38,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:39:38,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:39:38,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:39:38,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 07:39:38,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:39:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:39:38,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:39:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:39:38,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419045999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:39:38,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:39:38,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 07:39:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574105202] [2022-12-13 07:39:38,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:39:38,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 07:39:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:39:38,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 07:39:38,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-12-13 07:39:38,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-13 07:39:38,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 3763 transitions, 69426 flow. Second operand has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:39:38,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:39:38,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-13 07:39:38,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:40:18,798 INFO L130 PetriNetUnfolder]: 83154/113302 cut-off events. [2022-12-13 07:40:18,798 INFO L131 PetriNetUnfolder]: For 186217/186217 co-relation queries the response was YES. [2022-12-13 07:40:19,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965637 conditions, 113302 events. 83154/113302 cut-off events. For 186217/186217 co-relation queries the response was YES. Maximal size of possible extension queue 3256. Compared 726289 event pairs, 5293 based on Foata normal form. 104/95156 useless extension candidates. Maximal degree in co-relation 331316. Up to 82476 conditions per place. [2022-12-13 07:40:19,643 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 4934 selfloop transitions, 568 changer transitions 0/5516 dead transitions. [2022-12-13 07:40:19,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 5516 transitions, 112826 flow [2022-12-13 07:40:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 07:40:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 07:40:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 326 transitions. [2022-12-13 07:40:19,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42894736842105263 [2022-12-13 07:40:19,646 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2022-12-13 07:40:19,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 5516 transitions, 112826 flow [2022-12-13 07:40:20,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 5516 transitions, 112826 flow [2022-12-13 07:40:21,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:40:21,018 INFO L89 Accepts]: Start accepts. Operand has 160 places, 5516 transitions, 112826 flow [2022-12-13 07:40:21,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:40:21,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:40:21,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 5516 transitions, 112826 flow [2022-12-13 07:40:21,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 5516 transitions, 112826 flow [2022-12-13 07:40:21,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:40:21,191 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:40:21,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-13 07:40:21,192 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 5516 transitions, 112826 flow [2022-12-13 07:40:21,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:40:21,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:40:21,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:40:21,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 07:40:21,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:40:21,398 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 2 more)] === [2022-12-13 07:40:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:40:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1417262669, now seen corresponding path program 1 times [2022-12-13 07:40:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:40:21,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390307374] [2022-12-13 07:40:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:40:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:40:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:40:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:40:22,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:40:22,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390307374] [2022-12-13 07:40:22,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390307374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:40:22,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868731743] [2022-12-13 07:40:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:40:22,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:40:22,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:40:22,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:40:22,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:40:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:40:22,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 07:40:22,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:40:22,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:40:22,499 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-13 07:40:22,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:40:22,532 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-13 07:40:22,640 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-13 07:40:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:40:22,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:40:22,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:40:22,973 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 174 treesize of output 162 [2022-12-13 07:40:22,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-12-13 07:40:22,980 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 134 treesize of output 110 [2022-12-13 07:40:23,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-13 07:40:23,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868731743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:40:23,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:40:23,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 24 [2022-12-13 07:40:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459580808] [2022-12-13 07:40:23,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:40:23,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 07:40:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:40:23,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 07:40:23,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=557, Unknown=4, NotChecked=0, Total=650 [2022-12-13 07:40:23,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-13 07:40:23,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 5516 transitions, 112826 flow. Second operand has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:40:23,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:40:23,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-13 07:40:23,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:41:37,094 INFO L130 PetriNetUnfolder]: 105379/143178 cut-off events. [2022-12-13 07:41:37,095 INFO L131 PetriNetUnfolder]: For 267860/267860 co-relation queries the response was YES. [2022-12-13 07:41:37,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346636 conditions, 143178 events. 105379/143178 cut-off events. For 267860/267860 co-relation queries the response was YES. Maximal size of possible extension queue 4164. Compared 938156 event pairs, 6772 based on Foata normal form. 8/118431 useless extension candidates. Maximal degree in co-relation 383178. Up to 105761 conditions per place. [2022-12-13 07:41:38,456 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 6347 selfloop transitions, 768 changer transitions 17/7146 dead transitions. [2022-12-13 07:41:38,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 7146 transitions, 160438 flow [2022-12-13 07:41:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 07:41:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 07:41:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 486 transitions. [2022-12-13 07:41:38,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 07:41:38,458 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2022-12-13 07:41:38,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 7146 transitions, 160438 flow [2022-12-13 07:41:39,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 7129 transitions, 160040 flow [2022-12-13 07:41:40,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:41:40,331 INFO L89 Accepts]: Start accepts. Operand has 186 places, 7129 transitions, 160040 flow [2022-12-13 07:41:40,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:41:40,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:41:40,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 7129 transitions, 160040 flow [2022-12-13 07:41:40,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 7129 transitions, 160040 flow [2022-12-13 07:41:40,579 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:41:47,961 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:41:47,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7631 [2022-12-13 07:41:47,962 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 7128 transitions, 160018 flow [2022-12-13 07:41:47,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:41:47,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:41:47,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:41:47,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:41:48,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:41:48,169 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 2 more)] === [2022-12-13 07:41:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:41:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1709699581, now seen corresponding path program 1 times [2022-12-13 07:41:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:41:48,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313613256] [2022-12-13 07:41:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:41:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:41:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:41:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:41:49,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:41:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313613256] [2022-12-13 07:41:49,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313613256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:41:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333147314] [2022-12-13 07:41:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:41:49,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:41:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:41:49,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:41:49,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:41:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:41:49,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 07:41:49,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:41:49,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:41:49,451 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-13 07:41:49,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:41:49,495 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-13 07:41:49,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:41:49,534 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-13 07:41:49,660 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-13 07:41:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:41:49,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:41:52,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:41:52,023 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 172 treesize of output 168 [2022-12-13 07:41:52,029 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 152 treesize of output 128 [2022-12-13 07:41:52,034 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 128 treesize of output 116 [2022-12-13 07:41:52,043 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 60 treesize of output 54 [2022-12-13 07:41:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:41:52,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333147314] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:41:52,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:41:52,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2022-12-13 07:41:52,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535951264] [2022-12-13 07:41:52,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:41:52,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:41:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:41:52,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:41:52,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=493, Unknown=5, NotChecked=0, Total=600 [2022-12-13 07:41:52,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 07:41:52,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 7128 transitions, 160018 flow. Second operand has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:41:52,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:41:52,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 07:41:52,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:43:48,209 INFO L130 PetriNetUnfolder]: 120173/163143 cut-off events. [2022-12-13 07:43:48,209 INFO L131 PetriNetUnfolder]: For 337749/337749 co-relation queries the response was YES. [2022-12-13 07:43:48,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673538 conditions, 163143 events. 120173/163143 cut-off events. For 337749/337749 co-relation queries the response was YES. Maximal size of possible extension queue 4816. Compared 1083178 event pairs, 7423 based on Foata normal form. 8/134133 useless extension candidates. Maximal degree in co-relation 443688. Up to 121595 conditions per place. [2022-12-13 07:43:49,604 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 7232 selfloop transitions, 875 changer transitions 17/8138 dead transitions. [2022-12-13 07:43:49,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 8138 transitions, 199074 flow [2022-12-13 07:43:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:43:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:43:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 248 transitions. [2022-12-13 07:43:49,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4239316239316239 [2022-12-13 07:43:49,606 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2022-12-13 07:43:49,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 8138 transitions, 199074 flow [2022-12-13 07:43:50,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 8121 transitions, 198642 flow [2022-12-13 07:43:51,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:43:51,680 INFO L89 Accepts]: Start accepts. Operand has 199 places, 8121 transitions, 198642 flow [2022-12-13 07:43:51,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:43:51,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:43:51,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 8121 transitions, 198642 flow [2022-12-13 07:43:51,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 8121 transitions, 198642 flow [2022-12-13 07:43:51,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:43:51,998 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:43:51,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-13 07:43:51,998 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 8121 transitions, 198642 flow [2022-12-13 07:43:51,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:43:51,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:43:51,999 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:43:52,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 07:43:52,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:43:52,203 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:43:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:43:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash 523982241, now seen corresponding path program 1 times [2022-12-13 07:43:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:43:52,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630369835] [2022-12-13 07:43:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:43:52,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:43:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:43:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:43:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:43:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630369835] [2022-12-13 07:43:53,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630369835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:43:53,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866012030] [2022-12-13 07:43:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:43:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:43:53,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:43:53,204 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:43:53,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:43:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:43:53,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 07:43:53,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:43:53,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:43:53,522 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-13 07:43:53,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:43:53,596 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-13 07:43:53,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:43:53,653 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-13 07:43:53,784 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-13 07:43:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:43:53,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:43:56,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:43:56,263 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 342 treesize of output 330 [2022-12-13 07:43:56,267 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 314 treesize of output 302 [2022-12-13 07:43:56,273 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 151 treesize of output 127 [2022-12-13 07:43:56,278 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 278 treesize of output 230 [2022-12-13 07:43:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:43:56,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866012030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:43:56,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:43:56,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 26 [2022-12-13 07:43:56,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286421834] [2022-12-13 07:43:56,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:43:56,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 07:43:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:43:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 07:43:56,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=626, Unknown=6, NotChecked=0, Total=756 [2022-12-13 07:43:56,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 07:43:56,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 8121 transitions, 198642 flow. Second operand has 28 states, 28 states have (on average 5.714285714285714) internal successors, (160), 28 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:43:56,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:43:56,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 07:43:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:47:14,302 INFO L130 PetriNetUnfolder]: 142085/192477 cut-off events. [2022-12-13 07:47:14,302 INFO L131 PetriNetUnfolder]: For 456491/456491 co-relation queries the response was YES. [2022-12-13 07:47:14,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139522 conditions, 192477 events. 142085/192477 cut-off events. For 456491/456491 co-relation queries the response was YES. Maximal size of possible extension queue 5732. Compared 1296464 event pairs, 7861 based on Foata normal form. 7/157841 useless extension candidates. Maximal degree in co-relation 533432. Up to 143782 conditions per place. [2022-12-13 07:47:16,057 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 8361 selfloop transitions, 1211 changer transitions 12/9598 dead transitions. [2022-12-13 07:47:16,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 9598 transitions, 253995 flow [2022-12-13 07:47:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 07:47:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-13 07:47:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 698 transitions. [2022-12-13 07:47:16,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4261294261294261 [2022-12-13 07:47:16,066 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2022-12-13 07:47:16,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 9598 transitions, 253995 flow [2022-12-13 07:47:17,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 240 places, 9586 transitions, 253662 flow [2022-12-13 07:47:18,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:47:18,798 INFO L89 Accepts]: Start accepts. Operand has 240 places, 9586 transitions, 253662 flow [2022-12-13 07:47:18,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:47:18,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:47:18,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 9586 transitions, 253662 flow [2022-12-13 07:47:19,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 9586 transitions, 253662 flow [2022-12-13 07:47:19,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:47:28,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:47:28,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9697 [2022-12-13 07:47:28,495 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 9585 transitions, 253636 flow [2022-12-13 07:47:28,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.714285714285714) internal successors, (160), 28 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:47:28,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:47:28,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:47:28,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 07:47:28,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 07:47:28,702 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:47:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:47:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1720986474, now seen corresponding path program 1 times [2022-12-13 07:47:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:47:28,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217448616] [2022-12-13 07:47:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:47:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:47:28,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:47:28,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217448616] [2022-12-13 07:47:28,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217448616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:47:28,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884358268] [2022-12-13 07:47:28,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:47:28,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:47:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:47:28,825 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:47:28,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:47:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:47:28,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:47:28,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:47:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:47:28,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:47:28,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884358268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:47:28,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:47:28,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 07:47:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346832455] [2022-12-13 07:47:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:47:29,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:47:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:47:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:47:29,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:47:29,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-13 07:47:29,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 9585 transitions, 253636 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:47:29,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:47:29,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-13 07:47:29,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 07:49:13,813 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:49:13,813 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:49:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:49:14,040 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 07:49:14,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:49:14,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 07:49:14,246 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (3states, 4/40 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 1214793 conditions, 101729 events (76099/101728 cut-off events. For 247845/247845 co-relation queries the response was YES. Maximal size of possible extension queue 6755. Compared 688651 event pairs, 3665 based on Foata normal form. 645/89216 useless extension candidates. Maximal degree in co-relation 395466. Up to 74255 conditions per place.). [2022-12-13 07:49:14,247 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 07:49:14,247 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 07:49:14,247 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 07:49:14,247 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 07:49:14,247 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:14,264 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:49:14,264 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:49:14,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:49:14 BasicIcfg [2022-12-13 07:49:14,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:49:14,266 INFO L158 Benchmark]: Toolchain (without parser) took 800613.51ms. Allocated memory was 164.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 140.6MB in the beginning and 941.9MB in the end (delta: -801.3MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-13 07:49:14,266 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 164.6MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:49:14,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.31ms. Allocated memory is still 164.6MB. Free memory was 140.6MB in the beginning and 125.1MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 07:49:14,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.58ms. Allocated memory is still 164.6MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:49:14,267 INFO L158 Benchmark]: Boogie Preprocessor took 43.46ms. Allocated memory is still 164.6MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:49:14,267 INFO L158 Benchmark]: RCFGBuilder took 713.01ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 120.4MB in the beginning and 172.4MB in the end (delta: -52.0MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2022-12-13 07:49:14,267 INFO L158 Benchmark]: TraceAbstraction took 799541.92ms. Allocated memory was 198.2MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 171.3MB in the beginning and 941.9MB in the end (delta: -770.6MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-13 07:49:14,268 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 164.6MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.31ms. Allocated memory is still 164.6MB. Free memory was 140.6MB in the beginning and 125.1MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.58ms. Allocated memory is still 164.6MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.46ms. Allocated memory is still 164.6MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 713.01ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 120.4MB in the beginning and 172.4MB in the end (delta: -52.0MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. * TraceAbstraction took 799541.92ms. Allocated memory was 198.2MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 171.3MB in the beginning and 941.9MB in the end (delta: -770.6MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 204 PlacesBefore, 42 PlacesAfterwards, 210 TransitionsBefore, 35 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 31 ConcurrentYvCompositions, 13 ChoiceCompositions, 175 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 948, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 899, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 899, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 962, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 899, unknown conditional: 0, unknown unconditional: 899] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1343, Positive conditional cache size: 0, Positive unconditional cache size: 1343, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 47 PlacesBefore, 47 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 14, independent unconditional: 16, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 30, independent conditional: 4, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 4, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 49 PlacesBefore, 48 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 32, independent unconditional: 36, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 68, independent conditional: 12, independent unconditional: 56, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 12, independent unconditional: 56, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 72, independent: 67, independent conditional: 11, independent unconditional: 56, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 19.4s, 81 PlacesBefore, 77 PlacesAfterwards, 894 TransitionsBefore, 890 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 117 PlacesBefore, 117 PlacesAfterwards, 2979 TransitionsBefore, 2979 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 131 PlacesBefore, 131 PlacesAfterwards, 4904 TransitionsBefore, 4904 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 149 PlacesBefore, 149 PlacesAfterwards, 6148 TransitionsBefore, 6148 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 143 PlacesBefore, 143 PlacesAfterwards, 3763 TransitionsBefore, 3763 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 160 PlacesBefore, 160 PlacesAfterwards, 5516 TransitionsBefore, 5516 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.4s, 186 PlacesBefore, 185 PlacesAfterwards, 7129 TransitionsBefore, 7128 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.1s, 199 PlacesBefore, 199 PlacesAfterwards, 8121 TransitionsBefore, 8121 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 9.4s, 240 PlacesBefore, 239 PlacesAfterwards, 9586 TransitionsBefore, 9585 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (3states, 4/40 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 1214793 conditions, 101729 events (76099/101728 cut-off events. For 247845/247845 co-relation queries the response was YES. Maximal size of possible extension queue 6755. Compared 688651 event pairs, 3665 based on Foata normal form. 645/89216 useless extension candidates. Maximal degree in co-relation 395466. Up to 74255 conditions per place.). - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (3states, 4/40 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 1214793 conditions, 101729 events (76099/101728 cut-off events. For 247845/247845 co-relation queries the response was YES. Maximal size of possible extension queue 6755. Compared 688651 event pairs, 3665 based on Foata normal form. 645/89216 useless extension candidates. Maximal degree in co-relation 395466. Up to 74255 conditions per place.). - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (3states, 4/40 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 1214793 conditions, 101729 events (76099/101728 cut-off events. For 247845/247845 co-relation queries the response was YES. Maximal size of possible extension queue 6755. Compared 688651 event pairs, 3665 based on Foata normal form. 645/89216 useless extension candidates. Maximal degree in co-relation 395466. Up to 74255 conditions per place.). - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (3states, 4/40 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 1214793 conditions, 101729 events (76099/101728 cut-off events. For 247845/247845 co-relation queries the response was YES. Maximal size of possible extension queue 6755. Compared 688651 event pairs, 3665 based on Foata normal form. 645/89216 useless extension candidates. Maximal degree in co-relation 395466. Up to 74255 conditions per place.). - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (3states, 4/40 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 1214793 conditions, 101729 events (76099/101728 cut-off events. For 247845/247845 co-relation queries the response was YES. Maximal size of possible extension queue 6755. Compared 688651 event pairs, 3665 based on Foata normal form. 645/89216 useless extension candidates. Maximal degree in co-relation 395466. Up to 74255 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 240 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 799.4s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 711.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 211 mSolverCounterUnknown, 5076 SdHoareTripleChecker+Valid, 21.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5076 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 20.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 740 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11817 IncrementalHoareTripleChecker+Invalid, 12768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 740 mSolverCounterUnsat, 9 mSDtfsCounter, 11817 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 384 SyntacticMatches, 12 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2928 ImplicationChecksByTransitivity, 39.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253662occurred in iteration=12, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 643 NumberOfCodeBlocks, 643 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 847 ConstructedInterpolants, 47 QuantifiedInterpolants, 18881 SizeOfPredicates, 249 NumberOfNonLiveVariables, 3202 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 18/65 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown