/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:50:16,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:50:16,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:50:16,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:50:16,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:50:16,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:50:16,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:50:16,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:50:16,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:50:16,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:50:16,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:50:16,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:50:16,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:50:16,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:50:16,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:50:16,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:50:16,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:50:16,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:50:16,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:50:16,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:50:16,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:50:16,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:50:16,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:50:16,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:50:16,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:50:16,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:50:16,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:50:16,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:50:16,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:50:16,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:50:16,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:50:16,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:50:16,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:50:16,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:50:16,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:50:16,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:50:16,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:50:16,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:50:16,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:50:16,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:50:16,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:50:16,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:50:16,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:50:16,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:50:16,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:50:16,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:50:16,989 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:50:16,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:50:16,990 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:50:16,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:50:16,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:50:16,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:50:16,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:50:16,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:50:16,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:50:16,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:50:16,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:50:16,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:50:16,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:50:16,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:50:16,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:50:16,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:50:16,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:50:16,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:50:16,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:50:16,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:50:16,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:50:16,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:50:16,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:50:16,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:50:16,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:50:17,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:50:17,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:50:17,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:50:17,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:50:17,336 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:50:17,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2022-12-06 02:50:18,346 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:50:18,558 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:50:18,558 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2022-12-06 02:50:18,565 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e852d69/df6a7580bc5545b6af75cfb5b4ee12fa/FLAGbf8402b09 [2022-12-06 02:50:18,915 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e852d69/df6a7580bc5545b6af75cfb5b4ee12fa [2022-12-06 02:50:18,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:50:18,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:50:18,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:50:18,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:50:18,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:50:18,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:50:18" (1/1) ... [2022-12-06 02:50:18,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388cd73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:18, skipping insertion in model container [2022-12-06 02:50:18,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:50:18" (1/1) ... [2022-12-06 02:50:18,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:50:18,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:50:19,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,100 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4099,4112] [2022-12-06 02:50:19,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:50:19,115 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:50:19,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:50:19,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:50:19,136 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4099,4112] [2022-12-06 02:50:19,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:50:19,159 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:50:19,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19 WrapperNode [2022-12-06 02:50:19,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:50:19,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:50:19,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:50:19,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:50:19,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,216 INFO L138 Inliner]: procedures = 27, calls = 76, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 303 [2022-12-06 02:50:19,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:50:19,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:50:19,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:50:19,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:50:19,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,255 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:50:19,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:50:19,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:50:19,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:50:19,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (1/1) ... [2022-12-06 02:50:19,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:50:19,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:50:19,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:50:19,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:50:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:50:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:50:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:50:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:50:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:50:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:50:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:50:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:50:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:50:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:50:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:50:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:50:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:50:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:50:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:50:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:50:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:50:19,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:50:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:50:19,356 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:50:19,496 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:50:19,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:50:19,759 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:50:19,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:50:19,881 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 02:50:19,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:50:19 BoogieIcfgContainer [2022-12-06 02:50:19,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:50:19,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:50:19,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:50:19,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:50:19,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:50:18" (1/3) ... [2022-12-06 02:50:19,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c8558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:50:19, skipping insertion in model container [2022-12-06 02:50:19,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:50:19" (2/3) ... [2022-12-06 02:50:19,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83c8558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:50:19, skipping insertion in model container [2022-12-06 02:50:19,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:50:19" (3/3) ... [2022-12-06 02:50:19,888 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2022-12-06 02:50:19,900 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:50:19,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:50:19,900 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:50:19,966 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 02:50:19,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 212 transitions, 456 flow [2022-12-06 02:50:20,074 INFO L130 PetriNetUnfolder]: 18/208 cut-off events. [2022-12-06 02:50:20,075 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:50:20,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 208 events. 18/208 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 106 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 171. Up to 2 conditions per place. [2022-12-06 02:50:20,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 212 transitions, 456 flow [2022-12-06 02:50:20,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 196 transitions, 416 flow [2022-12-06 02:50:20,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:20,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 196 transitions, 416 flow [2022-12-06 02:50:20,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 196 transitions, 416 flow [2022-12-06 02:50:20,169 INFO L130 PetriNetUnfolder]: 18/196 cut-off events. [2022-12-06 02:50:20,169 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:50:20,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 196 events. 18/196 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 106 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 171. Up to 2 conditions per place. [2022-12-06 02:50:20,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 196 transitions, 416 flow [2022-12-06 02:50:20,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-06 02:50:28,517 INFO L203 LiptonReduction]: Total number of compositions: 161 [2022-12-06 02:50:28,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:50:28,541 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;@5b02a331, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:50:28,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 02:50:28,551 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-06 02:50:28,551 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:50:28,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:28,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:28,552 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-06 02:50:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash 5856101, now seen corresponding path program 1 times [2022-12-06 02:50:28,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:28,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475374181] [2022-12-06 02:50:28,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:29,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475374181] [2022-12-06 02:50:29,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475374181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:29,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:29,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:50:29,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494377046] [2022-12-06 02:50:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:29,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:50:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:29,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:50:29,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:50:29,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-06 02:50:29,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:29,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:29,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-06 02:50:29,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:29,291 INFO L130 PetriNetUnfolder]: 1619/2220 cut-off events. [2022-12-06 02:50:29,291 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-12-06 02:50:29,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 2220 events. 1619/2220 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8975 event pairs, 272 based on Foata normal form. 1/1329 useless extension candidates. Maximal degree in co-relation 3420. Up to 1413 conditions per place. [2022-12-06 02:50:29,303 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 43 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2022-12-06 02:50:29,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 239 flow [2022-12-06 02:50:29,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:50:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:50:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-06 02:50:29,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-06 02:50:29,313 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 02:50:29,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:29,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 53 transitions, 239 flow [2022-12-06 02:50:29,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 53 transitions, 239 flow [2022-12-06 02:50:29,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 02:50:29,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:50:29,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 02:50:29,439 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 239 flow [2022-12-06 02:50:29,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:29,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:29,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:29,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:50:29,443 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-06 02:50:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash 233603636, now seen corresponding path program 1 times [2022-12-06 02:50:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:29,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93465535] [2022-12-06 02:50:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:29,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93465535] [2022-12-06 02:50:29,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93465535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:29,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:29,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:50:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552229120] [2022-12-06 02:50:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:29,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:50:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:50:29,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:50:29,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 02:50:29,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:29,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:29,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 02:50:29,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:29,871 INFO L130 PetriNetUnfolder]: 2327/3168 cut-off events. [2022-12-06 02:50:29,871 INFO L131 PetriNetUnfolder]: For 666/684 co-relation queries the response was YES. [2022-12-06 02:50:29,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9264 conditions, 3168 events. 2327/3168 cut-off events. For 666/684 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13474 event pairs, 286 based on Foata normal form. 0/2048 useless extension candidates. Maximal degree in co-relation 7026. Up to 1924 conditions per place. [2022-12-06 02:50:29,922 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 80 selfloop transitions, 3 changer transitions 4/91 dead transitions. [2022-12-06 02:50:29,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 596 flow [2022-12-06 02:50:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:50:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:50:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 02:50:29,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2022-12-06 02:50:29,925 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2022-12-06 02:50:29,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:29,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 91 transitions, 596 flow [2022-12-06 02:50:29,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 91 transitions, 596 flow [2022-12-06 02:50:29,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 02:50:29,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:29,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 02:50:29,953 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 91 transitions, 596 flow [2022-12-06 02:50:29,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:29,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:29,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:29,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:50:29,954 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-06 02:50:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:29,955 INFO L85 PathProgramCache]: Analyzing trace with hash -371551560, now seen corresponding path program 1 times [2022-12-06 02:50:29,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:29,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668341540] [2022-12-06 02:50:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:30,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668341540] [2022-12-06 02:50:30,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668341540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:30,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:30,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:50:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315149300] [2022-12-06 02:50:30,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:30,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:50:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:30,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:50:30,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:50:30,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 02:50:30,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 91 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:30,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:30,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 02:50:30,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:30,407 INFO L130 PetriNetUnfolder]: 3241/4451 cut-off events. [2022-12-06 02:50:30,407 INFO L131 PetriNetUnfolder]: For 2376/2388 co-relation queries the response was YES. [2022-12-06 02:50:30,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16841 conditions, 4451 events. 3241/4451 cut-off events. For 2376/2388 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19728 event pairs, 421 based on Foata normal form. 0/3172 useless extension candidates. Maximal degree in co-relation 12070. Up to 2733 conditions per place. [2022-12-06 02:50:30,431 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 128 selfloop transitions, 4 changer transitions 10/147 dead transitions. [2022-12-06 02:50:30,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 147 transitions, 1263 flow [2022-12-06 02:50:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:50:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:50:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 02:50:30,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 02:50:30,433 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-12-06 02:50:30,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:30,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 147 transitions, 1263 flow [2022-12-06 02:50:30,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 147 transitions, 1263 flow [2022-12-06 02:50:30,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 02:50:30,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:50:30,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 02:50:30,564 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 147 transitions, 1263 flow [2022-12-06 02:50:30,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:30,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:30,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:30,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:50:30,565 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-06 02:50:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1496708505, now seen corresponding path program 1 times [2022-12-06 02:50:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:30,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262680584] [2022-12-06 02:50:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:50:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:30,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262680584] [2022-12-06 02:50:30,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262680584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:30,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:30,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:50:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023202932] [2022-12-06 02:50:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:30,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:50:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:50:30,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:50:30,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2022-12-06 02:50:30,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 147 transitions, 1263 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:30,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:30,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2022-12-06 02:50:30,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:31,240 INFO L130 PetriNetUnfolder]: 4294/6005 cut-off events. [2022-12-06 02:50:31,240 INFO L131 PetriNetUnfolder]: For 5587/5593 co-relation queries the response was YES. [2022-12-06 02:50:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27767 conditions, 6005 events. 4294/6005 cut-off events. For 5587/5593 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29418 event pairs, 768 based on Foata normal form. 0/4471 useless extension candidates. Maximal degree in co-relation 14820. Up to 3766 conditions per place. [2022-12-06 02:50:31,274 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 172 selfloop transitions, 3 changer transitions 23/206 dead transitions. [2022-12-06 02:50:31,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 206 transitions, 2191 flow [2022-12-06 02:50:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:50:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:50:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 02:50:31,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5472972972972973 [2022-12-06 02:50:31,276 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 02:50:31,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:31,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 206 transitions, 2191 flow [2022-12-06 02:50:31,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 206 transitions, 2191 flow [2022-12-06 02:50:31,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 02:50:31,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:50:31,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 652 [2022-12-06 02:50:31,928 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 205 transitions, 2181 flow [2022-12-06 02:50:31,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:31,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:31,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:31,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:50:31,929 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-06 02:50:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash -526373913, now seen corresponding path program 1 times [2022-12-06 02:50:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035032055] [2022-12-06 02:50:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:50:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035032055] [2022-12-06 02:50:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035032055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:32,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:50:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192536857] [2022-12-06 02:50:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:50:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:50:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:50:32,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-06 02:50:32,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 205 transitions, 2181 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-06 02:50:32,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:32,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-06 02:50:32,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:32,750 INFO L130 PetriNetUnfolder]: 5613/7970 cut-off events. [2022-12-06 02:50:32,750 INFO L131 PetriNetUnfolder]: For 10817/10833 co-relation queries the response was YES. [2022-12-06 02:50:32,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43407 conditions, 7970 events. 5613/7970 cut-off events. For 10817/10833 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42288 event pairs, 1392 based on Foata normal form. 0/6150 useless extension candidates. Maximal degree in co-relation 17558. Up to 5047 conditions per place. [2022-12-06 02:50:32,793 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 219 selfloop transitions, 3 changer transitions 52/282 dead transitions. [2022-12-06 02:50:32,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 282 transitions, 3577 flow [2022-12-06 02:50:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:50:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:50:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 02:50:32,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5842105263157895 [2022-12-06 02:50:32,795 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-06 02:50:32,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:32,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 282 transitions, 3577 flow [2022-12-06 02:50:32,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 282 transitions, 3577 flow [2022-12-06 02:50:32,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 02:50:40,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:50:40,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7710 [2022-12-06 02:50:40,506 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 281 transitions, 3565 flow [2022-12-06 02:50:40,506 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-06 02:50:40,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:40,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:40,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:50:40,506 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-06 02:50:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash 857856115, now seen corresponding path program 1 times [2022-12-06 02:50:40,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:40,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385542785] [2022-12-06 02:50:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:50:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:40,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385542785] [2022-12-06 02:50:40,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385542785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:40,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:40,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 02:50:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225414573] [2022-12-06 02:50:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:40,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:50:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:50:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:50:40,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:50:40,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 281 transitions, 3565 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:40,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:40,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:50:40,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:42,146 INFO L130 PetriNetUnfolder]: 9025/12797 cut-off events. [2022-12-06 02:50:42,146 INFO L131 PetriNetUnfolder]: For 30023/30023 co-relation queries the response was YES. [2022-12-06 02:50:42,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76267 conditions, 12797 events. 9025/12797 cut-off events. For 30023/30023 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 68235 event pairs, 706 based on Foata normal form. 0/10551 useless extension candidates. Maximal degree in co-relation 26607. Up to 8172 conditions per place. [2022-12-06 02:50:42,203 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 266 selfloop transitions, 13 changer transitions 158/437 dead transitions. [2022-12-06 02:50:42,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 437 transitions, 6351 flow [2022-12-06 02:50:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:50:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:50:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 02:50:42,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 02:50:42,208 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2022-12-06 02:50:42,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:42,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 437 transitions, 6351 flow [2022-12-06 02:50:42,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 437 transitions, 6351 flow [2022-12-06 02:50:42,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:42,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:42,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 02:50:42,349 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 437 transitions, 6351 flow [2022-12-06 02:50:42,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:42,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:42,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:42,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:50:42,349 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-06 02:50:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -597429623, now seen corresponding path program 2 times [2022-12-06 02:50:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:42,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736316560] [2022-12-06 02:50:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:50:42,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:42,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736316560] [2022-12-06 02:50:42,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736316560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:42,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:42,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:50:42,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534180493] [2022-12-06 02:50:42,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:42,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:50:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:42,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:50:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:50:42,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:50:42,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 437 transitions, 6351 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:42,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:42,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:50:42,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:45,200 INFO L130 PetriNetUnfolder]: 14321/20517 cut-off events. [2022-12-06 02:50:45,200 INFO L131 PetriNetUnfolder]: For 53702/53702 co-relation queries the response was YES. [2022-12-06 02:50:45,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145371 conditions, 20517 events. 14321/20517 cut-off events. For 53702/53702 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 120121 event pairs, 262 based on Foata normal form. 0/16795 useless extension candidates. Maximal degree in co-relation 72829. Up to 14092 conditions per place. [2022-12-06 02:50:45,284 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 702 selfloop transitions, 60 changer transitions 512/1274 dead transitions. [2022-12-06 02:50:45,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 1274 transitions, 20738 flow [2022-12-06 02:50:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:50:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:50:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2022-12-06 02:50:45,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4675 [2022-12-06 02:50:45,286 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2022-12-06 02:50:45,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:45,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 1274 transitions, 20738 flow [2022-12-06 02:50:45,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 1274 transitions, 20738 flow [2022-12-06 02:50:45,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:45,381 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:45,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 02:50:45,382 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 1274 transitions, 20738 flow [2022-12-06 02:50:45,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:45,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:45,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:45,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:50:45,382 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-06 02:50:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -764615309, now seen corresponding path program 3 times [2022-12-06 02:50:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:45,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624305251] [2022-12-06 02:50:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:50:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:45,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624305251] [2022-12-06 02:50:45,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624305251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:45,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:45,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:50:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497776098] [2022-12-06 02:50:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:45,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:50:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:50:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:50:45,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:50:45,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 1274 transitions, 20738 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:45,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:45,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:50:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:49,294 INFO L130 PetriNetUnfolder]: 14929/21641 cut-off events. [2022-12-06 02:50:49,294 INFO L131 PetriNetUnfolder]: For 51479/51479 co-relation queries the response was YES. [2022-12-06 02:50:49,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175137 conditions, 21641 events. 14929/21641 cut-off events. For 51479/51479 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 129708 event pairs, 548 based on Foata normal form. 0/17823 useless extension candidates. Maximal degree in co-relation 86040. Up to 14488 conditions per place. [2022-12-06 02:50:49,429 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 794 selfloop transitions, 59 changer transitions 1168/2021 dead transitions. [2022-12-06 02:50:49,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 2021 transitions, 36750 flow [2022-12-06 02:50:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:50:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:50:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-06 02:50:49,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2022-12-06 02:50:49,436 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2022-12-06 02:50:49,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:49,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 2021 transitions, 36750 flow [2022-12-06 02:50:49,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 2021 transitions, 36750 flow [2022-12-06 02:50:49,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:49,604 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:49,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 02:50:49,607 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 2021 transitions, 36750 flow [2022-12-06 02:50:49,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:49,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:49,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:49,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:50:49,608 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-06 02:50:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -515538835, now seen corresponding path program 4 times [2022-12-06 02:50:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:49,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132780038] [2022-12-06 02:50:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:50:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:49,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132780038] [2022-12-06 02:50:49,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132780038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:49,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:50:49,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:50:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561388699] [2022-12-06 02:50:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:49,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:50:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:49,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:50:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:50:49,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:50:49,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 2021 transitions, 36750 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:49,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:49,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:50:49,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:55,225 INFO L130 PetriNetUnfolder]: 15913/23041 cut-off events. [2022-12-06 02:50:55,225 INFO L131 PetriNetUnfolder]: For 63012/63012 co-relation queries the response was YES. [2022-12-06 02:50:55,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210063 conditions, 23041 events. 15913/23041 cut-off events. For 63012/63012 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 139601 event pairs, 492 based on Foata normal form. 208/19171 useless extension candidates. Maximal degree in co-relation 104127. Up to 15888 conditions per place. [2022-12-06 02:50:55,349 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 861 selfloop transitions, 64 changer transitions 1238/2163 dead transitions. [2022-12-06 02:50:55,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 2163 transitions, 43612 flow [2022-12-06 02:50:55,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:50:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:50:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-06 02:50:55,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 02:50:55,351 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2022-12-06 02:50:55,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:55,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 2163 transitions, 43612 flow [2022-12-06 02:50:55,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 2163 transitions, 43612 flow [2022-12-06 02:50:55,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:55,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:55,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 02:50:55,535 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 2163 transitions, 43612 flow [2022-12-06 02:50:55,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:55,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:55,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:55,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 02:50:55,535 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-06 02:50:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -351443661, now seen corresponding path program 5 times [2022-12-06 02:50:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:55,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692857713] [2022-12-06 02:50:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:55,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:55,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692857713] [2022-12-06 02:50:55,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692857713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:50:55,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136464128] [2022-12-06 02:50:55,796 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:50:55,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:55,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:50:55,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:50:55,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:50:55,913 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:50:55,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:50:55,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:50:55,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:50:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:50:56,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:50:56,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136464128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:50:56,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:50:56,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-12-06 02:50:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089971600] [2022-12-06 02:50:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:50:56,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:50:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:50:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:50:56,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:50:56,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 2163 transitions, 43612 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:56,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:56,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:50:56,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:51:04,686 INFO L130 PetriNetUnfolder]: 20495/30503 cut-off events. [2022-12-06 02:51:04,686 INFO L131 PetriNetUnfolder]: For 84829/84829 co-relation queries the response was YES. [2022-12-06 02:51:04,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312055 conditions, 30503 events. 20495/30503 cut-off events. For 84829/84829 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 203517 event pairs, 868 based on Foata normal form. 102/25887 useless extension candidates. Maximal degree in co-relation 139691. Up to 17722 conditions per place. [2022-12-06 02:51:04,855 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 1361 selfloop transitions, 187 changer transitions 3322/4870 dead transitions. [2022-12-06 02:51:04,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 4870 transitions, 108696 flow [2022-12-06 02:51:04,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:51:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:51:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2022-12-06 02:51:04,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 02:51:04,857 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2022-12-06 02:51:04,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:51:04,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 4870 transitions, 108696 flow [2022-12-06 02:51:05,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 4870 transitions, 108696 flow [2022-12-06 02:51:05,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:51:05,127 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:51:05,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 02:51:05,128 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 4870 transitions, 108696 flow [2022-12-06 02:51:05,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:51:05,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:51:05,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:51:05,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:51:05,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 02:51:05,335 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-06 02:51:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:51:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1335142679, now seen corresponding path program 6 times [2022-12-06 02:51:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:51:05,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618595909] [2022-12-06 02:51:05,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:51:05,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:51:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:51:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:51:05,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:51:05,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618595909] [2022-12-06 02:51:05,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618595909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:51:05,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623464453] [2022-12-06 02:51:05,609 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:51:05,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:51:05,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:51:05,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:51:05,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:51:05,791 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:51:05,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:51:05,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:51:05,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:51:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:51:05,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:51:05,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623464453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:51:05,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:51:05,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 02:51:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877802222] [2022-12-06 02:51:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:51:05,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:51:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:51:05,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:51:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:51:05,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:51:05,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 4870 transitions, 108696 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:51:05,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:51:05,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:51:05,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:51:28,054 INFO L130 PetriNetUnfolder]: 25633/38072 cut-off events. [2022-12-06 02:51:28,054 INFO L131 PetriNetUnfolder]: For 102905/102905 co-relation queries the response was YES. [2022-12-06 02:51:28,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429442 conditions, 38072 events. 25633/38072 cut-off events. For 102905/102905 co-relation queries the response was YES. Maximal size of possible extension queue 1499. Compared 261285 event pairs, 956 based on Foata normal form. 0/32054 useless extension candidates. Maximal degree in co-relation 191611. Up to 22271 conditions per place. [2022-12-06 02:51:28,262 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 1778 selfloop transitions, 272 changer transitions 4390/6440 dead transitions. [2022-12-06 02:51:28,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 6440 transitions, 156446 flow [2022-12-06 02:51:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:51:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:51:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2022-12-06 02:51:28,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.503125 [2022-12-06 02:51:28,263 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2022-12-06 02:51:28,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:51:28,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 6440 transitions, 156446 flow [2022-12-06 02:51:28,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 6440 transitions, 156446 flow [2022-12-06 02:51:28,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:51:28,587 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:51:28,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-06 02:51:28,588 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 6440 transitions, 156446 flow [2022-12-06 02:51:28,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:51:28,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:51:28,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:51:28,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:51:28,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 02:51:28,794 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-06 02:51:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:51:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1779755073, now seen corresponding path program 7 times [2022-12-06 02:51:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:51:28,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755066485] [2022-12-06 02:51:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:51:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:51:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:51:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:51:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:51:29,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755066485] [2022-12-06 02:51:29,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755066485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:51:29,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386400136] [2022-12-06 02:51:29,009 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:51:29,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:51:29,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:51:29,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:51:29,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:51:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:51:29,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 02:51:29,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:51:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:51:29,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:51:29,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386400136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:51:29,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:51:29,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2022-12-06 02:51:29,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448003504] [2022-12-06 02:51:29,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:51:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:51:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:51:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:51:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:51:29,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:51:29,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 6440 transitions, 156446 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:51:29,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:51:29,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:51:29,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:52:07,079 INFO L130 PetriNetUnfolder]: 26953/39900 cut-off events. [2022-12-06 02:52:07,080 INFO L131 PetriNetUnfolder]: For 106291/106291 co-relation queries the response was YES. [2022-12-06 02:52:07,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490635 conditions, 39900 events. 26953/39900 cut-off events. For 106291/106291 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 274430 event pairs, 982 based on Foata normal form. 378/33912 useless extension candidates. Maximal degree in co-relation 224152. Up to 24099 conditions per place. [2022-12-06 02:52:07,312 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 1765 selfloop transitions, 253 changer transitions 4745/6763 dead transitions. [2022-12-06 02:52:07,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 6763 transitions, 177622 flow [2022-12-06 02:52:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:52:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:52:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-06 02:52:07,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-06 02:52:07,315 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2022-12-06 02:52:07,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:52:07,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 6763 transitions, 177622 flow [2022-12-06 02:52:07,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 6763 transitions, 177622 flow [2022-12-06 02:52:07,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:52:07,671 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:52:07,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-06 02:52:07,672 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 6763 transitions, 177622 flow [2022-12-06 02:52:07,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:52:07,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:52:07,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:52:07,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 02:52:07,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:52:07,877 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-06 02:52:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:52:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 368092201, now seen corresponding path program 8 times [2022-12-06 02:52:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:52:07,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297247686] [2022-12-06 02:52:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:52:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:52:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:52:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:52:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:52:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297247686] [2022-12-06 02:52:08,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297247686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:52:08,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421450936] [2022-12-06 02:52:08,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:52:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:52:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:52:08,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:52:08,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:52:08,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:52:08,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:52:08,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 02:52:08,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:52:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:52:08,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:52:08,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421450936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:52:08,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:52:08,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 02:52:08,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944874587] [2022-12-06 02:52:08,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:52:08,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:52:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:52:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:52:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:52:08,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:52:08,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 6763 transitions, 177622 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:52:08,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:52:08,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:52:08,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:52:55,964 INFO L130 PetriNetUnfolder]: 30219/44746 cut-off events. [2022-12-06 02:52:55,965 INFO L131 PetriNetUnfolder]: For 116209/116209 co-relation queries the response was YES. [2022-12-06 02:52:56,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595802 conditions, 44746 events. 30219/44746 cut-off events. For 116209/116209 co-relation queries the response was YES. Maximal size of possible extension queue 1800. Compared 313527 event pairs, 986 based on Foata normal form. 208/37852 useless extension candidates. Maximal degree in co-relation 280204. Up to 28945 conditions per place. [2022-12-06 02:52:56,242 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 2141 selfloop transitions, 318 changer transitions 5133/7592 dead transitions. [2022-12-06 02:52:56,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 7592 transitions, 214228 flow [2022-12-06 02:52:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:52:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:52:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-12-06 02:52:56,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 02:52:56,243 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2022-12-06 02:52:56,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:52:56,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 7592 transitions, 214228 flow [2022-12-06 02:52:56,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 7592 transitions, 214228 flow [2022-12-06 02:52:56,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:52:56,874 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:52:56,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 631 [2022-12-06 02:52:56,874 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 7592 transitions, 214228 flow [2022-12-06 02:52:56,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:52:56,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:52:56,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:52:56,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 02:52:57,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:52:57,080 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:52:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:52:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1739020761, now seen corresponding path program 9 times [2022-12-06 02:52:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:52:57,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295020966] [2022-12-06 02:52:57,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:52:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:52:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:52:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:52:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:52:57,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295020966] [2022-12-06 02:52:57,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295020966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:52:57,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:52:57,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:52:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343487386] [2022-12-06 02:52:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:52:57,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:52:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:52:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:52:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:52:57,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:52:57,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 7592 transitions, 214228 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:52:57,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:52:57,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:52:57,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:47,422 INFO L130 PetriNetUnfolder]: 29123/43062 cut-off events. [2022-12-06 02:53:47,422 INFO L131 PetriNetUnfolder]: For 112136/112136 co-relation queries the response was YES. [2022-12-06 02:53:47,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616205 conditions, 43062 events. 29123/43062 cut-off events. For 112136/112136 co-relation queries the response was YES. Maximal size of possible extension queue 1742. Compared 299640 event pairs, 978 based on Foata normal form. 0/36364 useless extension candidates. Maximal degree in co-relation 289729. Up to 27261 conditions per place. [2022-12-06 02:53:47,669 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 1989 selfloop transitions, 227 changer transitions 5308/7524 dead transitions. [2022-12-06 02:53:47,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 7524 transitions, 227300 flow [2022-12-06 02:53:47,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:53:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:53:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-06 02:53:47,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 02:53:47,671 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2022-12-06 02:53:47,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:47,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 7524 transitions, 227300 flow [2022-12-06 02:53:48,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 7524 transitions, 227300 flow [2022-12-06 02:53:48,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:48,232 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:48,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 562 [2022-12-06 02:53:48,233 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 7524 transitions, 227300 flow [2022-12-06 02:53:48,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:48,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:48,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:48,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 02:53:48,233 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:53:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash -131933042, now seen corresponding path program 1 times [2022-12-06 02:53:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:48,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416046254] [2022-12-06 02:53:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:53:48,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:48,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416046254] [2022-12-06 02:53:48,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416046254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:53:48,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:53:48,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:53:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799674561] [2022-12-06 02:53:48,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:53:48,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:53:48,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:48,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:53:48,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:53:48,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:53:48,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 7524 transitions, 227300 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:48,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:48,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:53:48,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:54:48,692 INFO L130 PetriNetUnfolder]: 30571/45926 cut-off events. [2022-12-06 02:54:48,692 INFO L131 PetriNetUnfolder]: For 127201/127201 co-relation queries the response was YES. [2022-12-06 02:54:48,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703732 conditions, 45926 events. 30571/45926 cut-off events. For 127201/127201 co-relation queries the response was YES. Maximal size of possible extension queue 1956. Compared 333360 event pairs, 978 based on Foata normal form. 0/39484 useless extension candidates. Maximal degree in co-relation 319260. Up to 28110 conditions per place. [2022-12-06 02:54:48,966 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 1922 selfloop transitions, 170 changer transitions 6440/8532 dead transitions. [2022-12-06 02:54:48,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 8532 transitions, 275388 flow [2022-12-06 02:54:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:54:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:54:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-06 02:54:48,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2022-12-06 02:54:48,968 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2022-12-06 02:54:48,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:54:48,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 8532 transitions, 275388 flow [2022-12-06 02:54:49,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 8532 transitions, 275388 flow [2022-12-06 02:54:49,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:54:49,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:54:49,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 567 [2022-12-06 02:54:49,535 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 8532 transitions, 275388 flow [2022-12-06 02:54:49,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:54:49,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:54:49,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:54:49,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 02:54:49,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:54:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:54:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1181149160, now seen corresponding path program 2 times [2022-12-06 02:54:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:54:49,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515611533] [2022-12-06 02:54:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:54:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:54:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:54:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:54:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:54:49,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515611533] [2022-12-06 02:54:49,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515611533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:54:49,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15858653] [2022-12-06 02:54:49,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:54:49,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:54:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:54:49,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:54:49,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:54:49,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:54:49,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:54:49,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:54:49,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:54:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:54:50,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:54:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:54:50,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15858653] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:54:50,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:54:50,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2022-12-06 02:54:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860642051] [2022-12-06 02:54:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:54:50,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:54:50,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:54:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:54:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:54:50,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:54:50,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 8532 transitions, 275388 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:54:50,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:54:50,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:54:50,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:24,559 INFO L130 PetriNetUnfolder]: 36337/54448 cut-off events. [2022-12-06 02:56:24,560 INFO L131 PetriNetUnfolder]: For 146118/146118 co-relation queries the response was YES. [2022-12-06 02:56:24,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888891 conditions, 54448 events. 36337/54448 cut-off events. For 146118/146118 co-relation queries the response was YES. Maximal size of possible extension queue 2212. Compared 400643 event pairs, 1236 based on Foata normal form. 160/46390 useless extension candidates. Maximal degree in co-relation 417079. Up to 35527 conditions per place. [2022-12-06 02:56:24,920 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 2390 selfloop transitions, 175 changer transitions 6528/9093 dead transitions. [2022-12-06 02:56:24,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 9093 transitions, 311584 flow [2022-12-06 02:56:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:56:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:56:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-12-06 02:56:24,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 02:56:24,921 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2022-12-06 02:56:24,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:24,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 9093 transitions, 311584 flow [2022-12-06 02:56:25,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 9093 transitions, 311584 flow [2022-12-06 02:56:25,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:56:25,519 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:25,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 599 [2022-12-06 02:56:25,520 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 9093 transitions, 311584 flow [2022-12-06 02:56:25,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:25,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:25,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:25,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:56:25,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 02:56:25,727 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:56:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash -694464050, now seen corresponding path program 3 times [2022-12-06 02:56:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:25,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818057611] [2022-12-06 02:56:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:56:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818057611] [2022-12-06 02:56:25,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818057611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:56:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101400919] [2022-12-06 02:56:25,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:56:25,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:56:25,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:25,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:56:25,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:56:26,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:56:26,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:56:26,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:56:26,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:56:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:56:26,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:56:26,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101400919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:56:26,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:56:26,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 02:56:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200850508] [2022-12-06 02:56:26,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:56:26,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:56:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:56:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:56:26,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:56:26,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 9093 transitions, 311584 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:26,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:26,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:56:26,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:10,416 INFO L130 PetriNetUnfolder]: 35783/53720 cut-off events. [2022-12-06 02:58:10,416 INFO L131 PetriNetUnfolder]: For 140891/140891 co-relation queries the response was YES. [2022-12-06 02:58:10,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930202 conditions, 53720 events. 35783/53720 cut-off events. For 140891/140891 co-relation queries the response was YES. Maximal size of possible extension queue 2181. Compared 396245 event pairs, 308 based on Foata normal form. 0/45874 useless extension candidates. Maximal degree in co-relation 446286. Up to 34799 conditions per place. [2022-12-06 02:58:10,752 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 2391 selfloop transitions, 153 changer transitions 6685/9229 dead transitions. [2022-12-06 02:58:10,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 9229 transitions, 334467 flow [2022-12-06 02:58:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:58:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:58:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-12-06 02:58:10,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2022-12-06 02:58:10,754 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2022-12-06 02:58:10,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:10,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 9229 transitions, 334467 flow [2022-12-06 02:58:11,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 9229 transitions, 334467 flow [2022-12-06 02:58:11,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:11,530 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:58:11,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 776 [2022-12-06 02:58:11,530 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 9229 transitions, 334467 flow [2022-12-06 02:58:11,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:58:11,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:11,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:58:11,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 02:58:11,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:58:11,739 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:58:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1926664602, now seen corresponding path program 4 times [2022-12-06 02:58:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:11,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278666684] [2022-12-06 02:58:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:58:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278666684] [2022-12-06 02:58:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278666684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:58:11,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:58:11,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:58:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729561432] [2022-12-06 02:58:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:58:11,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:58:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:11,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:58:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:58:11,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 02:58:11,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 9229 transitions, 334467 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:58:11,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:11,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 02:58:11,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:00:06,543 INFO L130 PetriNetUnfolder]: 39073/58722 cut-off events. [2022-12-06 03:00:06,543 INFO L131 PetriNetUnfolder]: For 165858/165858 co-relation queries the response was YES. [2022-12-06 03:00:06,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076219 conditions, 58722 events. 39073/58722 cut-off events. For 165858/165858 co-relation queries the response was YES. Maximal size of possible extension queue 2384. Compared 439947 event pairs, 358 based on Foata normal form. 1156/50894 useless extension candidates. Maximal degree in co-relation 537489. Up to 39801 conditions per place. [2022-12-06 03:00:06,905 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 2665 selfloop transitions, 176 changer transitions 7150/9991 dead transitions. [2022-12-06 03:00:06,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 9991 transitions, 381873 flow [2022-12-06 03:00:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:00:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:00:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-12-06 03:00:06,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2022-12-06 03:00:06,908 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2022-12-06 03:00:06,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:00:06,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 9991 transitions, 381873 flow [2022-12-06 03:00:07,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 9991 transitions, 381873 flow [2022-12-06 03:00:07,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:00:07,753 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:00:07,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 849 [2022-12-06 03:00:07,757 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 9991 transitions, 381873 flow [2022-12-06 03:00:07,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:00:07,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:00:07,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:00:07,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 03:00:07,757 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 03:00:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:00:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1502340126, now seen corresponding path program 5 times [2022-12-06 03:00:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:00:07,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925117210] [2022-12-06 03:00:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:00:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:00:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:00:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:00:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:00:08,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925117210] [2022-12-06 03:00:08,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925117210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:00:08,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:00:08,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:00:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366706603] [2022-12-06 03:00:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:00:08,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:00:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:00:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:00:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:00:08,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 03:00:08,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 9991 transitions, 381873 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:00:08,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:00:08,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 03:00:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:02:43,368 INFO L130 PetriNetUnfolder]: 42361/63534 cut-off events. [2022-12-06 03:02:43,369 INFO L131 PetriNetUnfolder]: For 178072/178072 co-relation queries the response was YES. [2022-12-06 03:02:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229440 conditions, 63534 events. 42361/63534 cut-off events. For 178072/178072 co-relation queries the response was YES. Maximal size of possible extension queue 2623. Compared 479510 event pairs, 436 based on Foata normal form. 102/54144 useless extension candidates. Maximal degree in co-relation 602641. Up to 41893 conditions per place. [2022-12-06 03:02:43,844 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 2925 selfloop transitions, 195 changer transitions 8914/12034 dead transitions. [2022-12-06 03:02:43,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 12034 transitions, 484075 flow [2022-12-06 03:02:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:02:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:02:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-06 03:02:43,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 03:02:43,846 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2022-12-06 03:02:43,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:02:43,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 12034 transitions, 484075 flow [2022-12-06 03:02:44,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 12034 transitions, 484075 flow [2022-12-06 03:02:44,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:02:44,755 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:02:44,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 912 [2022-12-06 03:02:44,758 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 12034 transitions, 484075 flow [2022-12-06 03:02:44,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:02:44,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:02:44,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:02:44,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 03:02:44,759 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 03:02:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:02:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1784605780, now seen corresponding path program 6 times [2022-12-06 03:02:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:02:44,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409754833] [2022-12-06 03:02:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:02:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:02:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:02:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:02:45,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:02:45,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409754833] [2022-12-06 03:02:45,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409754833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:02:45,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:02:45,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:02:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254220939] [2022-12-06 03:02:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:02:45,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:02:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:02:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:02:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:02:45,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 03:02:45,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 12034 transitions, 484075 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:02:45,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:02:45,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 03:02:45,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 03:04:21,441 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:04:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:04:21,486 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 03:04:21,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 03:04:21,486 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/40 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 693776 conditions, 34219 events (23445/34218 cut-off events. For 115971/115971 co-relation queries the response was YES. Maximal size of possible extension queue 2939. Compared 255379 event pairs, 44 based on Foata normal form. 366/32423 useless extension candidates. Maximal degree in co-relation 271145. Up to 22810 conditions per place.). [2022-12-06 03:04:21,487 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 03:04:21,488 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 03:04:21,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 03:04:21,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 03:04:21,492 INFO L458 BasicCegarLoop]: Path program histogram: [9, 6, 1, 1, 1, 1, 1] [2022-12-06 03:04:21,494 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:04:21,494 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:04:21,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:04:21 BasicIcfg [2022-12-06 03:04:21,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:04:21,497 INFO L158 Benchmark]: Toolchain (without parser) took 842579.18ms. Allocated memory was 182.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 158.1MB in the beginning and 964.7MB in the end (delta: -806.7MB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-06 03:04:21,497 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:04:21,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.24ms. Allocated memory is still 182.5MB. Free memory was 158.1MB in the beginning and 142.8MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 03:04:21,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.48ms. Allocated memory is still 182.5MB. Free memory was 142.8MB in the beginning and 140.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:04:21,498 INFO L158 Benchmark]: Boogie Preprocessor took 41.75ms. Allocated memory is still 182.5MB. Free memory was 139.7MB in the beginning and 138.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:04:21,498 INFO L158 Benchmark]: RCFGBuilder took 624.25ms. Allocated memory is still 182.5MB. Free memory was 137.6MB in the beginning and 94.6MB in the end (delta: 43.0MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-12-06 03:04:21,498 INFO L158 Benchmark]: TraceAbstraction took 841612.24ms. Allocated memory was 182.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 94.1MB in the beginning and 964.7MB in the end (delta: -870.7MB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-12-06 03:04:21,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.24ms. Allocated memory is still 182.5MB. Free memory was 158.1MB in the beginning and 142.8MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.48ms. Allocated memory is still 182.5MB. Free memory was 142.8MB in the beginning and 140.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.75ms. Allocated memory is still 182.5MB. Free memory was 139.7MB in the beginning and 138.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 624.25ms. Allocated memory is still 182.5MB. Free memory was 137.6MB in the beginning and 94.6MB in the end (delta: 43.0MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 841612.24ms. Allocated memory was 182.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 94.1MB in the beginning and 964.7MB in the end (delta: -870.7MB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 191 PlacesBefore, 42 PlacesAfterwards, 196 TransitionsBefore, 35 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 118 TrivialYvCompositions, 31 ConcurrentYvCompositions, 12 ChoiceCompositions, 161 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 940, independent: 926, independent conditional: 926, 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: 940, independent: 926, independent conditional: 0, independent unconditional: 926, 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: 940, independent: 926, independent conditional: 0, independent unconditional: 926, 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: 940, independent: 926, independent conditional: 0, independent unconditional: 926, 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: 877, independent: 868, independent conditional: 0, independent unconditional: 868, 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: 877, independent: 867, independent conditional: 0, independent unconditional: 867, 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: 27, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 940, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 877, unknown conditional: 0, unknown unconditional: 877] , Statistics on independence cache: Total cache size (in pairs): 1308, Positive cache size: 1299, Positive conditional cache size: 0, Positive unconditional cache size: 1299, 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.1s, 44 PlacesBefore, 44 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 48 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 51 PlacesBefore, 50 PlacesAfterwards, 206 TransitionsBefore, 205 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 54 PlacesBefore, 53 PlacesAfterwards, 282 TransitionsBefore, 281 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 437 TransitionsBefore, 437 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 1274 TransitionsBefore, 1274 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 2021 TransitionsBefore, 2021 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 2163 TransitionsBefore, 2163 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 4870 TransitionsBefore, 4870 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 6440 TransitionsBefore, 6440 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 6763 TransitionsBefore, 6763 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 7592 TransitionsBefore, 7592 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 7524 TransitionsBefore, 7524 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 8532 TransitionsBefore, 8532 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 121 PlacesBefore, 121 PlacesAfterwards, 9093 TransitionsBefore, 9093 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 127 PlacesBefore, 127 PlacesAfterwards, 9229 TransitionsBefore, 9229 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 9991 TransitionsBefore, 9991 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 140 PlacesBefore, 140 PlacesAfterwards, 12034 TransitionsBefore, 12034 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/40 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 693776 conditions, 34219 events (23445/34218 cut-off events. For 115971/115971 co-relation queries the response was YES. Maximal size of possible extension queue 2939. Compared 255379 event pairs, 44 based on Foata normal form. 366/32423 useless extension candidates. Maximal degree in co-relation 271145. Up to 22810 conditions per place.). - TimeoutResultAtElement [Line: 139]: 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 (6states, 0/40 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 693776 conditions, 34219 events (23445/34218 cut-off events. For 115971/115971 co-relation queries the response was YES. Maximal size of possible extension queue 2939. Compared 255379 event pairs, 44 based on Foata normal form. 366/32423 useless extension candidates. Maximal degree in co-relation 271145. Up to 22810 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 (6states, 0/40 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 693776 conditions, 34219 events (23445/34218 cut-off events. For 115971/115971 co-relation queries the response was YES. Maximal size of possible extension queue 2939. Compared 255379 event pairs, 44 based on Foata normal form. 366/32423 useless extension candidates. Maximal degree in co-relation 271145. Up to 22810 conditions per place.). - TimeoutResultAtElement [Line: 138]: 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 (6states, 0/40 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 693776 conditions, 34219 events (23445/34218 cut-off events. For 115971/115971 co-relation queries the response was YES. Maximal size of possible extension queue 2939. Compared 255379 event pairs, 44 based on Foata normal form. 366/32423 useless extension candidates. Maximal degree in co-relation 271145. Up to 22810 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 (6states, 0/40 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 693776 conditions, 34219 events (23445/34218 cut-off events. For 115971/115971 co-relation queries the response was YES. Maximal size of possible extension queue 2939. Compared 255379 event pairs, 44 based on Foata normal form. 366/32423 useless extension candidates. Maximal degree in co-relation 271145. Up to 22810 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 227 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: 841.5s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 809.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1646 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1646 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5281 IncrementalHoareTripleChecker+Invalid, 5374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 34 mSDtfsCounter, 5281 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=484075occurred in iteration=19, InterpolantAutomatonStates: 119, 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.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 753 NumberOfCodeBlocks, 753 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 755 ConstructedInterpolants, 0 QuantifiedInterpolants, 4952 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2048 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 42/50 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