/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:51:49,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:51:49,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:51:49,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:51:49,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:51:49,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:51:49,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:51:49,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:51:49,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:51:49,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:51:49,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:51:49,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:51:49,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:51:49,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:51:49,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:51:49,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:51:49,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:51:49,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:51:49,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:51:49,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:51:49,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:51:49,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:51:49,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:51:49,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:51:49,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:51:49,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:51:49,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:51:49,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:51:49,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:51:49,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:51:49,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:51:49,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:51:49,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:51:49,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:51:49,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:51:49,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:51:49,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:51:49,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:51:49,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:51:49,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:51:49,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:51:49,119 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 03:51:49,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:51:49,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:51:49,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:51:49,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:51:49,153 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:51:49,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:51:49,154 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:51:49,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:51:49,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:51:49,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:51:49,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:51:49,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:51:49,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:51:49,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:51:49,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:51:49,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:51:49,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:51:49,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:51:49,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:51:49,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:51:49,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:51:49,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:49,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:51:49,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:51:49,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:51:49,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:51:49,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:51:49,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:51:49,158 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 [2022-12-06 03:51:49,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:51:49,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:51:49,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:51:49,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:51:49,533 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:51:49,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-5.i [2022-12-06 03:51:50,730 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:51:51,006 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:51:51,007 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i [2022-12-06 03:51:51,045 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2c5db01/69aebc57666144a4a7fe479249bc1ec5/FLAG10d28a236 [2022-12-06 03:51:51,059 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2c5db01/69aebc57666144a4a7fe479249bc1ec5 [2022-12-06 03:51:51,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:51:51,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:51:51,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:51,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:51:51,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:51:51,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cfb0f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51, skipping insertion in model container [2022-12-06 03:51:51,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:51:51,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:51:51,348 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i[30241,30254] [2022-12-06 03:51:51,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,376 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:51:51,409 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i[30241,30254] [2022-12-06 03:51:51,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,442 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:51:51,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51 WrapperNode [2022-12-06 03:51:51,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:51,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:51:51,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:51:51,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,480 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-06 03:51:51,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:51:51,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:51:51,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,517 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:51:51,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:51:51,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:51:51,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:51,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:51,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:51:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 03:51:51,612 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 03:51:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 03:51:51,612 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 03:51:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:51:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:51:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:51:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:51:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:51:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:51:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:51:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:51:51,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:51:51,615 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:51:51,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:51:51,751 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:51:51,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:51:51,937 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:51:51,942 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:51:51,942 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:51:51,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:51 BoogieIcfgContainer [2022-12-06 03:51:51,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:51:51,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:51:51,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:51:51,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:51:51,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:51:51" (1/3) ... [2022-12-06 03:51:51,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293b82cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:51, skipping insertion in model container [2022-12-06 03:51:51,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (2/3) ... [2022-12-06 03:51:51,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293b82cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:51, skipping insertion in model container [2022-12-06 03:51:51,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:51" (3/3) ... [2022-12-06 03:51:51,949 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-5.i [2022-12-06 03:51:51,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:51:51,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:51:51,964 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:51:52,024 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 03:51:52,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:52,118 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:52,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:52,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 03:51:52,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:52,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:52,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,167 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:52,167 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:52,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 03:51:52,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 03:51:55,373 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-06 03:51:55,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:51:55,387 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;@39557f9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:51:55,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:51:55,389 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-06 03:51:55,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-06 03:51:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738045073] [2022-12-06 03:51:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738045073] [2022-12-06 03:51:55,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738045073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:51:55,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:51:55,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:51:55,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327215104] [2022-12-06 03:51:55,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:51:55,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:51:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:51:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:51:55,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:55,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 34 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:51:55,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:55,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:55,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:55,609 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 03:51:55,610 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:51:55,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 149 events. 97/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 20 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 300. Up to 91 conditions per place. [2022-12-06 03:51:55,611 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-06 03:51:55,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:51:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:51:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 03:51:55,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 03:51:55,620 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-06 03:51:55,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:51:55,622 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=14} [2022-12-06 03:51:55,626 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 03:51:55,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:55,626 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:55,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:55,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,631 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 03:51:55,631 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 14 events. 3/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2022-12-06 03:51:55,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 03:51:55,632 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:51:55,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 03:51:55,633 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:51:55,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:51:55,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-06 03:51:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641873061] [2022-12-06 03:51:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641873061] [2022-12-06 03:51:55,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641873061] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947854887] [2022-12-06 03:51:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:55,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:55,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:55,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:51:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:55,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947854887] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:55,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:55,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869526660] [2022-12-06 03:51:55,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:55,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:55,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 03:51:55,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:55,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:55,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 03:51:55,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:55,876 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:55,877 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:55,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 203 events. 133/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 03:51:55,878 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:55,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:55,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 03:51:55,880 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-06 03:51:55,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:55,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:51:55,881 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 03:51:55,881 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:55,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:55,881 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:55,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:55,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,885 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:55,885 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:55,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 03:51:55,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:56,083 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:56,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 03:51:56,084 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:56,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:56,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:56,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:56,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:56,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-06 03:51:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:56,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070041498] [2022-12-06 03:51:56,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:56,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070041498] [2022-12-06 03:51:56,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070041498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:56,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762223309] [2022-12-06 03:51:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:56,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:56,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:51:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:56,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:56,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:56,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762223309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:56,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:56,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248924042] [2022-12-06 03:51:56,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:56,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:56,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:56,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:56,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:56,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:56,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:56,587 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:56,588 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 03:51:56,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-06 03:51:56,593 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:56,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:56,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 03:51:56,595 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 03:51:56,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 03:51:56,600 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 03:51:56,606 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:56,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:56,607 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:56,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:56,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,611 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:56,611 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:56,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 03:51:56,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:56,795 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:56,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 03:51:56,796 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:56,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:56,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:56,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:56,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:56,996 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,SelfDestructingSolverStorable2 [2022-12-06 03:51:56,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-06 03:51:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004942291] [2022-12-06 03:51:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004942291] [2022-12-06 03:51:57,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004942291] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417801979] [2022-12-06 03:51:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:57,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:51:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:57,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417801979] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:57,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:57,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56829823] [2022-12-06 03:51:57,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:57,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:57,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:57,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:57,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:57,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:57,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:57,187 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:57,187 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-06 03:51:57,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 176 events. 115/176 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 489. Up to 64 conditions per place. [2022-12-06 03:51:57,189 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:57,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:57,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:57,192 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:57,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:57,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 03:51:57,194 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:57,195 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:57,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:57,196 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:57,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:57,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,201 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:57,201 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:57,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:57,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:57,321 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:57,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 03:51:57,322 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:57,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:57,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:57,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:57,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:57,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149196, now seen corresponding path program 1 times [2022-12-06 03:51:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:57,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015630090] [2022-12-06 03:51:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015630090] [2022-12-06 03:51:57,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015630090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207754826] [2022-12-06 03:51:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:51:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:57,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207754826] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:57,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:57,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472387914] [2022-12-06 03:51:57,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:57,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:57,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:57,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:57,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:57,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:57,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:57,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:57,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:57,763 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:57,763 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 03:51:57,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 03:51:57,765 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:57,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:57,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:57,766 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:57,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:57,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 03:51:57,767 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:57,769 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:57,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:57,769 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:57,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:57,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,772 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:57,772 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:57,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:57,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:57,906 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:57,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 03:51:57,907 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:57,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:51:57,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:57,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:57,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 03:51:58,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,113 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149134, now seen corresponding path program 1 times [2022-12-06 03:51:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360409819] [2022-12-06 03:51:58,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:58,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360409819] [2022-12-06 03:51:58,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360409819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:58,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181534224] [2022-12-06 03:51:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:58,163 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 03:51:58,204 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 03:51:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181534224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:58,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:58,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-06 03:51:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20329899] [2022-12-06 03:51:58,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:58,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:51:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:51:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:51:58,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:58,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:51:58,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:58,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:58,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:58,282 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 03:51:58,282 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 03:51:58,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 149 events. 97/149 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 20 based on Foata normal form. 9/126 useless extension candidates. Maximal degree in co-relation 399. Up to 64 conditions per place. [2022-12-06 03:51:58,283 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 03:51:58,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-06 03:51:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:51:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:51:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 03:51:58,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:51:58,284 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-06 03:51:58,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-06 03:51:58,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 122 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 03:51:58,286 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-06 03:51:58,288 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 03:51:58,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:58,288 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:58,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:58,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,290 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 03:51:58,291 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:58,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 15 events. 3/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 24. Up to 5 conditions per place. [2022-12-06 03:51:58,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 03:51:58,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:51:58,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 03:51:58,350 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-06 03:51:58,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:51:58,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:58,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:58,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 03:51:58,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:58,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149103, now seen corresponding path program 1 times [2022-12-06 03:51:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555804773] [2022-12-06 03:51:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555804773] [2022-12-06 03:51:58,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555804773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145834311] [2022-12-06 03:51:58,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:58,700 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 03:51:58,704 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 03:51:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145834311] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:58,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:58,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-06 03:51:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234366246] [2022-12-06 03:51:58,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:58,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:51:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:51:58,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:51:58,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:58,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 50 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:51:58,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:58,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:58,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:59,154 INFO L130 PetriNetUnfolder]: 247/378 cut-off events. [2022-12-06 03:51:59,155 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 03:51:59,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 378 events. 247/378 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1183 event pairs, 31 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 973. Up to 167 conditions per place. [2022-12-06 03:51:59,157 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 45 selfloop transitions, 19 changer transitions 0/64 dead transitions. [2022-12-06 03:51:59,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 64 transitions, 318 flow [2022-12-06 03:51:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:51:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:51:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-06 03:51:59,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 03:51:59,159 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-06 03:51:59,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 64 transitions, 318 flow [2022-12-06 03:51:59,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 64 transitions, 288 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 03:51:59,161 INFO L231 Difference]: Finished difference. Result has 28 places, 33 transitions, 164 flow [2022-12-06 03:51:59,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=28, PETRI_TRANSITIONS=33} [2022-12-06 03:51:59,162 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 10 predicate places. [2022-12-06 03:51:59,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:59,162 INFO L89 Accepts]: Start accepts. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 03:51:59,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:59,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:59,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 03:51:59,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 03:51:59,172 INFO L130 PetriNetUnfolder]: 35/77 cut-off events. [2022-12-06 03:51:59,172 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 03:51:59,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 77 events. 35/77 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 219 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 187. Up to 41 conditions per place. [2022-12-06 03:51:59,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 03:51:59,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 03:51:59,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:51:59,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:51:59,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:51:59,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:51:59,518 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:59,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-06 03:51:59,519 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 33 transitions, 186 flow [2022-12-06 03:51:59,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:51:59,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:59,519 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:59,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:59,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:59,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 66809546, now seen corresponding path program 1 times [2022-12-06 03:51:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:59,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456313612] [2022-12-06 03:51:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:59,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456313612] [2022-12-06 03:51:59,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456313612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:59,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248954740] [2022-12-06 03:51:59,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:59,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:59,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:59,856 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:59,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:51:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:59,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:51:59,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:59,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:00,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248954740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:00,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:00,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017106836] [2022-12-06 03:52:00,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:00,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:00,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:52:00,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 33 transitions, 186 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:00,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:00,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:52:00,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:02,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:03,362 INFO L130 PetriNetUnfolder]: 637/971 cut-off events. [2022-12-06 03:52:03,363 INFO L131 PetriNetUnfolder]: For 1397/1397 co-relation queries the response was YES. [2022-12-06 03:52:03,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 971 events. 637/971 cut-off events. For 1397/1397 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4001 event pairs, 35 based on Foata normal form. 38/997 useless extension candidates. Maximal degree in co-relation 2976. Up to 370 conditions per place. [2022-12-06 03:52:03,367 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 89 selfloop transitions, 67 changer transitions 3/159 dead transitions. [2022-12-06 03:52:03,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 159 transitions, 986 flow [2022-12-06 03:52:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 03:52:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 03:52:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2022-12-06 03:52:03,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 03:52:03,369 INFO L175 Difference]: Start difference. First operand has 28 places, 33 transitions, 186 flow. Second operand 16 states and 144 transitions. [2022-12-06 03:52:03,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 159 transitions, 986 flow [2022-12-06 03:52:03,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 159 transitions, 952 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-06 03:52:03,372 INFO L231 Difference]: Finished difference. Result has 48 places, 84 transitions, 614 flow [2022-12-06 03:52:03,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=614, PETRI_PLACES=48, PETRI_TRANSITIONS=84} [2022-12-06 03:52:03,373 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-06 03:52:03,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:03,373 INFO L89 Accepts]: Start accepts. Operand has 48 places, 84 transitions, 614 flow [2022-12-06 03:52:03,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:03,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:03,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 84 transitions, 614 flow [2022-12-06 03:52:03,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 84 transitions, 614 flow [2022-12-06 03:52:03,384 INFO L130 PetriNetUnfolder]: 89/180 cut-off events. [2022-12-06 03:52:03,384 INFO L131 PetriNetUnfolder]: For 452/455 co-relation queries the response was YES. [2022-12-06 03:52:03,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 180 events. 89/180 cut-off events. For 452/455 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 711 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 628. Up to 119 conditions per place. [2022-12-06 03:52:03,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 84 transitions, 614 flow [2022-12-06 03:52:03,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 03:52:03,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= (+ 13 v_~x~0_146) v_~x~0_144) (= (+ (* 21 v_~prev~0_162) (* 34 v_~cur~0_133) (* 3 v_~next~0_82)) (* 5 v_~prev~0_160)) (< v_~x~0_146 0) (= v_~cur~0_131 v_~next~0_82) (= (* 5 v_~next~0_82) (+ (* 21 v_~cur~0_133) (* v_~prev~0_162 13) (* 8 v_~prev~0_160)))) InVars {~prev~0=v_~prev~0_162, ~cur~0=v_~cur~0_133, ~x~0=v_~x~0_146} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_160, ~cur~0=v_~cur~0_131, ~x~0=v_~x~0_144} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:52:03,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [347] L705-6-->L705-6: Formula: (and (= (+ 13 v_~x~0_146) v_~x~0_144) (= (+ (* 21 v_~prev~0_162) (* 34 v_~cur~0_133) (* 3 v_~next~0_82)) (* 5 v_~prev~0_160)) (< v_~x~0_146 0) (= v_~cur~0_131 v_~next~0_82) (= (* 5 v_~next~0_82) (+ (* 21 v_~cur~0_133) (* v_~prev~0_162 13) (* 8 v_~prev~0_160)))) InVars {~prev~0=v_~prev~0_162, ~cur~0=v_~cur~0_133, ~x~0=v_~x~0_146} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_160, ~cur~0=v_~cur~0_131, ~x~0=v_~x~0_144} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:52:03,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [343] L705-6-->L687-5: Formula: (and (= (+ v_~j~0_119 v_~i~0_104) v_~i~0_103) (< v_~p~0_40 5) (= (* 2 v_~next~0_72) (+ (* 21 v_~prev~0_143) (* 3 v_~prev~0_142) (* 34 v_~cur~0_114))) (= (+ 12 v_~x~0_127) v_~x~0_126) (= v_~p~0_39 (+ v_~p~0_40 1)) (= v_~cur~0_113 v_~next~0_72) (= (+ (* 21 v_~cur~0_114) (* v_~prev~0_143 13) (* 3 v_~next~0_72)) (* 5 v_~prev~0_142)) (< v_~x~0_127 1)) InVars {~j~0=v_~j~0_119, ~prev~0=v_~prev~0_143, ~i~0=v_~i~0_104, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_114, ~x~0=v_~x~0_127} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_77|, ~j~0=v_~j~0_119, ~next~0=v_~next~0_72, ~prev~0=v_~prev~0_142, ~i~0=v_~i~0_103, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_113, ~x~0=v_~x~0_126} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:52:03,762 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:52:03,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 390 [2022-12-06 03:52:03,763 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 84 transitions, 632 flow [2022-12-06 03:52:03,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:03,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:03,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:03,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:03,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:03,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1106200438, now seen corresponding path program 1 times [2022-12-06 03:52:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136355635] [2022-12-06 03:52:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:04,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136355635] [2022-12-06 03:52:04,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136355635] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:04,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607616778] [2022-12-06 03:52:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:04,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:04,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:04,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:04,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:52:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:52:04,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:04,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:04,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607616778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:04,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:04,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 03:52:04,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358190538] [2022-12-06 03:52:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:04,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:52:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:52:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:52:04,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:52:04,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 84 transitions, 632 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:52:04,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:04,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:52:04,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:04,161 INFO L130 PetriNetUnfolder]: 344/561 cut-off events. [2022-12-06 03:52:04,161 INFO L131 PetriNetUnfolder]: For 1845/1845 co-relation queries the response was YES. [2022-12-06 03:52:04,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 561 events. 344/561 cut-off events. For 1845/1845 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2231 event pairs, 153 based on Foata normal form. 81/626 useless extension candidates. Maximal degree in co-relation 1877. Up to 337 conditions per place. [2022-12-06 03:52:04,164 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2022-12-06 03:52:04,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 492 flow [2022-12-06 03:52:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:52:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:52:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 03:52:04,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 03:52:04,165 INFO L175 Difference]: Start difference. First operand has 46 places, 84 transitions, 632 flow. Second operand 4 states and 32 transitions. [2022-12-06 03:52:04,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 492 flow [2022-12-06 03:52:04,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 431 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 03:52:04,168 INFO L231 Difference]: Finished difference. Result has 39 places, 47 transitions, 309 flow [2022-12-06 03:52:04,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=39, PETRI_TRANSITIONS=47} [2022-12-06 03:52:04,169 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 21 predicate places. [2022-12-06 03:52:04,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:04,169 INFO L89 Accepts]: Start accepts. Operand has 39 places, 47 transitions, 309 flow [2022-12-06 03:52:04,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:04,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:04,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 47 transitions, 309 flow [2022-12-06 03:52:04,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 47 transitions, 309 flow [2022-12-06 03:52:04,176 INFO L130 PetriNetUnfolder]: 48/121 cut-off events. [2022-12-06 03:52:04,176 INFO L131 PetriNetUnfolder]: For 238/252 co-relation queries the response was YES. [2022-12-06 03:52:04,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 121 events. 48/121 cut-off events. For 238/252 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 0 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 318. Up to 34 conditions per place. [2022-12-06 03:52:04,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 309 flow [2022-12-06 03:52:04,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 03:52:04,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:04,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 03:52:04,253 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 315 flow [2022-12-06 03:52:04,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:52:04,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:04,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:04,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:04,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 03:52:04,454 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1429433377, now seen corresponding path program 1 times [2022-12-06 03:52:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792715950] [2022-12-06 03:52:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:04,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792715950] [2022-12-06 03:52:04,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792715950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:04,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199598564] [2022-12-06 03:52:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:04,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:04,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:04,564 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:04,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:52:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:04,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:04,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:04,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199598564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:04,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:04,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700503352] [2022-12-06 03:52:04,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:04,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:04,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:04,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:52:04,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 315 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:04,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:04,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:52:04,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:05,212 INFO L130 PetriNetUnfolder]: 402/671 cut-off events. [2022-12-06 03:52:05,212 INFO L131 PetriNetUnfolder]: For 1204/1204 co-relation queries the response was YES. [2022-12-06 03:52:05,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 671 events. 402/671 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2926 event pairs, 40 based on Foata normal form. 26/681 useless extension candidates. Maximal degree in co-relation 2027. Up to 383 conditions per place. [2022-12-06 03:52:05,215 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-06 03:52:05,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 101 transitions, 700 flow [2022-12-06 03:52:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:52:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:52:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 03:52:05,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 03:52:05,216 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 315 flow. Second operand 10 states and 74 transitions. [2022-12-06 03:52:05,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 101 transitions, 700 flow [2022-12-06 03:52:05,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 101 transitions, 683 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:05,220 INFO L231 Difference]: Finished difference. Result has 51 places, 68 transitions, 581 flow [2022-12-06 03:52:05,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=581, PETRI_PLACES=51, PETRI_TRANSITIONS=68} [2022-12-06 03:52:05,221 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 33 predicate places. [2022-12-06 03:52:05,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:05,221 INFO L89 Accepts]: Start accepts. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 03:52:05,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:05,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:05,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 03:52:05,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 03:52:05,231 INFO L130 PetriNetUnfolder]: 63/155 cut-off events. [2022-12-06 03:52:05,231 INFO L131 PetriNetUnfolder]: For 402/436 co-relation queries the response was YES. [2022-12-06 03:52:05,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 155 events. 63/155 cut-off events. For 402/436 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 664 event pairs, 1 based on Foata normal form. 5/157 useless extension candidates. Maximal degree in co-relation 548. Up to 48 conditions per place. [2022-12-06 03:52:05,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 03:52:05,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 03:52:05,381 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:05,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 03:52:05,382 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 68 transitions, 598 flow [2022-12-06 03:52:05,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:05,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:05,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:05,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 03:52:05,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 03:52:05,583 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash 67781458, now seen corresponding path program 1 times [2022-12-06 03:52:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:05,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125549152] [2022-12-06 03:52:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:05,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:05,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125549152] [2022-12-06 03:52:05,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125549152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:05,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630053804] [2022-12-06 03:52:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:05,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:05,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:05,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:52:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:05,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:05,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:05,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:06,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630053804] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:06,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:06,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306398004] [2022-12-06 03:52:06,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:06,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:06,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:06,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:06,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 68 transitions, 598 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:06,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:06,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:06,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:06,793 INFO L130 PetriNetUnfolder]: 548/935 cut-off events. [2022-12-06 03:52:06,793 INFO L131 PetriNetUnfolder]: For 3109/3109 co-relation queries the response was YES. [2022-12-06 03:52:06,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 935 events. 548/935 cut-off events. For 3109/3109 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4523 event pairs, 31 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 3268. Up to 295 conditions per place. [2022-12-06 03:52:06,797 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 73 selfloop transitions, 97 changer transitions 0/170 dead transitions. [2022-12-06 03:52:06,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 170 transitions, 1411 flow [2022-12-06 03:52:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 03:52:06,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33229813664596275 [2022-12-06 03:52:06,798 INFO L175 Difference]: Start difference. First operand has 51 places, 68 transitions, 598 flow. Second operand 14 states and 107 transitions. [2022-12-06 03:52:06,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 170 transitions, 1411 flow [2022-12-06 03:52:06,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 170 transitions, 1374 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:06,806 INFO L231 Difference]: Finished difference. Result has 69 places, 120 transitions, 1241 flow [2022-12-06 03:52:06,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1241, PETRI_PLACES=69, PETRI_TRANSITIONS=120} [2022-12-06 03:52:06,806 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 51 predicate places. [2022-12-06 03:52:06,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:06,806 INFO L89 Accepts]: Start accepts. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 03:52:06,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:06,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:06,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 03:52:06,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 03:52:06,819 INFO L130 PetriNetUnfolder]: 81/205 cut-off events. [2022-12-06 03:52:06,819 INFO L131 PetriNetUnfolder]: For 778/810 co-relation queries the response was YES. [2022-12-06 03:52:06,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 205 events. 81/205 cut-off events. For 778/810 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1005 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 895. Up to 86 conditions per place. [2022-12-06 03:52:06,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 03:52:06,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 03:52:06,821 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:06,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 03:52:06,821 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 120 transitions, 1241 flow [2022-12-06 03:52:06,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:06,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:06,822 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:06,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:07,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 03:52:07,026 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1362434503, now seen corresponding path program 1 times [2022-12-06 03:52:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:07,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811175680] [2022-12-06 03:52:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:07,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811175680] [2022-12-06 03:52:07,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811175680] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:07,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759913722] [2022-12-06 03:52:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:07,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:07,181 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:07,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:52:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:07,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:07,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:07,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:07,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759913722] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:07,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:07,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689051954] [2022-12-06 03:52:07,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:07,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:07,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:07,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 120 transitions, 1241 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:07,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:07,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:07,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:08,094 INFO L130 PetriNetUnfolder]: 592/1023 cut-off events. [2022-12-06 03:52:08,094 INFO L131 PetriNetUnfolder]: For 5408/5408 co-relation queries the response was YES. [2022-12-06 03:52:08,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1023 events. 592/1023 cut-off events. For 5408/5408 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5166 event pairs, 67 based on Foata normal form. 24/1028 useless extension candidates. Maximal degree in co-relation 4181. Up to 656 conditions per place. [2022-12-06 03:52:08,100 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 113 selfloop transitions, 61 changer transitions 0/174 dead transitions. [2022-12-06 03:52:08,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1819 flow [2022-12-06 03:52:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:52:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:52:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 03:52:08,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-06 03:52:08,101 INFO L175 Difference]: Start difference. First operand has 69 places, 120 transitions, 1241 flow. Second operand 11 states and 82 transitions. [2022-12-06 03:52:08,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1819 flow [2022-12-06 03:52:08,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1737 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:08,147 INFO L231 Difference]: Finished difference. Result has 80 places, 138 transitions, 1515 flow [2022-12-06 03:52:08,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1515, PETRI_PLACES=80, PETRI_TRANSITIONS=138} [2022-12-06 03:52:08,148 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 62 predicate places. [2022-12-06 03:52:08,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:08,148 INFO L89 Accepts]: Start accepts. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 03:52:08,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:08,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:08,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 03:52:08,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 03:52:08,164 INFO L130 PetriNetUnfolder]: 92/237 cut-off events. [2022-12-06 03:52:08,164 INFO L131 PetriNetUnfolder]: For 987/1019 co-relation queries the response was YES. [2022-12-06 03:52:08,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 237 events. 92/237 cut-off events. For 987/1019 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1222 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 1104. Up to 106 conditions per place. [2022-12-06 03:52:08,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 03:52:08,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 03:52:08,228 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:08,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 03:52:08,230 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 138 transitions, 1526 flow [2022-12-06 03:52:08,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:08,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:08,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:08,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:08,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 03:52:08,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 548598122, now seen corresponding path program 1 times [2022-12-06 03:52:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:08,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39528909] [2022-12-06 03:52:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:08,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39528909] [2022-12-06 03:52:08,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39528909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:08,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348643498] [2022-12-06 03:52:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:08,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:08,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:08,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:08,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:52:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:08,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:08,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:08,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:08,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348643498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:08,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:08,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240922925] [2022-12-06 03:52:08,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:08,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:08,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:08,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:08,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 03:52:08,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 138 transitions, 1526 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:08,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:08,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 03:52:08,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:09,956 INFO L130 PetriNetUnfolder]: 706/1215 cut-off events. [2022-12-06 03:52:09,956 INFO L131 PetriNetUnfolder]: For 6324/6324 co-relation queries the response was YES. [2022-12-06 03:52:09,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5231 conditions, 1215 events. 706/1215 cut-off events. For 6324/6324 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6422 event pairs, 43 based on Foata normal form. 14/1210 useless extension candidates. Maximal degree in co-relation 5194. Up to 676 conditions per place. [2022-12-06 03:52:09,962 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 128 selfloop transitions, 96 changer transitions 2/226 dead transitions. [2022-12-06 03:52:09,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 226 transitions, 2420 flow [2022-12-06 03:52:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:52:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:52:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-12-06 03:52:09,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26 [2022-12-06 03:52:09,964 INFO L175 Difference]: Start difference. First operand has 80 places, 138 transitions, 1526 flow. Second operand 18 states and 117 transitions. [2022-12-06 03:52:09,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 226 transitions, 2420 flow [2022-12-06 03:52:09,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 2358 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:09,984 INFO L231 Difference]: Finished difference. Result has 99 places, 170 transitions, 2118 flow [2022-12-06 03:52:09,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2118, PETRI_PLACES=99, PETRI_TRANSITIONS=170} [2022-12-06 03:52:09,987 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 81 predicate places. [2022-12-06 03:52:09,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:09,987 INFO L89 Accepts]: Start accepts. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 03:52:09,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:09,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:09,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 03:52:09,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 03:52:10,013 INFO L130 PetriNetUnfolder]: 109/282 cut-off events. [2022-12-06 03:52:10,013 INFO L131 PetriNetUnfolder]: For 1388/1420 co-relation queries the response was YES. [2022-12-06 03:52:10,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 282 events. 109/282 cut-off events. For 1388/1420 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1590 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 1480. Up to 125 conditions per place. [2022-12-06 03:52:10,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 03:52:10,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 03:52:10,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [360] L705-6-->L695-5: Formula: (and (< v_~x~0_197 1) (< v_~q~0_107 6) (= (+ (* 3 v_~prev~0_210) (* 34 v_~cur~0_177) (* 21 v_~prev~0_211)) (* 2 v_~next~0_109)) (= (+ 12 v_~x~0_197) v_~x~0_196) (= (+ 2 v_~q~0_109) v_~q~0_107) (= v_~next~0_109 v_~cur~0_176) (= v_~j~0_185 (+ v_~j~0_187 (* 2 v_~i~0_163))) (= (* 5 v_~prev~0_210) (+ (* 3 v_~next~0_109) (* v_~prev~0_211 13) (* 21 v_~cur~0_177)))) InVars {~j~0=v_~j~0_187, ~prev~0=v_~prev~0_211, ~i~0=v_~i~0_163, ~q~0=v_~q~0_109, ~cur~0=v_~cur~0_177, ~x~0=v_~x~0_197} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_119|, ~j~0=v_~j~0_185, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_210, ~i~0=v_~i~0_163, ~q~0=v_~q~0_107, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_76|, ~cur~0=v_~cur~0_176, ~x~0=v_~x~0_196} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:52:10,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [342] L705-6-->L695-5: Formula: (and (= (+ (* v_~prev~0_139 13) (* 21 v_~cur~0_110) (* 3 v_~next~0_70)) (* 5 v_~prev~0_138)) (< v_~q~0_56 5) (= (+ (* 34 v_~cur~0_110) (* 3 v_~prev~0_138) (* 21 v_~prev~0_139)) (* 2 v_~next~0_70)) (< v_~x~0_123 1) (= v_~j~0_115 (+ v_~j~0_116 v_~i~0_101)) (= (+ 12 v_~x~0_123) v_~x~0_122) (= v_~q~0_55 (+ v_~q~0_56 1)) (= v_~cur~0_109 v_~next~0_70)) InVars {~j~0=v_~j~0_116, ~prev~0=v_~prev~0_139, ~i~0=v_~i~0_101, ~q~0=v_~q~0_56, ~cur~0=v_~cur~0_110, ~x~0=v_~x~0_123} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_75|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_70, ~prev~0=v_~prev~0_138, ~i~0=v_~i~0_101, ~q~0=v_~q~0_55, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_38|, ~cur~0=v_~cur~0_109, ~x~0=v_~x~0_122} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:52:10,698 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:52:10,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 712 [2022-12-06 03:52:10,699 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 170 transitions, 2154 flow [2022-12-06 03:52:10,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:10,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:10,700 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:10,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:10,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 03:52:10,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1362284370, now seen corresponding path program 1 times [2022-12-06 03:52:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:10,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630552700] [2022-12-06 03:52:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:11,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:11,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630552700] [2022-12-06 03:52:11,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630552700] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:11,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716140864] [2022-12-06 03:52:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:11,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:11,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:11,053 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:11,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 03:52:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:11,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:11,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:11,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:11,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716140864] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:11,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:11,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800860425] [2022-12-06 03:52:11,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:11,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:11,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:11,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 03:52:11,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 170 transitions, 2154 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:11,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:11,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 03:52:11,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:12,171 INFO L130 PetriNetUnfolder]: 874/1499 cut-off events. [2022-12-06 03:52:12,172 INFO L131 PetriNetUnfolder]: For 12562/12562 co-relation queries the response was YES. [2022-12-06 03:52:12,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1499 events. 874/1499 cut-off events. For 12562/12562 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8364 event pairs, 44 based on Foata normal form. 22/1502 useless extension candidates. Maximal degree in co-relation 7150. Up to 501 conditions per place. [2022-12-06 03:52:12,181 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 103 selfloop transitions, 152 changer transitions 0/255 dead transitions. [2022-12-06 03:52:12,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 255 transitions, 3262 flow [2022-12-06 03:52:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:52:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:52:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-12-06 03:52:12,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-06 03:52:12,182 INFO L175 Difference]: Start difference. First operand has 99 places, 170 transitions, 2154 flow. Second operand 12 states and 107 transitions. [2022-12-06 03:52:12,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 255 transitions, 3262 flow [2022-12-06 03:52:12,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 255 transitions, 3132 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-12-06 03:52:12,225 INFO L231 Difference]: Finished difference. Result has 107 places, 206 transitions, 2974 flow [2022-12-06 03:52:12,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2974, PETRI_PLACES=107, PETRI_TRANSITIONS=206} [2022-12-06 03:52:12,226 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 89 predicate places. [2022-12-06 03:52:12,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:12,226 INFO L89 Accepts]: Start accepts. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 03:52:12,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:12,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:12,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 03:52:12,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 03:52:12,253 INFO L130 PetriNetUnfolder]: 137/352 cut-off events. [2022-12-06 03:52:12,253 INFO L131 PetriNetUnfolder]: For 2672/2722 co-relation queries the response was YES. [2022-12-06 03:52:12,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 352 events. 137/352 cut-off events. For 2672/2722 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2145 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 2176. Up to 169 conditions per place. [2022-12-06 03:52:12,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 03:52:12,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 03:52:12,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:12,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 03:52:12,297 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 206 transitions, 2978 flow [2022-12-06 03:52:12,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:12,297 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:12,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 03:52:12,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 03:52:12,502 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1362255757, now seen corresponding path program 1 times [2022-12-06 03:52:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:12,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322081924] [2022-12-06 03:52:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322081924] [2022-12-06 03:52:12,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322081924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:12,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620990915] [2022-12-06 03:52:12,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:12,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:12,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:12,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:52:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:12,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:12,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:12,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:12,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620990915] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:12,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:12,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467662653] [2022-12-06 03:52:12,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:12,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 03:52:12,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 206 transitions, 2978 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:12,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 03:52:12,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:15,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:15,218 INFO L130 PetriNetUnfolder]: 914/1579 cut-off events. [2022-12-06 03:52:15,219 INFO L131 PetriNetUnfolder]: For 20188/20188 co-relation queries the response was YES. [2022-12-06 03:52:15,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 1579 events. 914/1579 cut-off events. For 20188/20188 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8888 event pairs, 104 based on Foata normal form. 32/1586 useless extension candidates. Maximal degree in co-relation 8328. Up to 1020 conditions per place. [2022-12-06 03:52:15,228 INFO L137 encePairwiseOnDemand]: 8/31 looper letters, 155 selfloop transitions, 108 changer transitions 2/265 dead transitions. [2022-12-06 03:52:15,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 265 transitions, 3844 flow [2022-12-06 03:52:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:52:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:52:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-06 03:52:15,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2456575682382134 [2022-12-06 03:52:15,229 INFO L175 Difference]: Start difference. First operand has 107 places, 206 transitions, 2978 flow. Second operand 13 states and 99 transitions. [2022-12-06 03:52:15,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 265 transitions, 3844 flow [2022-12-06 03:52:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 265 transitions, 3743 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 03:52:15,282 INFO L231 Difference]: Finished difference. Result has 118 places, 222 transitions, 3473 flow [2022-12-06 03:52:15,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3473, PETRI_PLACES=118, PETRI_TRANSITIONS=222} [2022-12-06 03:52:15,282 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 100 predicate places. [2022-12-06 03:52:15,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:15,282 INFO L89 Accepts]: Start accepts. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 03:52:15,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:15,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:15,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 03:52:15,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 03:52:15,310 INFO L130 PetriNetUnfolder]: 147/382 cut-off events. [2022-12-06 03:52:15,311 INFO L131 PetriNetUnfolder]: For 3263/3327 co-relation queries the response was YES. [2022-12-06 03:52:15,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 382 events. 147/382 cut-off events. For 3263/3327 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2324 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 2522. Up to 183 conditions per place. [2022-12-06 03:52:15,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 03:52:15,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-06 03:52:15,381 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:15,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 03:52:15,381 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 222 transitions, 3485 flow [2022-12-06 03:52:15,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:15,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:15,381 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:15,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:15,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:15,586 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash 549150697, now seen corresponding path program 1 times [2022-12-06 03:52:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:15,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832062719] [2022-12-06 03:52:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:15,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832062719] [2022-12-06 03:52:15,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832062719] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:15,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108328673] [2022-12-06 03:52:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:15,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:15,708 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:15,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:52:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:15,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:15,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:15,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:16,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108328673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:16,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:16,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715691309] [2022-12-06 03:52:16,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:16,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:16,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:16,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:16,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:16,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 03:52:16,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 222 transitions, 3485 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:16,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:16,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 03:52:16,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:23,804 WARN L233 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 68 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:52:28,039 INFO L130 PetriNetUnfolder]: 1032/1791 cut-off events. [2022-12-06 03:52:28,039 INFO L131 PetriNetUnfolder]: For 20832/20832 co-relation queries the response was YES. [2022-12-06 03:52:28,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 1791 events. 1032/1791 cut-off events. For 20832/20832 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 10474 event pairs, 90 based on Foata normal form. 20/1786 useless extension candidates. Maximal degree in co-relation 9859. Up to 1048 conditions per place. [2022-12-06 03:52:28,056 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 167 selfloop transitions, 150 changer transitions 3/320 dead transitions. [2022-12-06 03:52:28,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 320 transitions, 4900 flow [2022-12-06 03:52:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 03:52:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 03:52:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-06 03:52:28,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22348484848484848 [2022-12-06 03:52:28,057 INFO L175 Difference]: Start difference. First operand has 118 places, 222 transitions, 3485 flow. Second operand 16 states and 118 transitions. [2022-12-06 03:52:28,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 320 transitions, 4900 flow [2022-12-06 03:52:28,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 320 transitions, 4802 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-06 03:52:28,156 INFO L231 Difference]: Finished difference. Result has 133 places, 265 transitions, 4573 flow [2022-12-06 03:52:28,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4573, PETRI_PLACES=133, PETRI_TRANSITIONS=265} [2022-12-06 03:52:28,157 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 115 predicate places. [2022-12-06 03:52:28,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:28,157 INFO L89 Accepts]: Start accepts. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 03:52:28,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:28,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:28,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 03:52:28,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 03:52:28,201 INFO L130 PetriNetUnfolder]: 168/439 cut-off events. [2022-12-06 03:52:28,202 INFO L131 PetriNetUnfolder]: For 3951/4009 co-relation queries the response was YES. [2022-12-06 03:52:28,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3177 conditions, 439 events. 168/439 cut-off events. For 3951/4009 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2832 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 3126. Up to 210 conditions per place. [2022-12-06 03:52:28,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 03:52:28,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-06 03:52:28,207 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:28,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 03:52:28,207 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 265 transitions, 4573 flow [2022-12-06 03:52:28,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:28,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:28,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:28,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:28,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 03:52:28,414 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash 550394634, now seen corresponding path program 1 times [2022-12-06 03:52:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:28,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748084335] [2022-12-06 03:52:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:28,439 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 03:52:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:28,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748084335] [2022-12-06 03:52:28,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748084335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:28,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:28,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:28,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522097724] [2022-12-06 03:52:28,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:28,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:28,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:28,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:28,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:28,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 03:52:28,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 265 transitions, 4573 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:52:28,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:28,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 03:52:28,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:28,672 INFO L130 PetriNetUnfolder]: 964/1675 cut-off events. [2022-12-06 03:52:28,672 INFO L131 PetriNetUnfolder]: For 18214/18214 co-relation queries the response was YES. [2022-12-06 03:52:28,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10246 conditions, 1675 events. 964/1675 cut-off events. For 18214/18214 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 9638 event pairs, 288 based on Foata normal form. 65/1726 useless extension candidates. Maximal degree in co-relation 10192. Up to 1370 conditions per place. [2022-12-06 03:52:28,682 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 241 selfloop transitions, 32 changer transitions 0/273 dead transitions. [2022-12-06 03:52:28,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 273 transitions, 5189 flow [2022-12-06 03:52:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 03:52:28,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2022-12-06 03:52:28,684 INFO L175 Difference]: Start difference. First operand has 133 places, 265 transitions, 4573 flow. Second operand 3 states and 41 transitions. [2022-12-06 03:52:28,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 273 transitions, 5189 flow [2022-12-06 03:52:28,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 273 transitions, 5048 flow, removed 44 selfloop flow, removed 8 redundant places. [2022-12-06 03:52:28,752 INFO L231 Difference]: Finished difference. Result has 128 places, 264 transitions, 4488 flow [2022-12-06 03:52:28,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4332, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4488, PETRI_PLACES=128, PETRI_TRANSITIONS=264} [2022-12-06 03:52:28,752 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 110 predicate places. [2022-12-06 03:52:28,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:28,753 INFO L89 Accepts]: Start accepts. Operand has 128 places, 264 transitions, 4488 flow [2022-12-06 03:52:28,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:28,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:28,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 264 transitions, 4488 flow [2022-12-06 03:52:28,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 264 transitions, 4488 flow [2022-12-06 03:52:28,785 INFO L130 PetriNetUnfolder]: 163/425 cut-off events. [2022-12-06 03:52:28,786 INFO L131 PetriNetUnfolder]: For 3718/3779 co-relation queries the response was YES. [2022-12-06 03:52:28,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 425 events. 163/425 cut-off events. For 3718/3779 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2727 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 3076. Up to 199 conditions per place. [2022-12-06 03:52:28,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 264 transitions, 4488 flow [2022-12-06 03:52:28,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 798 [2022-12-06 03:52:28,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:28,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 03:52:28,827 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 264 transitions, 4489 flow [2022-12-06 03:52:28,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:52:28,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:28,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:28,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 03:52:28,827 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 720763637, now seen corresponding path program 1 times [2022-12-06 03:52:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:28,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897192626] [2022-12-06 03:52:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:28,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:28,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897192626] [2022-12-06 03:52:28,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897192626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:28,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66310404] [2022-12-06 03:52:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:28,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:28,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:28,948 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:28,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:52:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:29,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:29,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:29,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:29,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66310404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:29,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:29,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:29,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37427510] [2022-12-06 03:52:29,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:29,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:29,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 03:52:29,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 264 transitions, 4489 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:29,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:29,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 03:52:29,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:31,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:33,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:34,572 INFO L130 PetriNetUnfolder]: 1254/2181 cut-off events. [2022-12-06 03:52:34,573 INFO L131 PetriNetUnfolder]: For 40523/40523 co-relation queries the response was YES. [2022-12-06 03:52:34,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13742 conditions, 2181 events. 1254/2181 cut-off events. For 40523/40523 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 13135 event pairs, 80 based on Foata normal form. 60/2227 useless extension candidates. Maximal degree in co-relation 13688. Up to 930 conditions per place. [2022-12-06 03:52:34,584 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 171 selfloop transitions, 240 changer transitions 0/411 dead transitions. [2022-12-06 03:52:34,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 411 transitions, 7034 flow [2022-12-06 03:52:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:52:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:52:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 140 transitions. [2022-12-06 03:52:34,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2356902356902357 [2022-12-06 03:52:34,586 INFO L175 Difference]: Start difference. First operand has 128 places, 264 transitions, 4489 flow. Second operand 18 states and 140 transitions. [2022-12-06 03:52:34,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 411 transitions, 7034 flow [2022-12-06 03:52:34,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 411 transitions, 6998 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:34,682 INFO L231 Difference]: Finished difference. Result has 153 places, 348 transitions, 6740 flow [2022-12-06 03:52:34,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4453, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6740, PETRI_PLACES=153, PETRI_TRANSITIONS=348} [2022-12-06 03:52:34,683 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 135 predicate places. [2022-12-06 03:52:34,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:34,683 INFO L89 Accepts]: Start accepts. Operand has 153 places, 348 transitions, 6740 flow [2022-12-06 03:52:34,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:34,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:34,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 348 transitions, 6740 flow [2022-12-06 03:52:34,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 348 transitions, 6740 flow [2022-12-06 03:52:34,735 INFO L130 PetriNetUnfolder]: 208/540 cut-off events. [2022-12-06 03:52:34,736 INFO L131 PetriNetUnfolder]: For 7144/7242 co-relation queries the response was YES. [2022-12-06 03:52:34,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 540 events. 208/540 cut-off events. For 7144/7242 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3572 event pairs, 0 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 4449. Up to 280 conditions per place. [2022-12-06 03:52:34,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 348 transitions, 6740 flow [2022-12-06 03:52:34,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 03:52:34,745 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:34,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 03:52:34,746 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 348 transitions, 6740 flow [2022-12-06 03:52:34,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:34,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:34,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:34,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 03:52:34,951 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -127758220, now seen corresponding path program 1 times [2022-12-06 03:52:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:34,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972771317] [2022-12-06 03:52:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:35,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972771317] [2022-12-06 03:52:35,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972771317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:35,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257094003] [2022-12-06 03:52:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:35,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:35,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:35,121 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:35,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:52:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:35,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:35,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:35,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:35,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257094003] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:35,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:35,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937246386] [2022-12-06 03:52:35,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:35,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:35,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:35,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:35,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:35,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 03:52:35,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 348 transitions, 6740 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:35,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:35,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 03:52:35,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:37,396 INFO L130 PetriNetUnfolder]: 1500/2609 cut-off events. [2022-12-06 03:52:37,396 INFO L131 PetriNetUnfolder]: For 54315/54315 co-relation queries the response was YES. [2022-12-06 03:52:37,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 2609 events. 1500/2609 cut-off events. For 54315/54315 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 16286 event pairs, 143 based on Foata normal form. 32/2627 useless extension candidates. Maximal degree in co-relation 17794. Up to 1381 conditions per place. [2022-12-06 03:52:37,413 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 236 selfloop transitions, 252 changer transitions 0/488 dead transitions. [2022-12-06 03:52:37,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 488 transitions, 9182 flow [2022-12-06 03:52:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:52:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:52:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 152 transitions. [2022-12-06 03:52:37,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21933621933621933 [2022-12-06 03:52:37,414 INFO L175 Difference]: Start difference. First operand has 153 places, 348 transitions, 6740 flow. Second operand 21 states and 152 transitions. [2022-12-06 03:52:37,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 488 transitions, 9182 flow [2022-12-06 03:52:37,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 488 transitions, 8861 flow, removed 144 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:37,575 INFO L231 Difference]: Finished difference. Result has 178 places, 418 transitions, 8415 flow [2022-12-06 03:52:37,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6427, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8415, PETRI_PLACES=178, PETRI_TRANSITIONS=418} [2022-12-06 03:52:37,575 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 160 predicate places. [2022-12-06 03:52:37,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:37,575 INFO L89 Accepts]: Start accepts. Operand has 178 places, 418 transitions, 8415 flow [2022-12-06 03:52:37,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:37,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:37,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 418 transitions, 8415 flow [2022-12-06 03:52:37,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 418 transitions, 8415 flow [2022-12-06 03:52:37,640 INFO L130 PetriNetUnfolder]: 251/648 cut-off events. [2022-12-06 03:52:37,640 INFO L131 PetriNetUnfolder]: For 10893/11031 co-relation queries the response was YES. [2022-12-06 03:52:37,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 648 events. 251/648 cut-off events. For 10893/11031 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 4582 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 5544. Up to 336 conditions per place. [2022-12-06 03:52:37,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 418 transitions, 8415 flow [2022-12-06 03:52:37,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 1232 [2022-12-06 03:52:37,718 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:37,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 03:52:37,718 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 418 transitions, 8435 flow [2022-12-06 03:52:37,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:37,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:37,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:37,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:37,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:37,923 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2102149420, now seen corresponding path program 1 times [2022-12-06 03:52:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:37,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828692773] [2022-12-06 03:52:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:52:37,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828692773] [2022-12-06 03:52:37,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828692773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811427827] [2022-12-06 03:52:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:37,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:37,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:37,980 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:37,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:52:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:38,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:52:38,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:52:38,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:38,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811427827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:38,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:38,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-06 03:52:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573617951] [2022-12-06 03:52:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:52:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:52:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:52:38,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:38,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 418 transitions, 8435 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:52:38,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:38,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:38,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:38,457 INFO L130 PetriNetUnfolder]: 1526/2637 cut-off events. [2022-12-06 03:52:38,457 INFO L131 PetriNetUnfolder]: For 57908/57908 co-relation queries the response was YES. [2022-12-06 03:52:38,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19174 conditions, 2637 events. 1526/2637 cut-off events. For 57908/57908 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 17188 event pairs, 301 based on Foata normal form. 18/2641 useless extension candidates. Maximal degree in co-relation 19101. Up to 1208 conditions per place. [2022-12-06 03:52:38,476 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 658 selfloop transitions, 5 changer transitions 10/673 dead transitions. [2022-12-06 03:52:38,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 673 transitions, 14917 flow [2022-12-06 03:52:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:52:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:52:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 03:52:38,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38857142857142857 [2022-12-06 03:52:38,478 INFO L175 Difference]: Start difference. First operand has 178 places, 418 transitions, 8435 flow. Second operand 5 states and 68 transitions. [2022-12-06 03:52:38,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 673 transitions, 14917 flow [2022-12-06 03:52:38,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 673 transitions, 14543 flow, removed 148 selfloop flow, removed 5 redundant places. [2022-12-06 03:52:38,788 INFO L231 Difference]: Finished difference. Result has 178 places, 415 transitions, 8131 flow [2022-12-06 03:52:38,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8108, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8131, PETRI_PLACES=178, PETRI_TRANSITIONS=415} [2022-12-06 03:52:38,788 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 160 predicate places. [2022-12-06 03:52:38,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:38,789 INFO L89 Accepts]: Start accepts. Operand has 178 places, 415 transitions, 8131 flow [2022-12-06 03:52:38,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:38,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:38,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 415 transitions, 8131 flow [2022-12-06 03:52:38,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 415 transitions, 8131 flow [2022-12-06 03:52:38,859 INFO L130 PetriNetUnfolder]: 263/679 cut-off events. [2022-12-06 03:52:38,859 INFO L131 PetriNetUnfolder]: For 12287/12404 co-relation queries the response was YES. [2022-12-06 03:52:38,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5924 conditions, 679 events. 263/679 cut-off events. For 12287/12404 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4821 event pairs, 0 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 5853. Up to 356 conditions per place. [2022-12-06 03:52:38,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 415 transitions, 8131 flow [2022-12-06 03:52:38,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 1248 [2022-12-06 03:52:38,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:38,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 03:52:38,906 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 415 transitions, 8126 flow [2022-12-06 03:52:38,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:52:38,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:38,906 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:38,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 03:52:39,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:39,110 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2100271967, now seen corresponding path program 1 times [2022-12-06 03:52:39,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:39,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580432950] [2022-12-06 03:52:39,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580432950] [2022-12-06 03:52:39,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580432950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35736726] [2022-12-06 03:52:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:39,145 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:39,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:52:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:39,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:52:39,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:39,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:39,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35736726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:39,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:39,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 03:52:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267242888] [2022-12-06 03:52:39,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:39,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:52:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:39,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:52:39,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:52:39,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:39,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 415 transitions, 8126 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:52:39,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:39,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:39,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:39,722 INFO L130 PetriNetUnfolder]: 1642/2803 cut-off events. [2022-12-06 03:52:39,722 INFO L131 PetriNetUnfolder]: For 63054/63054 co-relation queries the response was YES. [2022-12-06 03:52:39,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20731 conditions, 2803 events. 1642/2803 cut-off events. For 63054/63054 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 17954 event pairs, 295 based on Foata normal form. 6/2801 useless extension candidates. Maximal degree in co-relation 20657. Up to 1274 conditions per place. [2022-12-06 03:52:39,747 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 664 selfloop transitions, 15 changer transitions 10/689 dead transitions. [2022-12-06 03:52:39,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 689 transitions, 14823 flow [2022-12-06 03:52:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:52:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:52:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-06 03:52:39,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 03:52:39,748 INFO L175 Difference]: Start difference. First operand has 178 places, 415 transitions, 8126 flow. Second operand 6 states and 74 transitions. [2022-12-06 03:52:39,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 689 transitions, 14823 flow [2022-12-06 03:52:40,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 689 transitions, 14820 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:40,009 INFO L231 Difference]: Finished difference. Result has 184 places, 420 transitions, 8227 flow [2022-12-06 03:52:40,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8123, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8227, PETRI_PLACES=184, PETRI_TRANSITIONS=420} [2022-12-06 03:52:40,010 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 166 predicate places. [2022-12-06 03:52:40,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:40,010 INFO L89 Accepts]: Start accepts. Operand has 184 places, 420 transitions, 8227 flow [2022-12-06 03:52:40,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:40,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:40,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 420 transitions, 8227 flow [2022-12-06 03:52:40,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 420 transitions, 8227 flow [2022-12-06 03:52:40,102 INFO L130 PetriNetUnfolder]: 286/733 cut-off events. [2022-12-06 03:52:40,102 INFO L131 PetriNetUnfolder]: For 15291/15417 co-relation queries the response was YES. [2022-12-06 03:52:40,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 733 events. 286/733 cut-off events. For 15291/15417 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 5305 event pairs, 0 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 6487. Up to 391 conditions per place. [2022-12-06 03:52:40,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 420 transitions, 8227 flow [2022-12-06 03:52:40,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 03:52:40,237 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:40,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 03:52:40,237 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 420 transitions, 8261 flow [2022-12-06 03:52:40,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:52:40,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:40,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:40,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:40,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:40,438 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash 550646633, now seen corresponding path program 1 times [2022-12-06 03:52:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:40,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384095055] [2022-12-06 03:52:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384095055] [2022-12-06 03:52:40,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384095055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896034379] [2022-12-06 03:52:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:40,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:40,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:40,559 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:40,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:52:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:40,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:40,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:40,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:41,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896034379] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:41,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:41,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860910208] [2022-12-06 03:52:41,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:41,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:41,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:52:41,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 420 transitions, 8261 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:41,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:41,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:52:41,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:42,378 INFO L130 PetriNetUnfolder]: 1968/3345 cut-off events. [2022-12-06 03:52:42,378 INFO L131 PetriNetUnfolder]: For 100742/100742 co-relation queries the response was YES. [2022-12-06 03:52:42,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26170 conditions, 3345 events. 1968/3345 cut-off events. For 100742/100742 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 21134 event pairs, 84 based on Foata normal form. 26/3363 useless extension candidates. Maximal degree in co-relation 26093. Up to 1415 conditions per place. [2022-12-06 03:52:42,402 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 222 selfloop transitions, 337 changer transitions 0/559 dead transitions. [2022-12-06 03:52:42,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 559 transitions, 11124 flow [2022-12-06 03:52:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 120 transitions. [2022-12-06 03:52:42,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23166023166023167 [2022-12-06 03:52:42,404 INFO L175 Difference]: Start difference. First operand has 184 places, 420 transitions, 8261 flow. Second operand 14 states and 120 transitions. [2022-12-06 03:52:42,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 559 transitions, 11124 flow [2022-12-06 03:52:42,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 559 transitions, 11109 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:42,699 INFO L231 Difference]: Finished difference. Result has 202 places, 481 transitions, 10676 flow [2022-12-06 03:52:42,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8246, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10676, PETRI_PLACES=202, PETRI_TRANSITIONS=481} [2022-12-06 03:52:42,700 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 184 predicate places. [2022-12-06 03:52:42,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:42,700 INFO L89 Accepts]: Start accepts. Operand has 202 places, 481 transitions, 10676 flow [2022-12-06 03:52:42,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:42,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:42,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 481 transitions, 10676 flow [2022-12-06 03:52:42,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 481 transitions, 10676 flow [2022-12-06 03:52:42,826 INFO L130 PetriNetUnfolder]: 349/887 cut-off events. [2022-12-06 03:52:42,826 INFO L131 PetriNetUnfolder]: For 27058/27241 co-relation queries the response was YES. [2022-12-06 03:52:42,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9099 conditions, 887 events. 349/887 cut-off events. For 27058/27241 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 6707 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 9018. Up to 495 conditions per place. [2022-12-06 03:52:42,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 481 transitions, 10676 flow [2022-12-06 03:52:42,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 1504 [2022-12-06 03:52:42,903 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:42,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 03:52:42,903 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 481 transitions, 10674 flow [2022-12-06 03:52:42,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:42,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:42,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:42,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:43,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 03:52:43,108 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 550059245, now seen corresponding path program 1 times [2022-12-06 03:52:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:43,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618701348] [2022-12-06 03:52:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:43,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618701348] [2022-12-06 03:52:43,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618701348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:43,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442068497] [2022-12-06 03:52:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:43,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:43,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:43,202 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:43,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:52:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:43,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:43,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:43,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:43,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442068497] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:43,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:43,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879012486] [2022-12-06 03:52:43,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:43,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 03:52:43,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 481 transitions, 10674 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:43,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:43,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 03:52:43,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:44,906 INFO L130 PetriNetUnfolder]: 2022/3461 cut-off events. [2022-12-06 03:52:44,906 INFO L131 PetriNetUnfolder]: For 123227/123227 co-relation queries the response was YES. [2022-12-06 03:52:44,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29500 conditions, 3461 events. 2022/3461 cut-off events. For 123227/123227 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 22379 event pairs, 322 based on Foata normal form. 28/3481 useless extension candidates. Maximal degree in co-relation 29416. Up to 2775 conditions per place. [2022-12-06 03:52:44,936 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 394 selfloop transitions, 159 changer transitions 1/554 dead transitions. [2022-12-06 03:52:44,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 554 transitions, 12685 flow [2022-12-06 03:52:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:52:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:52:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-12-06 03:52:44,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20394736842105263 [2022-12-06 03:52:44,938 INFO L175 Difference]: Start difference. First operand has 202 places, 481 transitions, 10674 flow. Second operand 12 states and 93 transitions. [2022-12-06 03:52:44,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 554 transitions, 12685 flow [2022-12-06 03:52:45,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 554 transitions, 12544 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:45,414 INFO L231 Difference]: Finished difference. Result has 214 places, 509 transitions, 11737 flow [2022-12-06 03:52:45,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=10533, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11737, PETRI_PLACES=214, PETRI_TRANSITIONS=509} [2022-12-06 03:52:45,415 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 196 predicate places. [2022-12-06 03:52:45,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:45,415 INFO L89 Accepts]: Start accepts. Operand has 214 places, 509 transitions, 11737 flow [2022-12-06 03:52:45,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:45,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:45,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 509 transitions, 11737 flow [2022-12-06 03:52:45,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 509 transitions, 11737 flow [2022-12-06 03:52:45,590 INFO L130 PetriNetUnfolder]: 375/950 cut-off events. [2022-12-06 03:52:45,590 INFO L131 PetriNetUnfolder]: For 30823/31096 co-relation queries the response was YES. [2022-12-06 03:52:45,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 950 events. 375/950 cut-off events. For 30823/31096 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 7216 event pairs, 0 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 9914. Up to 540 conditions per place. [2022-12-06 03:52:45,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 509 transitions, 11737 flow [2022-12-06 03:52:45,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 1556 [2022-12-06 03:52:45,603 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:45,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 03:52:45,603 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 509 transitions, 11737 flow [2022-12-06 03:52:45,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:45,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:45,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:45,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-06 03:52:45,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 03:52:45,808 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -107052917, now seen corresponding path program 1 times [2022-12-06 03:52:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:45,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219700923] [2022-12-06 03:52:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:45,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:45,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219700923] [2022-12-06 03:52:45,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219700923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:45,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934822389] [2022-12-06 03:52:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:45,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:45,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:45,926 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:45,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:52:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:45,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:45,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:46,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:46,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934822389] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:46,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:46,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:46,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149906908] [2022-12-06 03:52:46,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:46,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:46,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 03:52:46,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 509 transitions, 11737 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:46,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:46,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 03:52:46,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:48,850 INFO L130 PetriNetUnfolder]: 2228/3829 cut-off events. [2022-12-06 03:52:48,851 INFO L131 PetriNetUnfolder]: For 157920/157920 co-relation queries the response was YES. [2022-12-06 03:52:48,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33225 conditions, 3829 events. 2228/3829 cut-off events. For 157920/157920 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 25340 event pairs, 165 based on Foata normal form. 42/3863 useless extension candidates. Maximal degree in co-relation 33137. Up to 1998 conditions per place. [2022-12-06 03:52:48,889 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 301 selfloop transitions, 355 changer transitions 1/657 dead transitions. [2022-12-06 03:52:48,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 657 transitions, 15095 flow [2022-12-06 03:52:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:52:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:52:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 153 transitions. [2022-12-06 03:52:48,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19172932330827067 [2022-12-06 03:52:48,891 INFO L175 Difference]: Start difference. First operand has 214 places, 509 transitions, 11737 flow. Second operand 21 states and 153 transitions. [2022-12-06 03:52:48,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 657 transitions, 15095 flow [2022-12-06 03:52:49,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 657 transitions, 14956 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-06 03:52:49,480 INFO L231 Difference]: Finished difference. Result has 237 places, 574 transitions, 14221 flow [2022-12-06 03:52:49,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=11598, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14221, PETRI_PLACES=237, PETRI_TRANSITIONS=574} [2022-12-06 03:52:49,481 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 219 predicate places. [2022-12-06 03:52:49,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:49,481 INFO L89 Accepts]: Start accepts. Operand has 237 places, 574 transitions, 14221 flow [2022-12-06 03:52:49,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:49,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:49,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 574 transitions, 14221 flow [2022-12-06 03:52:49,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 574 transitions, 14221 flow [2022-12-06 03:52:49,636 INFO L130 PetriNetUnfolder]: 416/1056 cut-off events. [2022-12-06 03:52:49,636 INFO L131 PetriNetUnfolder]: For 41717/41999 co-relation queries the response was YES. [2022-12-06 03:52:49,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11925 conditions, 1056 events. 416/1056 cut-off events. For 41717/41999 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 8260 event pairs, 0 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 11831. Up to 608 conditions per place. [2022-12-06 03:52:49,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 574 transitions, 14221 flow [2022-12-06 03:52:49,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 1724 [2022-12-06 03:52:49,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:49,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 03:52:49,708 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 574 transitions, 14225 flow [2022-12-06 03:52:49,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:49,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:49,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:49,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 03:52:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:49,913 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -118035783, now seen corresponding path program 1 times [2022-12-06 03:52:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:49,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12069025] [2022-12-06 03:52:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:49,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:49,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12069025] [2022-12-06 03:52:49,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12069025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:49,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304205815] [2022-12-06 03:52:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:49,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:49,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:49,951 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:49,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:52:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:50,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:52:50,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:50,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304205815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:50,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 03:52:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590968236] [2022-12-06 03:52:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:50,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:52:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:52:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:52:50,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:52:50,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 574 transitions, 14225 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52:50,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:50,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:52:50,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:50,876 INFO L130 PetriNetUnfolder]: 2329/3958 cut-off events. [2022-12-06 03:52:50,877 INFO L131 PetriNetUnfolder]: For 157094/157094 co-relation queries the response was YES. [2022-12-06 03:52:50,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36513 conditions, 3958 events. 2329/3958 cut-off events. For 157094/157094 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 26167 event pairs, 532 based on Foata normal form. 3/3953 useless extension candidates. Maximal degree in co-relation 36416. Up to 2419 conditions per place. [2022-12-06 03:52:50,913 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 755 selfloop transitions, 8 changer transitions 4/767 dead transitions. [2022-12-06 03:52:50,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 767 transitions, 20473 flow [2022-12-06 03:52:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:52:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:52:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 03:52:50,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 03:52:50,916 INFO L175 Difference]: Start difference. First operand has 237 places, 574 transitions, 14225 flow. Second operand 4 states and 48 transitions. [2022-12-06 03:52:50,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 767 transitions, 20473 flow [2022-12-06 03:52:51,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 767 transitions, 20017 flow, removed 160 selfloop flow, removed 6 redundant places. [2022-12-06 03:52:51,850 INFO L231 Difference]: Finished difference. Result has 235 places, 566 transitions, 13624 flow [2022-12-06 03:52:51,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13594, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13624, PETRI_PLACES=235, PETRI_TRANSITIONS=566} [2022-12-06 03:52:51,850 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 217 predicate places. [2022-12-06 03:52:51,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:51,850 INFO L89 Accepts]: Start accepts. Operand has 235 places, 566 transitions, 13624 flow [2022-12-06 03:52:51,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:51,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:51,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 566 transitions, 13624 flow [2022-12-06 03:52:51,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 566 transitions, 13624 flow [2022-12-06 03:52:52,035 INFO L130 PetriNetUnfolder]: 446/1103 cut-off events. [2022-12-06 03:52:52,035 INFO L131 PetriNetUnfolder]: For 44798/45064 co-relation queries the response was YES. [2022-12-06 03:52:52,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12564 conditions, 1103 events. 446/1103 cut-off events. For 44798/45064 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 8562 event pairs, 0 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 12469. Up to 636 conditions per place. [2022-12-06 03:52:52,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 566 transitions, 13624 flow [2022-12-06 03:52:52,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 1750 [2022-12-06 03:52:52,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:52,076 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 03:52:52,076 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 566 transitions, 13624 flow [2022-12-06 03:52:52,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52:52,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:52,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:52,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:52,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:52,282 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 734908813, now seen corresponding path program 1 times [2022-12-06 03:52:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:52,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907598228] [2022-12-06 03:52:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:52:52,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:52,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907598228] [2022-12-06 03:52:52,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907598228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:52,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581773710] [2022-12-06 03:52:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:52,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:52,338 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:52,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 03:52:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:52,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:52:52,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:52:52,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:52,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581773710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:52,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:52,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-06 03:52:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114518297] [2022-12-06 03:52:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:52,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:52:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:52:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:52:52,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 03:52:52,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 566 transitions, 13624 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:52:52,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:52,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 03:52:52,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:53,277 INFO L130 PetriNetUnfolder]: 2307/3918 cut-off events. [2022-12-06 03:52:53,277 INFO L131 PetriNetUnfolder]: For 161053/161053 co-relation queries the response was YES. [2022-12-06 03:52:53,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37249 conditions, 3918 events. 2307/3918 cut-off events. For 161053/161053 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 25823 event pairs, 517 based on Foata normal form. 6/3916 useless extension candidates. Maximal degree in co-relation 37151. Up to 2075 conditions per place. [2022-12-06 03:52:53,312 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 784 selfloop transitions, 6 changer transitions 4/794 dead transitions. [2022-12-06 03:52:53,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 794 transitions, 20865 flow [2022-12-06 03:52:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:52:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:52:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 03:52:53,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3092105263157895 [2022-12-06 03:52:53,313 INFO L175 Difference]: Start difference. First operand has 235 places, 566 transitions, 13624 flow. Second operand 4 states and 47 transitions. [2022-12-06 03:52:53,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 794 transitions, 20865 flow [2022-12-06 03:52:54,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 794 transitions, 20864 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:54,071 INFO L231 Difference]: Finished difference. Result has 238 places, 560 transitions, 13535 flow [2022-12-06 03:52:54,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=13509, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13535, PETRI_PLACES=238, PETRI_TRANSITIONS=560} [2022-12-06 03:52:54,072 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 220 predicate places. [2022-12-06 03:52:54,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:54,072 INFO L89 Accepts]: Start accepts. Operand has 238 places, 560 transitions, 13535 flow [2022-12-06 03:52:54,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:54,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:54,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 560 transitions, 13535 flow [2022-12-06 03:52:54,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 560 transitions, 13535 flow [2022-12-06 03:52:54,229 INFO L130 PetriNetUnfolder]: 447/1102 cut-off events. [2022-12-06 03:52:54,229 INFO L131 PetriNetUnfolder]: For 44135/44433 co-relation queries the response was YES. [2022-12-06 03:52:54,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12878 conditions, 1102 events. 447/1102 cut-off events. For 44135/44433 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 8492 event pairs, 0 based on Foata normal form. 0/1098 useless extension candidates. Maximal degree in co-relation 12781. Up to 635 conditions per place. [2022-12-06 03:52:54,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 560 transitions, 13535 flow [2022-12-06 03:52:54,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-06 03:52:54,250 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:54,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 03:52:54,255 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 560 transitions, 13535 flow [2022-12-06 03:52:54,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:52:54,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:54,255 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:54,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 03:52:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 03:52:54,459 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash -114311350, now seen corresponding path program 1 times [2022-12-06 03:52:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:54,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898384494] [2022-12-06 03:52:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898384494] [2022-12-06 03:52:54,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898384494] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:54,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446227894] [2022-12-06 03:52:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:54,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:54,572 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:54,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 03:52:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:54,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:52:54,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:54,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:54,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446227894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:54,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:54,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976855040] [2022-12-06 03:52:54,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:54,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:54,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:52:54,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 560 transitions, 13535 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:54,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:54,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:52:54,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:56,166 INFO L130 PetriNetUnfolder]: 2417/4120 cut-off events. [2022-12-06 03:52:56,167 INFO L131 PetriNetUnfolder]: For 212188/212188 co-relation queries the response was YES. [2022-12-06 03:52:56,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40721 conditions, 4120 events. 2417/4120 cut-off events. For 212188/212188 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 27374 event pairs, 393 based on Foata normal form. 48/4160 useless extension candidates. Maximal degree in co-relation 40621. Up to 3155 conditions per place. [2022-12-06 03:52:56,204 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 453 selfloop transitions, 206 changer transitions 1/660 dead transitions. [2022-12-06 03:52:56,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 660 transitions, 16261 flow [2022-12-06 03:52:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:52:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:52:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-06 03:52:56,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20997920997921 [2022-12-06 03:52:56,205 INFO L175 Difference]: Start difference. First operand has 238 places, 560 transitions, 13535 flow. Second operand 13 states and 101 transitions. [2022-12-06 03:52:56,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 660 transitions, 16261 flow [2022-12-06 03:52:57,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 660 transitions, 16240 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:57,082 INFO L231 Difference]: Finished difference. Result has 254 places, 592 transitions, 15149 flow [2022-12-06 03:52:57,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13532, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15149, PETRI_PLACES=254, PETRI_TRANSITIONS=592} [2022-12-06 03:52:57,082 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 236 predicate places. [2022-12-06 03:52:57,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:57,082 INFO L89 Accepts]: Start accepts. Operand has 254 places, 592 transitions, 15149 flow [2022-12-06 03:52:57,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:57,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:57,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 592 transitions, 15149 flow [2022-12-06 03:52:57,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 592 transitions, 15149 flow [2022-12-06 03:52:57,265 INFO L130 PetriNetUnfolder]: 481/1192 cut-off events. [2022-12-06 03:52:57,265 INFO L131 PetriNetUnfolder]: For 54981/55334 co-relation queries the response was YES. [2022-12-06 03:52:57,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14538 conditions, 1192 events. 481/1192 cut-off events. For 54981/55334 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 9387 event pairs, 2 based on Foata normal form. 0/1190 useless extension candidates. Maximal degree in co-relation 14435. Up to 694 conditions per place. [2022-12-06 03:52:57,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 592 transitions, 15149 flow [2022-12-06 03:52:57,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 1814 [2022-12-06 03:52:57,289 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:57,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 03:52:57,289 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 592 transitions, 15149 flow [2022-12-06 03:52:57,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:57,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:57,289 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:57,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:57,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 03:52:57,493 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:57,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash 333331119, now seen corresponding path program 2 times [2022-12-06 03:52:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:57,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963833003] [2022-12-06 03:52:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:57,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:57,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963833003] [2022-12-06 03:52:57,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963833003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:57,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382641090] [2022-12-06 03:52:57,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:52:57,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:57,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:57,652 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:57,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 03:52:57,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:52:57,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:52:57,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:52:57,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:57,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:58,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382641090] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:58,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:58,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:52:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405986310] [2022-12-06 03:52:58,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:58,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:52:58,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:58,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:52:58,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:52:58,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:52:58,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 592 transitions, 15149 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:58,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:58,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:52:58,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:00,884 INFO L130 PetriNetUnfolder]: 3165/5280 cut-off events. [2022-12-06 03:53:00,884 INFO L131 PetriNetUnfolder]: For 346545/346545 co-relation queries the response was YES. [2022-12-06 03:53:00,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56601 conditions, 5280 events. 3165/5280 cut-off events. For 346545/346545 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 35509 event pairs, 93 based on Foata normal form. 48/5320 useless extension candidates. Maximal degree in co-relation 56495. Up to 2088 conditions per place. [2022-12-06 03:53:00,927 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 215 selfloop transitions, 608 changer transitions 0/823 dead transitions. [2022-12-06 03:53:00,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 823 transitions, 20982 flow [2022-12-06 03:53:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:53:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:53:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-12-06 03:53:00,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2076167076167076 [2022-12-06 03:53:00,928 INFO L175 Difference]: Start difference. First operand has 254 places, 592 transitions, 15149 flow. Second operand 22 states and 169 transitions. [2022-12-06 03:53:00,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 823 transitions, 20982 flow [2022-12-06 03:53:02,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 823 transitions, 20606 flow, removed 152 selfloop flow, removed 4 redundant places. [2022-12-06 03:53:02,018 INFO L231 Difference]: Finished difference. Result has 276 places, 695 transitions, 19574 flow [2022-12-06 03:53:02,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14827, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19574, PETRI_PLACES=276, PETRI_TRANSITIONS=695} [2022-12-06 03:53:02,020 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 258 predicate places. [2022-12-06 03:53:02,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:02,020 INFO L89 Accepts]: Start accepts. Operand has 276 places, 695 transitions, 19574 flow [2022-12-06 03:53:02,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:02,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:02,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 695 transitions, 19574 flow [2022-12-06 03:53:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 695 transitions, 19574 flow [2022-12-06 03:53:02,294 INFO L130 PetriNetUnfolder]: 642/1529 cut-off events. [2022-12-06 03:53:02,294 INFO L131 PetriNetUnfolder]: For 96650/97108 co-relation queries the response was YES. [2022-12-06 03:53:02,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20880 conditions, 1529 events. 642/1529 cut-off events. For 96650/97108 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 12353 event pairs, 6 based on Foata normal form. 4/1531 useless extension candidates. Maximal degree in co-relation 20771. Up to 924 conditions per place. [2022-12-06 03:53:02,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 695 transitions, 19574 flow [2022-12-06 03:53:02,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 2192 [2022-12-06 03:53:02,323 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:02,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-06 03:53:02,327 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 695 transitions, 19574 flow [2022-12-06 03:53:02,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:02,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:02,327 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:02,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:02,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 03:53:02,532 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash 889326101, now seen corresponding path program 2 times [2022-12-06 03:53:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:02,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854586027] [2022-12-06 03:53:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:02,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:02,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854586027] [2022-12-06 03:53:02,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854586027] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:02,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301091535] [2022-12-06 03:53:02,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:53:02,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:02,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:02,712 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:02,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 03:53:02,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:53:02,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:53:02,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:53:02,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:02,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:03,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301091535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:03,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:03,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:03,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727128161] [2022-12-06 03:53:03,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:03,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:03,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:03,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:03,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:53:03,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 695 transitions, 19574 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:03,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:03,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:53:03,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:10,348 INFO L130 PetriNetUnfolder]: 3543/5898 cut-off events. [2022-12-06 03:53:10,349 INFO L131 PetriNetUnfolder]: For 499536/499536 co-relation queries the response was YES. [2022-12-06 03:53:10,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66568 conditions, 5898 events. 3543/5898 cut-off events. For 499536/499536 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 40040 event pairs, 235 based on Foata normal form. 106/5996 useless extension candidates. Maximal degree in co-relation 66456. Up to 3107 conditions per place. [2022-12-06 03:53:10,422 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 448 selfloop transitions, 487 changer transitions 4/939 dead transitions. [2022-12-06 03:53:10,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 939 transitions, 25033 flow [2022-12-06 03:53:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 03:53:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 03:53:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 216 transitions. [2022-12-06 03:53:10,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17170111287758347 [2022-12-06 03:53:10,425 INFO L175 Difference]: Start difference. First operand has 276 places, 695 transitions, 19574 flow. Second operand 34 states and 216 transitions. [2022-12-06 03:53:10,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 939 transitions, 25033 flow [2022-12-06 03:53:12,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 939 transitions, 23835 flow, removed 509 selfloop flow, removed 13 redundant places. [2022-12-06 03:53:12,257 INFO L231 Difference]: Finished difference. Result has 307 places, 760 transitions, 22107 flow [2022-12-06 03:53:12,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18548, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=434, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=22107, PETRI_PLACES=307, PETRI_TRANSITIONS=760} [2022-12-06 03:53:12,259 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 289 predicate places. [2022-12-06 03:53:12,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:12,259 INFO L89 Accepts]: Start accepts. Operand has 307 places, 760 transitions, 22107 flow [2022-12-06 03:53:12,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:12,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:12,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 760 transitions, 22107 flow [2022-12-06 03:53:12,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 760 transitions, 22107 flow [2022-12-06 03:53:12,717 INFO L130 PetriNetUnfolder]: 737/1740 cut-off events. [2022-12-06 03:53:12,717 INFO L131 PetriNetUnfolder]: For 111362/111812 co-relation queries the response was YES. [2022-12-06 03:53:12,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24066 conditions, 1740 events. 737/1740 cut-off events. For 111362/111812 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 14274 event pairs, 5 based on Foata normal form. 2/1740 useless extension candidates. Maximal degree in co-relation 23950. Up to 915 conditions per place. [2022-12-06 03:53:12,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 760 transitions, 22107 flow [2022-12-06 03:53:12,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 2428 [2022-12-06 03:53:12,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:53:12,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:53:12,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [379] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_243) v_~x~0_242) (= (* 2 v_~next~0_132) (+ (* 3 v_~prev~0_256) (* 21 v_~prev~0_257) (* 34 v_~cur~0_212))) (= (+ v_~q~0_222 1) v_~q~0_221) (= v_~j~0_315 (+ v_~j~0_316 v_~i~0_251)) (= (* 5 v_~prev~0_256) (+ (* v_~prev~0_257 13) (* 21 v_~cur~0_212) (* 3 v_~next~0_132))) (= v_~next~0_132 v_~cur~0_211) (< v_~q~0_222 5) (< v_~x~0_243 1)) InVars {~j~0=v_~j~0_316, ~prev~0=v_~prev~0_257, ~i~0=v_~i~0_251, ~q~0=v_~q~0_222, ~cur~0=v_~cur~0_212, ~x~0=v_~x~0_243} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_153|, ~j~0=v_~j~0_315, ~next~0=v_~next~0_132, ~prev~0=v_~prev~0_256, ~i~0=v_~i~0_251, ~q~0=v_~q~0_221, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_159|, ~cur~0=v_~cur~0_211, ~x~0=v_~x~0_242} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:53:12,975 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:53:12,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 716 [2022-12-06 03:53:12,975 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 760 transitions, 22131 flow [2022-12-06 03:53:12,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:12,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:12,976 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:12,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:13,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 03:53:13,181 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 88753991, now seen corresponding path program 2 times [2022-12-06 03:53:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:13,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679505558] [2022-12-06 03:53:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679505558] [2022-12-06 03:53:13,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679505558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734299357] [2022-12-06 03:53:13,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:53:13,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:13,239 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:13,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 03:53:13,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:53:13,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:53:13,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:53:13,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:13,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:13,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734299357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:13,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:13,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-12-06 03:53:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557298492] [2022-12-06 03:53:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:13,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:53:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:53:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:53:13,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:53:13,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 760 transitions, 22131 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:53:13,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:13,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:53:13,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:14,827 INFO L130 PetriNetUnfolder]: 3505/5880 cut-off events. [2022-12-06 03:53:14,827 INFO L131 PetriNetUnfolder]: For 380741/380741 co-relation queries the response was YES. [2022-12-06 03:53:14,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66770 conditions, 5880 events. 3505/5880 cut-off events. For 380741/380741 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 41914 event pairs, 585 based on Foata normal form. 102/5974 useless extension candidates. Maximal degree in co-relation 66651. Up to 3003 conditions per place. [2022-12-06 03:53:15,034 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 1139 selfloop transitions, 71 changer transitions 14/1224 dead transitions. [2022-12-06 03:53:15,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1224 transitions, 38355 flow [2022-12-06 03:53:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:53:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:53:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-06 03:53:15,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3547008547008547 [2022-12-06 03:53:15,040 INFO L175 Difference]: Start difference. First operand has 307 places, 760 transitions, 22131 flow. Second operand 6 states and 83 transitions. [2022-12-06 03:53:15,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1224 transitions, 38355 flow [2022-12-06 03:53:16,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1224 transitions, 36736 flow, removed 634 selfloop flow, removed 16 redundant places. [2022-12-06 03:53:16,717 INFO L231 Difference]: Finished difference. Result has 299 places, 782 transitions, 22332 flow [2022-12-06 03:53:16,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=20794, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22332, PETRI_PLACES=299, PETRI_TRANSITIONS=782} [2022-12-06 03:53:16,718 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 281 predicate places. [2022-12-06 03:53:16,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:16,718 INFO L89 Accepts]: Start accepts. Operand has 299 places, 782 transitions, 22332 flow [2022-12-06 03:53:16,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:16,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:16,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 782 transitions, 22332 flow [2022-12-06 03:53:16,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 782 transitions, 22332 flow [2022-12-06 03:53:17,074 INFO L130 PetriNetUnfolder]: 701/1724 cut-off events. [2022-12-06 03:53:17,074 INFO L131 PetriNetUnfolder]: For 114873/115347 co-relation queries the response was YES. [2022-12-06 03:53:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23724 conditions, 1724 events. 701/1724 cut-off events. For 114873/115347 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 14457 event pairs, 3 based on Foata normal form. 20/1741 useless extension candidates. Maximal degree in co-relation 23605. Up to 900 conditions per place. [2022-12-06 03:53:17,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 782 transitions, 22332 flow [2022-12-06 03:53:17,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 2534 [2022-12-06 03:53:17,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:53:17,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-06 03:53:17,149 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 782 transitions, 22345 flow [2022-12-06 03:53:17,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:53:17,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:17,149 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:17,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:17,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:17,353 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:17,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:17,353 INFO L85 PathProgramCache]: Analyzing trace with hash 734997008, now seen corresponding path program 1 times [2022-12-06 03:53:17,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:17,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652099434] [2022-12-06 03:53:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652099434] [2022-12-06 03:53:17,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652099434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:17,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237255246] [2022-12-06 03:53:17,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:17,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:17,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:17,385 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:17,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 03:53:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:17,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:53:17,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:17,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237255246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:17,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:17,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-06 03:53:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441763117] [2022-12-06 03:53:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:17,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:53:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:17,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:53:17,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:53:17,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 03:53:17,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 782 transitions, 22345 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:53:17,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:17,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 03:53:17,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:18,992 INFO L130 PetriNetUnfolder]: 3427/5784 cut-off events. [2022-12-06 03:53:18,993 INFO L131 PetriNetUnfolder]: For 382022/382022 co-relation queries the response was YES. [2022-12-06 03:53:19,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66768 conditions, 5784 events. 3427/5784 cut-off events. For 382022/382022 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 40470 event pairs, 652 based on Foata normal form. 3/5779 useless extension candidates. Maximal degree in co-relation 66646. Up to 3069 conditions per place. [2022-12-06 03:53:19,145 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 1100 selfloop transitions, 6 changer transitions 43/1149 dead transitions. [2022-12-06 03:53:19,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 1149 transitions, 35629 flow [2022-12-06 03:53:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:53:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:53:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 03:53:19,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30625 [2022-12-06 03:53:19,148 INFO L175 Difference]: Start difference. First operand has 298 places, 782 transitions, 22345 flow. Second operand 4 states and 49 transitions. [2022-12-06 03:53:19,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 1149 transitions, 35629 flow [2022-12-06 03:53:20,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 1149 transitions, 35118 flow, removed 255 selfloop flow, removed 1 redundant places. [2022-12-06 03:53:20,820 INFO L231 Difference]: Finished difference. Result has 300 places, 777 transitions, 21986 flow [2022-12-06 03:53:20,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21974, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=21986, PETRI_PLACES=300, PETRI_TRANSITIONS=777} [2022-12-06 03:53:20,820 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 282 predicate places. [2022-12-06 03:53:20,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:20,821 INFO L89 Accepts]: Start accepts. Operand has 300 places, 777 transitions, 21986 flow [2022-12-06 03:53:20,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:20,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:20,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 300 places, 777 transitions, 21986 flow [2022-12-06 03:53:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 777 transitions, 21986 flow [2022-12-06 03:53:21,213 INFO L130 PetriNetUnfolder]: 705/1757 cut-off events. [2022-12-06 03:53:21,214 INFO L131 PetriNetUnfolder]: For 115087/115774 co-relation queries the response was YES. [2022-12-06 03:53:21,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24189 conditions, 1757 events. 705/1757 cut-off events. For 115087/115774 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 14951 event pairs, 3 based on Foata normal form. 12/1765 useless extension candidates. Maximal degree in co-relation 24069. Up to 914 conditions per place. [2022-12-06 03:53:21,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 777 transitions, 21986 flow [2022-12-06 03:53:21,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 2458 [2022-12-06 03:53:21,248 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:21,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-06 03:53:21,251 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 777 transitions, 21986 flow [2022-12-06 03:53:21,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:53:21,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:21,251 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:21,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-06 03:53:21,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:21,456 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash 481631382, now seen corresponding path program 1 times [2022-12-06 03:53:21,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:21,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245698702] [2022-12-06 03:53:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:21,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245698702] [2022-12-06 03:53:21,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245698702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:21,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752200534] [2022-12-06 03:53:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:21,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:21,496 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:21,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 03:53:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:21,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:53:21,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:21,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:21,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752200534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:21,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:21,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 03:53:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178428969] [2022-12-06 03:53:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:21,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:53:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:53:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:53:21,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:53:21,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 777 transitions, 21986 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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:53:21,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:21,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:53:21,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:23,309 INFO L130 PetriNetUnfolder]: 3582/6011 cut-off events. [2022-12-06 03:53:23,310 INFO L131 PetriNetUnfolder]: For 407879/407879 co-relation queries the response was YES. [2022-12-06 03:53:23,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70148 conditions, 6011 events. 3582/6011 cut-off events. For 407879/407879 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 42762 event pairs, 481 based on Foata normal form. 68/6071 useless extension candidates. Maximal degree in co-relation 70025. Up to 3250 conditions per place. [2022-12-06 03:53:23,374 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 1132 selfloop transitions, 186 changer transitions 12/1330 dead transitions. [2022-12-06 03:53:23,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 1330 transitions, 40376 flow [2022-12-06 03:53:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:53:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:53:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-06 03:53:23,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.336996336996337 [2022-12-06 03:53:23,378 INFO L175 Difference]: Start difference. First operand has 300 places, 777 transitions, 21986 flow. Second operand 7 states and 92 transitions. [2022-12-06 03:53:23,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 1330 transitions, 40376 flow [2022-12-06 03:53:25,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 1330 transitions, 40361 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:25,369 INFO L231 Difference]: Finished difference. Result has 308 places, 834 transitions, 24735 flow [2022-12-06 03:53:25,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=21659, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24735, PETRI_PLACES=308, PETRI_TRANSITIONS=834} [2022-12-06 03:53:25,370 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 290 predicate places. [2022-12-06 03:53:25,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:25,371 INFO L89 Accepts]: Start accepts. Operand has 308 places, 834 transitions, 24735 flow [2022-12-06 03:53:25,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:25,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:25,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 834 transitions, 24735 flow [2022-12-06 03:53:25,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 834 transitions, 24735 flow [2022-12-06 03:53:25,769 INFO L130 PetriNetUnfolder]: 736/1834 cut-off events. [2022-12-06 03:53:25,769 INFO L131 PetriNetUnfolder]: For 138499/139241 co-relation queries the response was YES. [2022-12-06 03:53:25,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26444 conditions, 1834 events. 736/1834 cut-off events. For 138499/139241 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 15755 event pairs, 2 based on Foata normal form. 34/1864 useless extension candidates. Maximal degree in co-relation 26320. Up to 960 conditions per place. [2022-12-06 03:53:25,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 834 transitions, 24735 flow [2022-12-06 03:53:25,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 2690 [2022-12-06 03:53:25,892 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:25,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-06 03:53:25,892 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 834 transitions, 24735 flow [2022-12-06 03:53:25,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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:53:25,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:25,892 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:25,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:26,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-06 03:53:26,093 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1799695616, now seen corresponding path program 2 times [2022-12-06 03:53:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:26,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410698151] [2022-12-06 03:53:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410698151] [2022-12-06 03:53:26,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410698151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388049228] [2022-12-06 03:53:26,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:53:26,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:26,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:26,213 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:26,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 03:53:26,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:53:26,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:53:26,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:53:26,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:26,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:26,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388049228] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:26,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:26,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091629088] [2022-12-06 03:53:26,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:26,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:26,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:26,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:26,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:53:26,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 834 transitions, 24735 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:26,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:26,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:53:26,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:31,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:34,996 INFO L130 PetriNetUnfolder]: 3702/6255 cut-off events. [2022-12-06 03:53:34,996 INFO L131 PetriNetUnfolder]: For 519204/519204 co-relation queries the response was YES. [2022-12-06 03:53:35,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76041 conditions, 6255 events. 3702/6255 cut-off events. For 519204/519204 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 43923 event pairs, 552 based on Foata normal form. 56/6303 useless extension candidates. Maximal degree in co-relation 75914. Up to 4946 conditions per place. [2022-12-06 03:53:35,063 INFO L137 encePairwiseOnDemand]: 9/39 looper letters, 697 selfloop transitions, 310 changer transitions 8/1015 dead transitions. [2022-12-06 03:53:35,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1015 transitions, 29988 flow [2022-12-06 03:53:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:53:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:53:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 184 transitions. [2022-12-06 03:53:35,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14743589743589744 [2022-12-06 03:53:35,065 INFO L175 Difference]: Start difference. First operand has 308 places, 834 transitions, 24735 flow. Second operand 32 states and 184 transitions. [2022-12-06 03:53:35,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1015 transitions, 29988 flow [2022-12-06 03:53:37,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1015 transitions, 29298 flow, removed 325 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:37,434 INFO L231 Difference]: Finished difference. Result has 342 places, 895 transitions, 27162 flow [2022-12-06 03:53:37,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=24093, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=27162, PETRI_PLACES=342, PETRI_TRANSITIONS=895} [2022-12-06 03:53:37,435 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 324 predicate places. [2022-12-06 03:53:37,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:37,435 INFO L89 Accepts]: Start accepts. Operand has 342 places, 895 transitions, 27162 flow [2022-12-06 03:53:37,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:37,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:37,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 342 places, 895 transitions, 27162 flow [2022-12-06 03:53:37,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 895 transitions, 27162 flow [2022-12-06 03:53:37,952 INFO L130 PetriNetUnfolder]: 784/1946 cut-off events. [2022-12-06 03:53:37,952 INFO L131 PetriNetUnfolder]: For 164467/165199 co-relation queries the response was YES. [2022-12-06 03:53:37,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28664 conditions, 1946 events. 784/1946 cut-off events. For 164467/165199 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 16829 event pairs, 5 based on Foata normal form. 30/1972 useless extension candidates. Maximal degree in co-relation 28535. Up to 1035 conditions per place. [2022-12-06 03:53:37,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 342 places, 895 transitions, 27162 flow [2022-12-06 03:53:37,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 2802 [2022-12-06 03:53:38,231 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:53:38,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 797 [2022-12-06 03:53:38,232 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 895 transitions, 27228 flow [2022-12-06 03:53:38,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:38,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:38,232 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:38,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:38,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:38,433 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash 975749792, now seen corresponding path program 2 times [2022-12-06 03:53:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:38,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335766991] [2022-12-06 03:53:38,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:38,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:38,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335766991] [2022-12-06 03:53:38,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335766991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:38,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741953612] [2022-12-06 03:53:38,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:53:38,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:38,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:38,463 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:38,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 03:53:38,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:53:38,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:53:38,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:53:38,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:38,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:38,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741953612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:38,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:38,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-06 03:53:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990338418] [2022-12-06 03:53:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:38,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:53:38,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:38,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:53:38,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:53:38,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 03:53:38,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 895 transitions, 27228 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:53:38,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:38,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 03:53:38,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:40,317 INFO L130 PetriNetUnfolder]: 3488/5946 cut-off events. [2022-12-06 03:53:40,317 INFO L131 PetriNetUnfolder]: For 463889/463889 co-relation queries the response was YES. [2022-12-06 03:53:40,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73326 conditions, 5946 events. 3488/5946 cut-off events. For 463889/463889 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 42437 event pairs, 555 based on Foata normal form. 87/6025 useless extension candidates. Maximal degree in co-relation 73194. Up to 2948 conditions per place. [2022-12-06 03:53:40,388 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 1217 selfloop transitions, 27 changer transitions 67/1311 dead transitions. [2022-12-06 03:53:40,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1311 transitions, 43138 flow [2022-12-06 03:53:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:53:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:53:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 03:53:40,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2022-12-06 03:53:40,389 INFO L175 Difference]: Start difference. First operand has 342 places, 895 transitions, 27228 flow. Second operand 5 states and 64 transitions. [2022-12-06 03:53:40,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1311 transitions, 43138 flow [2022-12-06 03:53:42,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 1311 transitions, 41934 flow, removed 562 selfloop flow, removed 10 redundant places. [2022-12-06 03:53:42,584 INFO L231 Difference]: Finished difference. Result has 338 places, 843 transitions, 25127 flow [2022-12-06 03:53:42,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=24774, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=25127, PETRI_PLACES=338, PETRI_TRANSITIONS=843} [2022-12-06 03:53:42,585 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 320 predicate places. [2022-12-06 03:53:42,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:42,585 INFO L89 Accepts]: Start accepts. Operand has 338 places, 843 transitions, 25127 flow [2022-12-06 03:53:42,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:42,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:42,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 338 places, 843 transitions, 25127 flow [2022-12-06 03:53:42,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 843 transitions, 25127 flow [2022-12-06 03:53:42,972 INFO L130 PetriNetUnfolder]: 707/1820 cut-off events. [2022-12-06 03:53:42,973 INFO L131 PetriNetUnfolder]: For 156448/157251 co-relation queries the response was YES. [2022-12-06 03:53:42,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26971 conditions, 1820 events. 707/1820 cut-off events. For 156448/157251 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 15862 event pairs, 3 based on Foata normal form. 41/1857 useless extension candidates. Maximal degree in co-relation 26839. Up to 898 conditions per place. [2022-12-06 03:53:43,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 843 transitions, 25127 flow [2022-12-06 03:53:43,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 2664 [2022-12-06 03:53:43,012 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:43,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 428 [2022-12-06 03:53:43,014 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 843 transitions, 25127 flow [2022-12-06 03:53:43,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:53:43,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:43,014 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:43,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:43,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:43,219 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1817225217, now seen corresponding path program 1 times [2022-12-06 03:53:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:43,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036336372] [2022-12-06 03:53:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:43,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:43,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036336372] [2022-12-06 03:53:43,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036336372] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:43,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601673300] [2022-12-06 03:53:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:43,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:43,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:43,327 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:43,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 03:53:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:43,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:53:43,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:43,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:43,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601673300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:43,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:43,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490336159] [2022-12-06 03:53:43,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:43,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:43,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 03:53:43,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 843 transitions, 25127 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:43,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:43,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 03:53:43,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:52,252 INFO L130 PetriNetUnfolder]: 3609/6180 cut-off events. [2022-12-06 03:53:52,252 INFO L131 PetriNetUnfolder]: For 535247/535247 co-relation queries the response was YES. [2022-12-06 03:53:52,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77358 conditions, 6180 events. 3609/6180 cut-off events. For 535247/535247 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 43999 event pairs, 480 based on Foata normal form. 42/6214 useless extension candidates. Maximal degree in co-relation 77223. Up to 4721 conditions per place. [2022-12-06 03:53:52,320 INFO L137 encePairwiseOnDemand]: 9/42 looper letters, 668 selfloop transitions, 356 changer transitions 5/1029 dead transitions. [2022-12-06 03:53:52,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1029 transitions, 30618 flow [2022-12-06 03:53:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 03:53:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 03:53:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 176 transitions. [2022-12-06 03:53:52,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1444991789819376 [2022-12-06 03:53:52,322 INFO L175 Difference]: Start difference. First operand has 335 places, 843 transitions, 25127 flow. Second operand 29 states and 176 transitions. [2022-12-06 03:53:52,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 1029 transitions, 30618 flow [2022-12-06 03:53:55,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1029 transitions, 30401 flow, removed 77 selfloop flow, removed 5 redundant places. [2022-12-06 03:53:55,353 INFO L231 Difference]: Finished difference. Result has 365 places, 909 transitions, 28282 flow [2022-12-06 03:53:55,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=24972, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=843, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=28282, PETRI_PLACES=365, PETRI_TRANSITIONS=909} [2022-12-06 03:53:55,358 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 347 predicate places. [2022-12-06 03:53:55,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:55,358 INFO L89 Accepts]: Start accepts. Operand has 365 places, 909 transitions, 28282 flow [2022-12-06 03:53:55,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:55,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:55,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 909 transitions, 28282 flow [2022-12-06 03:53:55,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 365 places, 909 transitions, 28282 flow [2022-12-06 03:53:55,824 INFO L130 PetriNetUnfolder]: 740/1920 cut-off events. [2022-12-06 03:53:55,825 INFO L131 PetriNetUnfolder]: For 178391/179055 co-relation queries the response was YES. [2022-12-06 03:53:55,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29203 conditions, 1920 events. 740/1920 cut-off events. For 178391/179055 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 17025 event pairs, 3 based on Foata normal form. 45/1961 useless extension candidates. Maximal degree in co-relation 29064. Up to 965 conditions per place. [2022-12-06 03:53:55,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 909 transitions, 28282 flow [2022-12-06 03:53:55,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 2798 [2022-12-06 03:53:56,006 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:53:56,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 649 [2022-12-06 03:53:56,007 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 909 transitions, 28320 flow [2022-12-06 03:53:56,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:56,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:56,007 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:56,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:56,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 03:53:56,213 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1021002321, now seen corresponding path program 1 times [2022-12-06 03:53:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:56,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038239777] [2022-12-06 03:53:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038239777] [2022-12-06 03:53:56,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038239777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729954047] [2022-12-06 03:53:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:56,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:56,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:56,344 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:56,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 03:53:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:56,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:53:56,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:56,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:57,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729954047] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:57,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:57,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258827800] [2022-12-06 03:53:57,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:57,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:57,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:57,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:57,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 03:53:57,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 909 transitions, 28320 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:57,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:57,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 03:53:57,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:00,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:04,402 INFO L130 PetriNetUnfolder]: 4149/7112 cut-off events. [2022-12-06 03:54:04,402 INFO L131 PetriNetUnfolder]: For 798837/798837 co-relation queries the response was YES. [2022-12-06 03:54:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92965 conditions, 7112 events. 4149/7112 cut-off events. For 798837/798837 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 51885 event pairs, 277 based on Foata normal form. 76/7180 useless extension candidates. Maximal degree in co-relation 92823. Up to 3768 conditions per place. [2022-12-06 03:54:04,488 INFO L137 encePairwiseOnDemand]: 8/44 looper letters, 577 selfloop transitions, 646 changer transitions 10/1233 dead transitions. [2022-12-06 03:54:04,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 1233 transitions, 37790 flow [2022-12-06 03:54:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 03:54:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 03:54:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 234 transitions. [2022-12-06 03:54:04,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15194805194805194 [2022-12-06 03:54:04,490 INFO L175 Difference]: Start difference. First operand has 365 places, 909 transitions, 28320 flow. Second operand 35 states and 234 transitions. [2022-12-06 03:54:04,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 1233 transitions, 37790 flow [2022-12-06 03:54:08,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 1233 transitions, 36998 flow, removed 338 selfloop flow, removed 9 redundant places. [2022-12-06 03:54:08,641 INFO L231 Difference]: Finished difference. Result has 403 places, 1045 transitions, 34634 flow [2022-12-06 03:54:08,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=27618, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=526, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=34634, PETRI_PLACES=403, PETRI_TRANSITIONS=1045} [2022-12-06 03:54:08,642 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 385 predicate places. [2022-12-06 03:54:08,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:08,642 INFO L89 Accepts]: Start accepts. Operand has 403 places, 1045 transitions, 34634 flow [2022-12-06 03:54:08,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:08,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:08,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 1045 transitions, 34634 flow [2022-12-06 03:54:08,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 403 places, 1045 transitions, 34634 flow [2022-12-06 03:54:09,300 INFO L130 PetriNetUnfolder]: 852/2206 cut-off events. [2022-12-06 03:54:09,300 INFO L131 PetriNetUnfolder]: For 253468/254171 co-relation queries the response was YES. [2022-12-06 03:54:09,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35983 conditions, 2206 events. 852/2206 cut-off events. For 253468/254171 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 20164 event pairs, 4 based on Foata normal form. 41/2243 useless extension candidates. Maximal degree in co-relation 35830. Up to 1086 conditions per place. [2022-12-06 03:54:09,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 1045 transitions, 34634 flow [2022-12-06 03:54:09,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 3176 [2022-12-06 03:54:09,387 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:09,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 747 [2022-12-06 03:54:09,389 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 1045 transitions, 34634 flow [2022-12-06 03:54:09,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:09,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:09,389 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:09,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-06 03:54:09,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 03:54:09,594 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:09,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash -519449927, now seen corresponding path program 1 times [2022-12-06 03:54:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:09,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987856729] [2022-12-06 03:54:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:09,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:09,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987856729] [2022-12-06 03:54:09,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987856729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:09,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447853462] [2022-12-06 03:54:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:09,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:09,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:09,727 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:09,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 03:54:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:09,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:54:09,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:09,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:10,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447853462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:10,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:10,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:54:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443914853] [2022-12-06 03:54:10,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:10,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:54:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:10,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:54:10,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:54:10,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 03:54:10,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1045 transitions, 34634 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:10,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:10,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 03:54:10,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:19,380 INFO L130 PetriNetUnfolder]: 4309/7424 cut-off events. [2022-12-06 03:54:19,380 INFO L131 PetriNetUnfolder]: For 840566/840566 co-relation queries the response was YES. [2022-12-06 03:54:19,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101543 conditions, 7424 events. 4309/7424 cut-off events. For 840566/840566 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 55005 event pairs, 633 based on Foata normal form. 38/7454 useless extension candidates. Maximal degree in co-relation 101387. Up to 5572 conditions per place. [2022-12-06 03:54:19,643 INFO L137 encePairwiseOnDemand]: 9/44 looper letters, 784 selfloop transitions, 444 changer transitions 7/1235 dead transitions. [2022-12-06 03:54:19,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 1235 transitions, 41043 flow [2022-12-06 03:54:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 03:54:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 03:54:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 182 transitions. [2022-12-06 03:54:19,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13343108504398826 [2022-12-06 03:54:19,644 INFO L175 Difference]: Start difference. First operand has 403 places, 1045 transitions, 34634 flow. Second operand 31 states and 182 transitions. [2022-12-06 03:54:19,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 1235 transitions, 41043 flow [2022-12-06 03:54:24,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1235 transitions, 39598 flow, removed 646 selfloop flow, removed 9 redundant places. [2022-12-06 03:54:24,809 INFO L231 Difference]: Finished difference. Result has 430 places, 1111 transitions, 37358 flow [2022-12-06 03:54:24,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=33261, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=37358, PETRI_PLACES=430, PETRI_TRANSITIONS=1111} [2022-12-06 03:54:24,810 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 412 predicate places. [2022-12-06 03:54:24,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:24,810 INFO L89 Accepts]: Start accepts. Operand has 430 places, 1111 transitions, 37358 flow [2022-12-06 03:54:24,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:24,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:24,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 1111 transitions, 37358 flow [2022-12-06 03:54:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 1111 transitions, 37358 flow [2022-12-06 03:54:25,463 INFO L130 PetriNetUnfolder]: 888/2325 cut-off events. [2022-12-06 03:54:25,463 INFO L131 PetriNetUnfolder]: For 285923/286644 co-relation queries the response was YES. [2022-12-06 03:54:25,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37995 conditions, 2325 events. 888/2325 cut-off events. For 285923/286644 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 21547 event pairs, 4 based on Foata normal form. 42/2363 useless extension candidates. Maximal degree in co-relation 37837. Up to 1120 conditions per place. [2022-12-06 03:54:25,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 1111 transitions, 37358 flow [2022-12-06 03:54:25,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 3324 [2022-12-06 03:54:25,753 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:54:25,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 943 [2022-12-06 03:54:25,754 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1111 transitions, 37446 flow [2022-12-06 03:54:25,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:25,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:25,754 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:25,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 03:54:25,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 03:54:25,958 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash 992373728, now seen corresponding path program 1 times [2022-12-06 03:54:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:25,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107211967] [2022-12-06 03:54:25,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:26,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:26,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107211967] [2022-12-06 03:54:26,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107211967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:26,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389032742] [2022-12-06 03:54:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:26,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:26,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:26,087 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:26,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 03:54:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:26,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:54:26,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:26,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:26,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389032742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:26,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:26,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:54:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100976126] [2022-12-06 03:54:26,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:26,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:54:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:54:26,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:54:26,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 03:54:26,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1111 transitions, 37446 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:26,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:26,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 03:54:26,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:32,546 INFO L130 PetriNetUnfolder]: 4606/7959 cut-off events. [2022-12-06 03:54:32,546 INFO L131 PetriNetUnfolder]: For 1074860/1074860 co-relation queries the response was YES. [2022-12-06 03:54:32,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108732 conditions, 7959 events. 4606/7959 cut-off events. For 1074860/1074860 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 59888 event pairs, 435 based on Foata normal form. 66/8017 useless extension candidates. Maximal degree in co-relation 108571. Up to 4630 conditions per place. [2022-12-06 03:54:32,640 INFO L137 encePairwiseOnDemand]: 8/49 looper letters, 706 selfloop transitions, 658 changer transitions 1/1365 dead transitions. [2022-12-06 03:54:32,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1365 transitions, 45234 flow [2022-12-06 03:54:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 03:54:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 03:54:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 214 transitions. [2022-12-06 03:54:32,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14088215931533904 [2022-12-06 03:54:32,642 INFO L175 Difference]: Start difference. First operand has 430 places, 1111 transitions, 37446 flow. Second operand 31 states and 214 transitions. [2022-12-06 03:54:32,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1365 transitions, 45234 flow [2022-12-06 03:54:38,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 1365 transitions, 43810 flow, removed 648 selfloop flow, removed 13 redundant places. [2022-12-06 03:54:38,720 INFO L231 Difference]: Finished difference. Result has 458 places, 1193 transitions, 41359 flow [2022-12-06 03:54:38,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=36114, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=590, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=41359, PETRI_PLACES=458, PETRI_TRANSITIONS=1193} [2022-12-06 03:54:38,721 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 440 predicate places. [2022-12-06 03:54:38,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:38,721 INFO L89 Accepts]: Start accepts. Operand has 458 places, 1193 transitions, 41359 flow [2022-12-06 03:54:38,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:38,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:38,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 1193 transitions, 41359 flow [2022-12-06 03:54:38,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 1193 transitions, 41359 flow [2022-12-06 03:54:39,471 INFO L130 PetriNetUnfolder]: 945/2479 cut-off events. [2022-12-06 03:54:39,471 INFO L131 PetriNetUnfolder]: For 335887/336633 co-relation queries the response was YES. [2022-12-06 03:54:39,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41712 conditions, 2479 events. 945/2479 cut-off events. For 335887/336633 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 23204 event pairs, 4 based on Foata normal form. 46/2521 useless extension candidates. Maximal degree in co-relation 41542. Up to 1128 conditions per place. [2022-12-06 03:54:39,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 458 places, 1193 transitions, 41359 flow [2022-12-06 03:54:39,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 3544 [2022-12-06 03:54:39,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:54:39,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:54:39,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [396] L705-6-->L687-5: Formula: (and (< v_~p~0_218 5) (= (* 2 v_~next~0_149) (+ (* 21 v_~prev~0_291) (* 3 v_~prev~0_290) (* 34 v_~cur~0_241))) (= v_~p~0_217 (+ v_~p~0_218 1)) (= (* 5 v_~prev~0_290) (+ (* 21 v_~cur~0_241) (* 3 v_~next~0_149) (* v_~prev~0_291 13))) (= v_~next~0_149 v_~cur~0_240) (= v_~x~0_276 (+ 12 v_~x~0_277)) (< v_~x~0_277 1) (= (+ v_~j~0_403 v_~i~0_340) v_~i~0_339)) InVars {~j~0=v_~j~0_403, ~prev~0=v_~prev~0_291, ~i~0=v_~i~0_340, ~p~0=v_~p~0_218, ~cur~0=v_~cur~0_241, ~x~0=v_~x~0_277} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_175|, ~j~0=v_~j~0_403, ~next~0=v_~next~0_149, ~prev~0=v_~prev~0_290, ~i~0=v_~i~0_339, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_153|, ~p~0=v_~p~0_217, ~cur~0=v_~cur~0_240, ~x~0=v_~x~0_276} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:54:39,824 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:54:39,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1103 [2022-12-06 03:54:39,824 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 1192 transitions, 41392 flow [2022-12-06 03:54:39,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:39,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:39,825 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:39,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-06 03:54:40,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:40,029 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash -516696662, now seen corresponding path program 1 times [2022-12-06 03:54:40,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:40,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677540741] [2022-12-06 03:54:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677540741] [2022-12-06 03:54:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677540741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201488008] [2022-12-06 03:54:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:40,069 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:40,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 03:54:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:40,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:54:40,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:40,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:54:40,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201488008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:40,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:54:40,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 03:54:40,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074093219] [2022-12-06 03:54:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:40,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:54:40,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:40,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:54:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:54:40,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 03:54:40,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1192 transitions, 41392 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:54:40,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:40,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 03:54:40,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:43,594 INFO L130 PetriNetUnfolder]: 4592/7933 cut-off events. [2022-12-06 03:54:43,594 INFO L131 PetriNetUnfolder]: For 1001168/1001168 co-relation queries the response was YES. [2022-12-06 03:54:43,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111535 conditions, 7933 events. 4592/7933 cut-off events. For 1001168/1001168 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 60667 event pairs, 739 based on Foata normal form. 14/7939 useless extension candidates. Maximal degree in co-relation 111362. Up to 4199 conditions per place. [2022-12-06 03:54:43,696 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 1751 selfloop transitions, 6 changer transitions 71/1828 dead transitions. [2022-12-06 03:54:43,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1828 transitions, 67465 flow [2022-12-06 03:54:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:54:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:54:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 03:54:43,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3284313725490196 [2022-12-06 03:54:43,697 INFO L175 Difference]: Start difference. First operand has 457 places, 1192 transitions, 41392 flow. Second operand 4 states and 67 transitions. [2022-12-06 03:54:43,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1828 transitions, 67465 flow [2022-12-06 03:54:49,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 1828 transitions, 65763 flow, removed 747 selfloop flow, removed 10 redundant places. [2022-12-06 03:54:49,292 INFO L231 Difference]: Finished difference. Result has 452 places, 1181 transitions, 39904 flow [2022-12-06 03:54:49,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=39891, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=39904, PETRI_PLACES=452, PETRI_TRANSITIONS=1181} [2022-12-06 03:54:49,293 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 434 predicate places. [2022-12-06 03:54:49,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:49,294 INFO L89 Accepts]: Start accepts. Operand has 452 places, 1181 transitions, 39904 flow [2022-12-06 03:54:49,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:49,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:49,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 452 places, 1181 transitions, 39904 flow [2022-12-06 03:54:49,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 451 places, 1181 transitions, 39904 flow [2022-12-06 03:54:50,027 INFO L130 PetriNetUnfolder]: 936/2468 cut-off events. [2022-12-06 03:54:50,027 INFO L131 PetriNetUnfolder]: For 340172/340798 co-relation queries the response was YES. [2022-12-06 03:54:50,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41627 conditions, 2468 events. 936/2468 cut-off events. For 340172/340798 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 23219 event pairs, 5 based on Foata normal form. 47/2511 useless extension candidates. Maximal degree in co-relation 41454. Up to 1121 conditions per place. [2022-12-06 03:54:50,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 451 places, 1181 transitions, 39904 flow [2022-12-06 03:54:50,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 3526 [2022-12-06 03:54:50,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:54:50,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:54:50,303 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:54:50,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1010 [2022-12-06 03:54:50,304 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 1181 transitions, 39958 flow [2022-12-06 03:54:50,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:54:50,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:50,304 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:50,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-06 03:54:50,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 03:54:50,505 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 888933642, now seen corresponding path program 1 times [2022-12-06 03:54:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:50,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886717373] [2022-12-06 03:54:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:50,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886717373] [2022-12-06 03:54:50,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886717373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:50,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603242980] [2022-12-06 03:54:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:50,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:50,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:50,683 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:50,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 03:54:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:50,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:54:50,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:50,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:51,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603242980] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:51,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:51,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:54:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179526405] [2022-12-06 03:54:51,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:51,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:54:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:51,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:54:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:54:51,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 03:54:51,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 1181 transitions, 39958 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:51,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:51,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 03:54:51,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:00,331 INFO L130 PetriNetUnfolder]: 4670/8113 cut-off events. [2022-12-06 03:55:00,331 INFO L131 PetriNetUnfolder]: For 1187598/1187598 co-relation queries the response was YES. [2022-12-06 03:55:00,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115184 conditions, 8113 events. 4670/8113 cut-off events. For 1187598/1187598 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 61852 event pairs, 747 based on Foata normal form. 62/8167 useless extension candidates. Maximal degree in co-relation 115008. Up to 6578 conditions per place. [2022-12-06 03:55:00,435 INFO L137 encePairwiseOnDemand]: 9/54 looper letters, 962 selfloop transitions, 373 changer transitions 12/1347 dead transitions. [2022-12-06 03:55:00,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1347 transitions, 45608 flow [2022-12-06 03:55:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:55:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:55:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-12-06 03:55:00,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12321937321937322 [2022-12-06 03:55:00,436 INFO L175 Difference]: Start difference. First operand has 451 places, 1181 transitions, 39958 flow. Second operand 26 states and 173 transitions. [2022-12-06 03:55:00,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1347 transitions, 45608 flow [2022-12-06 03:55:07,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 1347 transitions, 45555 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 03:55:08,014 INFO L231 Difference]: Finished difference. Result has 477 places, 1225 transitions, 42581 flow [2022-12-06 03:55:08,015 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=39909, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=42581, PETRI_PLACES=477, PETRI_TRANSITIONS=1225} [2022-12-06 03:55:08,015 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 459 predicate places. [2022-12-06 03:55:08,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:08,015 INFO L89 Accepts]: Start accepts. Operand has 477 places, 1225 transitions, 42581 flow [2022-12-06 03:55:08,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:08,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:08,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 477 places, 1225 transitions, 42581 flow [2022-12-06 03:55:08,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 1225 transitions, 42581 flow [2022-12-06 03:55:08,863 INFO L130 PetriNetUnfolder]: 956/2553 cut-off events. [2022-12-06 03:55:08,863 INFO L131 PetriNetUnfolder]: For 345514/346189 co-relation queries the response was YES. [2022-12-06 03:55:08,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43450 conditions, 2553 events. 956/2553 cut-off events. For 345514/346189 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 24332 event pairs, 4 based on Foata normal form. 52/2601 useless extension candidates. Maximal degree in co-relation 43272. Up to 1158 conditions per place. [2022-12-06 03:55:09,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 476 places, 1225 transitions, 42581 flow [2022-12-06 03:55:09,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 3632 [2022-12-06 03:55:09,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:55:09,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1086 [2022-12-06 03:55:09,101 INFO L495 AbstractCegarLoop]: Abstraction has has 476 places, 1225 transitions, 42657 flow [2022-12-06 03:55:09,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:09,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:09,101 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:09,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 03:55:09,305 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash 978025037, now seen corresponding path program 1 times [2022-12-06 03:55:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:09,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065695073] [2022-12-06 03:55:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:09,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065695073] [2022-12-06 03:55:09,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065695073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:09,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519115999] [2022-12-06 03:55:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:09,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:09,424 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:09,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 03:55:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:09,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:55:09,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:09,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:09,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519115999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:09,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:09,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:55:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775448367] [2022-12-06 03:55:09,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:09,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:55:09,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:55:09,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:55:09,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 03:55:09,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 1225 transitions, 42657 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:09,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:09,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 03:55:09,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:13,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:15,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:20,611 INFO L130 PetriNetUnfolder]: 4754/8287 cut-off events. [2022-12-06 03:55:20,611 INFO L131 PetriNetUnfolder]: For 1100370/1100370 co-relation queries the response was YES. [2022-12-06 03:55:20,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119917 conditions, 8287 events. 4754/8287 cut-off events. For 1100370/1100370 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 63667 event pairs, 741 based on Foata normal form. 20/8299 useless extension candidates. Maximal degree in co-relation 119736. Up to 6115 conditions per place. [2022-12-06 03:55:20,730 INFO L137 encePairwiseOnDemand]: 9/55 looper letters, 902 selfloop transitions, 512 changer transitions 6/1420 dead transitions. [2022-12-06 03:55:20,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1420 transitions, 49020 flow [2022-12-06 03:55:20,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 03:55:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 03:55:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 199 transitions. [2022-12-06 03:55:20,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1206060606060606 [2022-12-06 03:55:20,731 INFO L175 Difference]: Start difference. First operand has 476 places, 1225 transitions, 42657 flow. Second operand 30 states and 199 transitions. [2022-12-06 03:55:20,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 1420 transitions, 49020 flow [2022-12-06 03:55:29,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 1420 transitions, 48546 flow, removed 174 selfloop flow, removed 12 redundant places. [2022-12-06 03:55:29,191 INFO L231 Difference]: Finished difference. Result has 498 places, 1264 transitions, 45278 flow [2022-12-06 03:55:29,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=42185, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=477, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=45278, PETRI_PLACES=498, PETRI_TRANSITIONS=1264} [2022-12-06 03:55:29,192 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 480 predicate places. [2022-12-06 03:55:29,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:29,192 INFO L89 Accepts]: Start accepts. Operand has 498 places, 1264 transitions, 45278 flow [2022-12-06 03:55:29,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:29,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:29,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 498 places, 1264 transitions, 45278 flow [2022-12-06 03:55:29,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 498 places, 1264 transitions, 45278 flow [2022-12-06 03:55:30,039 INFO L130 PetriNetUnfolder]: 976/2625 cut-off events. [2022-12-06 03:55:30,040 INFO L131 PetriNetUnfolder]: For 366794/367574 co-relation queries the response was YES. [2022-12-06 03:55:30,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45489 conditions, 2625 events. 976/2625 cut-off events. For 366794/367574 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 25266 event pairs, 4 based on Foata normal form. 53/2674 useless extension candidates. Maximal degree in co-relation 45306. Up to 1204 conditions per place. [2022-12-06 03:55:30,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 498 places, 1264 transitions, 45278 flow [2022-12-06 03:55:30,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 3716 [2022-12-06 03:55:30,275 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:55:30,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1084 [2022-12-06 03:55:30,276 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 1262 transitions, 45242 flow [2022-12-06 03:55:30,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:30,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:30,276 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:30,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:30,481 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 994737788, now seen corresponding path program 1 times [2022-12-06 03:55:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:30,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705280539] [2022-12-06 03:55:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:30,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:30,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705280539] [2022-12-06 03:55:30,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705280539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:30,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281770502] [2022-12-06 03:55:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:30,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:30,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:30,574 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 03:55:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:30,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:55:30,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:30,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:31,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281770502] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:31,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:31,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:55:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85405047] [2022-12-06 03:55:31,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:31,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:55:31,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:31,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:55:31,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:55:31,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 03:55:31,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 1262 transitions, 45242 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:31,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:31,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 03:55:31,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:43,222 INFO L130 PetriNetUnfolder]: 5050/8853 cut-off events. [2022-12-06 03:55:43,222 INFO L131 PetriNetUnfolder]: For 1312844/1312844 co-relation queries the response was YES. [2022-12-06 03:55:43,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130114 conditions, 8853 events. 5050/8853 cut-off events. For 1312844/1312844 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 69179 event pairs, 556 based on Foata normal form. 48/8893 useless extension candidates. Maximal degree in co-relation 129928. Up to 5725 conditions per place. [2022-12-06 03:55:43,345 INFO L137 encePairwiseOnDemand]: 8/55 looper letters, 811 selfloop transitions, 715 changer transitions 4/1530 dead transitions. [2022-12-06 03:55:43,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 1530 transitions, 54425 flow [2022-12-06 03:55:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:55:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:55:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 209 transitions. [2022-12-06 03:55:43,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11875 [2022-12-06 03:55:43,346 INFO L175 Difference]: Start difference. First operand has 496 places, 1262 transitions, 45242 flow. Second operand 32 states and 209 transitions. [2022-12-06 03:55:43,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 1530 transitions, 54425 flow [2022-12-06 03:55:53,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 1530 transitions, 53731 flow, removed 284 selfloop flow, removed 11 redundant places. [2022-12-06 03:55:53,375 INFO L231 Difference]: Finished difference. Result has 523 places, 1372 transitions, 51172 flow [2022-12-06 03:55:53,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=44566, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=51172, PETRI_PLACES=523, PETRI_TRANSITIONS=1372} [2022-12-06 03:55:53,376 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 505 predicate places. [2022-12-06 03:55:53,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:53,377 INFO L89 Accepts]: Start accepts. Operand has 523 places, 1372 transitions, 51172 flow [2022-12-06 03:55:53,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:53,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:53,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 523 places, 1372 transitions, 51172 flow [2022-12-06 03:55:53,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 523 places, 1372 transitions, 51172 flow [2022-12-06 03:55:54,520 INFO L130 PetriNetUnfolder]: 1051/2853 cut-off events. [2022-12-06 03:55:54,520 INFO L131 PetriNetUnfolder]: For 405636/406327 co-relation queries the response was YES. [2022-12-06 03:55:54,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50592 conditions, 2853 events. 1051/2853 cut-off events. For 405636/406327 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 27929 event pairs, 4 based on Foata normal form. 43/2892 useless extension candidates. Maximal degree in co-relation 50402. Up to 1351 conditions per place. [2022-12-06 03:55:54,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 523 places, 1372 transitions, 51172 flow [2022-12-06 03:55:54,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 3974 [2022-12-06 03:55:54,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:55:54,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1296 [2022-12-06 03:55:54,672 INFO L495 AbstractCegarLoop]: Abstraction has has 523 places, 1372 transitions, 51197 flow [2022-12-06 03:55:54,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:54,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:54,672 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:54,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:54,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-06 03:55:54,881 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:54,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash 343101389, now seen corresponding path program 1 times [2022-12-06 03:55:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:54,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507403529] [2022-12-06 03:55:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:54,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507403529] [2022-12-06 03:55:54,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507403529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:54,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186994094] [2022-12-06 03:55:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:54,986 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:54,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 03:55:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:55,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:55:55,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:55,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:55,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186994094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:55,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:55,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:55:55,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861263681] [2022-12-06 03:55:55,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:55,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:55:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:55:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:55:55,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:55:55,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 1372 transitions, 51197 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:55,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:55,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:55:55,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:01,658 INFO L130 PetriNetUnfolder]: 5255/9256 cut-off events. [2022-12-06 03:56:01,658 INFO L131 PetriNetUnfolder]: For 1548693/1548693 co-relation queries the response was YES. [2022-12-06 03:56:01,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138919 conditions, 9256 events. 5255/9256 cut-off events. For 1548693/1548693 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 73253 event pairs, 1053 based on Foata normal form. 76/9324 useless extension candidates. Maximal degree in co-relation 138726. Up to 7442 conditions per place. [2022-12-06 03:56:01,788 INFO L137 encePairwiseOnDemand]: 16/56 looper letters, 1110 selfloop transitions, 455 changer transitions 8/1573 dead transitions. [2022-12-06 03:56:01,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 1573 transitions, 59343 flow [2022-12-06 03:56:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 03:56:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 03:56:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 173 transitions. [2022-12-06 03:56:01,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11033163265306123 [2022-12-06 03:56:01,789 INFO L175 Difference]: Start difference. First operand has 523 places, 1372 transitions, 51197 flow. Second operand 28 states and 173 transitions. [2022-12-06 03:56:01,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 1573 transitions, 59343 flow [2022-12-06 03:56:13,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 1573 transitions, 57818 flow, removed 599 selfloop flow, removed 16 redundant places. [2022-12-06 03:56:14,033 INFO L231 Difference]: Finished difference. Result has 540 places, 1461 transitions, 54937 flow [2022-12-06 03:56:14,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=49774, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=54937, PETRI_PLACES=540, PETRI_TRANSITIONS=1461} [2022-12-06 03:56:14,035 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 522 predicate places. [2022-12-06 03:56:14,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:56:14,035 INFO L89 Accepts]: Start accepts. Operand has 540 places, 1461 transitions, 54937 flow [2022-12-06 03:56:14,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:56:14,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:56:14,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 540 places, 1461 transitions, 54937 flow [2022-12-06 03:56:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 540 places, 1461 transitions, 54937 flow [2022-12-06 03:56:15,229 INFO L130 PetriNetUnfolder]: 1109/3015 cut-off events. [2022-12-06 03:56:15,230 INFO L131 PetriNetUnfolder]: For 431959/432714 co-relation queries the response was YES. [2022-12-06 03:56:15,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53546 conditions, 3015 events. 1109/3015 cut-off events. For 431959/432714 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 29886 event pairs, 6 based on Foata normal form. 42/3053 useless extension candidates. Maximal degree in co-relation 53351. Up to 1369 conditions per place. [2022-12-06 03:56:15,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 540 places, 1461 transitions, 54937 flow [2022-12-06 03:56:15,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 4182 [2022-12-06 03:56:15,450 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:56:15,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1416 [2022-12-06 03:56:15,451 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 1461 transitions, 55101 flow [2022-12-06 03:56:15,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:15,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:56:15,451 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:56:15,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 03:56:15,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:15,656 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:56:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:56:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash 336445503, now seen corresponding path program 1 times [2022-12-06 03:56:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:56:15,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333825773] [2022-12-06 03:56:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:56:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:56:15,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333825773] [2022-12-06 03:56:15,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333825773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:56:15,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596446147] [2022-12-06 03:56:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:15,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:15,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:56:15,743 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:56:15,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 03:56:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:15,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:56:15,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:56:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:15,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:56:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:16,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596446147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:56:16,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:56:16,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:56:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168862202] [2022-12-06 03:56:16,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:56:16,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:56:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:56:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:56:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:56:16,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 03:56:16,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 1461 transitions, 55101 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:16,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:56:16,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 03:56:16,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:32,030 INFO L130 PetriNetUnfolder]: 5373/9514 cut-off events. [2022-12-06 03:56:32,030 INFO L131 PetriNetUnfolder]: For 1635541/1635541 co-relation queries the response was YES. [2022-12-06 03:56:32,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143879 conditions, 9514 events. 5373/9514 cut-off events. For 1635541/1635541 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 76265 event pairs, 820 based on Foata normal form. 66/9572 useless extension candidates. Maximal degree in co-relation 143681. Up to 7191 conditions per place. [2022-12-06 03:56:32,172 INFO L137 encePairwiseOnDemand]: 9/60 looper letters, 1104 selfloop transitions, 574 changer transitions 14/1692 dead transitions. [2022-12-06 03:56:32,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 1692 transitions, 63030 flow [2022-12-06 03:56:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 03:56:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 03:56:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 222 transitions. [2022-12-06 03:56:32,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10277777777777777 [2022-12-06 03:56:32,174 INFO L175 Difference]: Start difference. First operand has 540 places, 1461 transitions, 55101 flow. Second operand 36 states and 222 transitions. [2022-12-06 03:56:32,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 1692 transitions, 63030 flow [2022-12-06 03:56:43,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 1692 transitions, 61282 flow, removed 764 selfloop flow, removed 12 redundant places. [2022-12-06 03:56:43,882 INFO L231 Difference]: Finished difference. Result has 570 places, 1514 transitions, 57554 flow [2022-12-06 03:56:43,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=53575, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=528, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=57554, PETRI_PLACES=570, PETRI_TRANSITIONS=1514} [2022-12-06 03:56:43,883 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 552 predicate places. [2022-12-06 03:56:43,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:56:43,883 INFO L89 Accepts]: Start accepts. Operand has 570 places, 1514 transitions, 57554 flow [2022-12-06 03:56:43,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:56:43,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:56:43,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 570 places, 1514 transitions, 57554 flow [2022-12-06 03:56:43,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 570 places, 1514 transitions, 57554 flow [2022-12-06 03:56:45,167 INFO L130 PetriNetUnfolder]: 1130/3115 cut-off events. [2022-12-06 03:56:45,168 INFO L131 PetriNetUnfolder]: For 466590/467408 co-relation queries the response was YES. [2022-12-06 03:56:45,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55891 conditions, 3115 events. 1130/3115 cut-off events. For 466590/467408 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 31330 event pairs, 7 based on Foata normal form. 42/3153 useless extension candidates. Maximal degree in co-relation 55690. Up to 1386 conditions per place. [2022-12-06 03:56:45,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 570 places, 1514 transitions, 57554 flow [2022-12-06 03:56:45,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 4300 [2022-12-06 03:56:45,332 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:56:45,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1449 [2022-12-06 03:56:45,332 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 1513 transitions, 57529 flow [2022-12-06 03:56:45,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:45,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:56:45,333 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:56:45,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-06 03:56:45,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:45,537 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:56:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:56:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 196172177, now seen corresponding path program 1 times [2022-12-06 03:56:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:56:45,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668122414] [2022-12-06 03:56:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:56:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:56:45,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668122414] [2022-12-06 03:56:45,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668122414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:56:45,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222059860] [2022-12-06 03:56:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:45,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:56:45,565 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:56:45,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 03:56:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:45,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:56:45,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:56:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:45,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:56:45,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222059860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:56:45,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:56:45,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-06 03:56:45,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197272127] [2022-12-06 03:56:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:56:45,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:56:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:56:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:56:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:56:45,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 03:56:45,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 1513 transitions, 57529 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:56:45,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:56:45,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 03:56:45,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:51,400 INFO L130 PetriNetUnfolder]: 5990/10388 cut-off events. [2022-12-06 03:56:51,401 INFO L131 PetriNetUnfolder]: For 1491336/1491336 co-relation queries the response was YES. [2022-12-06 03:56:51,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159933 conditions, 10388 events. 5990/10388 cut-off events. For 1491336/1491336 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 82702 event pairs, 1282 based on Foata normal form. 6/10386 useless extension candidates. Maximal degree in co-relation 159729. Up to 7502 conditions per place. [2022-12-06 03:56:51,546 INFO L137 encePairwiseOnDemand]: 40/62 looper letters, 1979 selfloop transitions, 19 changer transitions 77/2075 dead transitions. [2022-12-06 03:56:51,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 2075 transitions, 82483 flow [2022-12-06 03:56:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:56:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:56:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 03:56:51,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2903225806451613 [2022-12-06 03:56:51,548 INFO L175 Difference]: Start difference. First operand has 569 places, 1513 transitions, 57529 flow. Second operand 4 states and 72 transitions. [2022-12-06 03:56:51,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 2075 transitions, 82483 flow [2022-12-06 03:57:04,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 2075 transitions, 81613 flow, removed 378 selfloop flow, removed 10 redundant places. [2022-12-06 03:57:04,941 INFO L231 Difference]: Finished difference. Result has 561 places, 1503 transitions, 56352 flow [2022-12-06 03:57:04,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=56276, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56352, PETRI_PLACES=561, PETRI_TRANSITIONS=1503} [2022-12-06 03:57:04,943 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 543 predicate places. [2022-12-06 03:57:04,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:04,943 INFO L89 Accepts]: Start accepts. Operand has 561 places, 1503 transitions, 56352 flow [2022-12-06 03:57:04,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:04,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:04,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 561 places, 1503 transitions, 56352 flow [2022-12-06 03:57:04,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 561 places, 1503 transitions, 56352 flow [2022-12-06 03:57:06,715 INFO L130 PetriNetUnfolder]: 1320/3486 cut-off events. [2022-12-06 03:57:06,715 INFO L131 PetriNetUnfolder]: For 557733/558564 co-relation queries the response was YES. [2022-12-06 03:57:06,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63644 conditions, 3486 events. 1320/3486 cut-off events. For 557733/558564 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 34804 event pairs, 7 based on Foata normal form. 42/3525 useless extension candidates. Maximal degree in co-relation 63441. Up to 1592 conditions per place. [2022-12-06 03:57:06,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 561 places, 1503 transitions, 56352 flow [2022-12-06 03:57:06,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 4538 [2022-12-06 03:57:06,815 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:57:06,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1873 [2022-12-06 03:57:06,816 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 1503 transitions, 56352 flow [2022-12-06 03:57:06,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:57:06,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:06,816 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:06,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 03:57:07,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-06 03:57:07,020 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:57:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1845794786, now seen corresponding path program 1 times [2022-12-06 03:57:07,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:07,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335968957] [2022-12-06 03:57:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:07,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:07,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335968957] [2022-12-06 03:57:07,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335968957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:57:07,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:57:07,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:57:07,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95830652] [2022-12-06 03:57:07,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:57:07,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:57:07,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:07,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:57:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:57:07,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 03:57:07,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1503 transitions, 56352 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:57:07,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:07,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 03:57:07,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:57:12,837 INFO L130 PetriNetUnfolder]: 6012/10426 cut-off events. [2022-12-06 03:57:12,838 INFO L131 PetriNetUnfolder]: For 1554065/1554065 co-relation queries the response was YES. [2022-12-06 03:57:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162998 conditions, 10426 events. 6012/10426 cut-off events. For 1554065/1554065 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 84034 event pairs, 589 based on Foata normal form. 18/10442 useless extension candidates. Maximal degree in co-relation 162792. Up to 5156 conditions per place. [2022-12-06 03:57:12,985 INFO L137 encePairwiseOnDemand]: 35/59 looper letters, 2086 selfloop transitions, 85 changer transitions 115/2286 dead transitions. [2022-12-06 03:57:12,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 2286 transitions, 89998 flow [2022-12-06 03:57:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:57:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:57:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 03:57:12,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3050847457627119 [2022-12-06 03:57:12,986 INFO L175 Difference]: Start difference. First operand has 561 places, 1503 transitions, 56352 flow. Second operand 5 states and 90 transitions. [2022-12-06 03:57:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 2286 transitions, 89998 flow [2022-12-06 03:57:25,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 2286 transitions, 89997 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:57:25,335 INFO L231 Difference]: Finished difference. Result has 566 places, 1503 transitions, 56591 flow [2022-12-06 03:57:25,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=56081, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56591, PETRI_PLACES=566, PETRI_TRANSITIONS=1503} [2022-12-06 03:57:25,337 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 548 predicate places. [2022-12-06 03:57:25,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:25,337 INFO L89 Accepts]: Start accepts. Operand has 566 places, 1503 transitions, 56591 flow [2022-12-06 03:57:25,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:25,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:25,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 566 places, 1503 transitions, 56591 flow [2022-12-06 03:57:25,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 1503 transitions, 56591 flow [2022-12-06 03:57:26,626 INFO L130 PetriNetUnfolder]: 1321/3503 cut-off events. [2022-12-06 03:57:26,626 INFO L131 PetriNetUnfolder]: For 579312/580164 co-relation queries the response was YES. [2022-12-06 03:57:26,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64820 conditions, 3503 events. 1321/3503 cut-off events. For 579312/580164 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 35087 event pairs, 7 based on Foata normal form. 55/3555 useless extension candidates. Maximal degree in co-relation 64614. Up to 1600 conditions per place. [2022-12-06 03:57:26,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 566 places, 1503 transitions, 56591 flow [2022-12-06 03:57:26,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 4560 [2022-12-06 03:57:26,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:57:26,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1397 [2022-12-06 03:57:26,734 INFO L495 AbstractCegarLoop]: Abstraction has has 566 places, 1503 transitions, 56591 flow [2022-12-06 03:57:26,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:57:26,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:26,735 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:26,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 03:57:26,735 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:57:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1845795344, now seen corresponding path program 2 times [2022-12-06 03:57:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:26,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998758277] [2022-12-06 03:57:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:26,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998758277] [2022-12-06 03:57:26,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998758277] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:57:26,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222695042] [2022-12-06 03:57:26,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:57:26,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:26,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:57:26,856 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:57:26,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 03:57:26,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:57:26,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:57:26,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:57:26,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:57:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:27,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:57:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:27,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222695042] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:57:27,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:57:27,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:57:27,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868870577] [2022-12-06 03:57:27,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:57:27,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:57:27,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:27,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:57:27,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:57:27,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 03:57:27,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 1503 transitions, 56591 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:57:27,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:27,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 03:57:27,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:57:40,114 INFO L130 PetriNetUnfolder]: 6110/10654 cut-off events. [2022-12-06 03:57:40,115 INFO L131 PetriNetUnfolder]: For 1647710/1647710 co-relation queries the response was YES. [2022-12-06 03:57:40,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169504 conditions, 10654 events. 6110/10654 cut-off events. For 1647710/1647710 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 85128 event pairs, 1143 based on Foata normal form. 16/10668 useless extension candidates. Maximal degree in co-relation 169295. Up to 8700 conditions per place. [2022-12-06 03:57:40,271 INFO L137 encePairwiseOnDemand]: 13/59 looper letters, 1190 selfloop transitions, 509 changer transitions 21/1720 dead transitions. [2022-12-06 03:57:40,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 1720 transitions, 64824 flow [2022-12-06 03:57:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 03:57:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 03:57:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 209 transitions. [2022-12-06 03:57:40,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09839924670433145 [2022-12-06 03:57:40,272 INFO L175 Difference]: Start difference. First operand has 566 places, 1503 transitions, 56591 flow. Second operand 36 states and 209 transitions. [2022-12-06 03:57:40,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 1720 transitions, 64824 flow [2022-12-06 03:57:54,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 1720 transitions, 64673 flow, removed 55 selfloop flow, removed 1 redundant places. [2022-12-06 03:57:54,741 INFO L231 Difference]: Finished difference. Result has 605 places, 1560 transitions, 60483 flow [2022-12-06 03:57:54,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=56496, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=459, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=60483, PETRI_PLACES=605, PETRI_TRANSITIONS=1560} [2022-12-06 03:57:54,742 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 587 predicate places. [2022-12-06 03:57:54,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:54,742 INFO L89 Accepts]: Start accepts. Operand has 605 places, 1560 transitions, 60483 flow [2022-12-06 03:57:54,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:54,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:54,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 605 places, 1560 transitions, 60483 flow [2022-12-06 03:57:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 605 places, 1560 transitions, 60483 flow [2022-12-06 03:57:56,329 INFO L130 PetriNetUnfolder]: 1362/3601 cut-off events. [2022-12-06 03:57:56,330 INFO L131 PetriNetUnfolder]: For 620553/621431 co-relation queries the response was YES. [2022-12-06 03:57:56,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68081 conditions, 3601 events. 1362/3601 cut-off events. For 620553/621431 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 36169 event pairs, 7 based on Foata normal form. 57/3655 useless extension candidates. Maximal degree in co-relation 67869. Up to 1670 conditions per place. [2022-12-06 03:57:56,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 605 places, 1560 transitions, 60483 flow [2022-12-06 03:57:56,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 4654 [2022-12-06 03:57:56,563 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:57:56,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1821 [2022-12-06 03:57:56,563 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 1559 transitions, 60514 flow [2022-12-06 03:57:56,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:57:56,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:56,563 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:56,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-06 03:57:56,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-06 03:57:56,764 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:57:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1699810521, now seen corresponding path program 1 times [2022-12-06 03:57:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:56,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017035930] [2022-12-06 03:57:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:56,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:56,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017035930] [2022-12-06 03:57:56,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017035930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:57:56,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444259497] [2022-12-06 03:57:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:56,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:57:56,816 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:57:56,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 03:57:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:56,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:57:56,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:57:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:56,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:57:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444259497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:57:56,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:57:56,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-12-06 03:57:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887101097] [2022-12-06 03:57:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:57:56,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:57:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:57:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:57:56,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 03:57:56,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 1559 transitions, 60514 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:57:56,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:56,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 03:57:56,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:58:04,128 INFO L130 PetriNetUnfolder]: 6093/10677 cut-off events. [2022-12-06 03:58:04,128 INFO L131 PetriNetUnfolder]: For 1770049/1770049 co-relation queries the response was YES. [2022-12-06 03:58:04,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172882 conditions, 10677 events. 6093/10677 cut-off events. For 1770049/1770049 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 86873 event pairs, 851 based on Foata normal form. 190/10865 useless extension candidates. Maximal degree in co-relation 172667. Up to 5776 conditions per place. [2022-12-06 03:58:04,492 INFO L137 encePairwiseOnDemand]: 46/61 looper letters, 2077 selfloop transitions, 180 changer transitions 135/2392 dead transitions. [2022-12-06 03:58:04,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 2392 transitions, 97822 flow [2022-12-06 03:58:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:58:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:58:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 03:58:04,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25956284153005466 [2022-12-06 03:58:04,493 INFO L175 Difference]: Start difference. First operand has 604 places, 1559 transitions, 60514 flow. Second operand 6 states and 95 transitions. [2022-12-06 03:58:04,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 2392 transitions, 97822 flow [2022-12-06 03:58:17,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 2392 transitions, 96255 flow, removed 643 selfloop flow, removed 21 redundant places. [2022-12-06 03:58:17,450 INFO L231 Difference]: Finished difference. Result has 591 places, 1557 transitions, 60478 flow [2022-12-06 03:58:17,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=57457, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60478, PETRI_PLACES=591, PETRI_TRANSITIONS=1557} [2022-12-06 03:58:17,452 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 573 predicate places. [2022-12-06 03:58:17,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:58:17,452 INFO L89 Accepts]: Start accepts. Operand has 591 places, 1557 transitions, 60478 flow [2022-12-06 03:58:17,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:58:17,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:58:17,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 591 places, 1557 transitions, 60478 flow [2022-12-06 03:58:17,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 590 places, 1557 transitions, 60478 flow [2022-12-06 03:58:19,036 INFO L130 PetriNetUnfolder]: 1305/3568 cut-off events. [2022-12-06 03:58:19,036 INFO L131 PetriNetUnfolder]: For 668290/669232 co-relation queries the response was YES. [2022-12-06 03:58:19,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68636 conditions, 3568 events. 1305/3568 cut-off events. For 668290/669232 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 36369 event pairs, 6 based on Foata normal form. 93/3658 useless extension candidates. Maximal degree in co-relation 68422. Up to 1613 conditions per place. [2022-12-06 03:58:19,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 590 places, 1557 transitions, 60478 flow [2022-12-06 03:58:19,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 4754 [2022-12-06 03:58:19,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:58:19,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1734 [2022-12-06 03:58:19,186 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 1557 transitions, 60494 flow [2022-12-06 03:58:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:58:19,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:58:19,186 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:58:19,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-06 03:58:19,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 03:58:19,391 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:58:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:58:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1848702369, now seen corresponding path program 1 times [2022-12-06 03:58:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:58:19,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401195159] [2022-12-06 03:58:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:58:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:58:19,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:58:19,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401195159] [2022-12-06 03:58:19,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401195159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:58:19,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580524933] [2022-12-06 03:58:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:19,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:58:19,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:58:19,420 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:58:19,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 03:58:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:19,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:58:19,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:58:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:58:19,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:58:19,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580524933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:58:19,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:58:19,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 03:58:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668128861] [2022-12-06 03:58:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:58:19,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:58:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:58:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:58:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:58:19,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 03:58:19,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 1557 transitions, 60494 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:58:19,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:58:19,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 03:58:19,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:58:26,233 INFO L130 PetriNetUnfolder]: 6028/10556 cut-off events. [2022-12-06 03:58:26,233 INFO L131 PetriNetUnfolder]: For 1765778/1765778 co-relation queries the response was YES. [2022-12-06 03:58:26,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173607 conditions, 10556 events. 6028/10556 cut-off events. For 1765778/1765778 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 86200 event pairs, 594 based on Foata normal form. 10/10561 useless extension candidates. Maximal degree in co-relation 173390. Up to 5219 conditions per place. [2022-12-06 03:58:26,403 INFO L137 encePairwiseOnDemand]: 43/62 looper letters, 2125 selfloop transitions, 47 changer transitions 157/2329 dead transitions. [2022-12-06 03:58:26,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 2329 transitions, 95524 flow [2022-12-06 03:58:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:58:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:58:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-06 03:58:26,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30376344086021506 [2022-12-06 03:58:26,404 INFO L175 Difference]: Start difference. First operand has 590 places, 1557 transitions, 60494 flow. Second operand 6 states and 113 transitions. [2022-12-06 03:58:26,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 2329 transitions, 95524 flow [2022-12-06 03:58:39,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 2329 transitions, 93942 flow, removed 748 selfloop flow, removed 3 redundant places. [2022-12-06 03:58:39,090 INFO L231 Difference]: Finished difference. Result has 594 places, 1536 transitions, 59001 flow [2022-12-06 03:58:39,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=59180, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=59001, PETRI_PLACES=594, PETRI_TRANSITIONS=1536} [2022-12-06 03:58:39,093 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 576 predicate places. [2022-12-06 03:58:39,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:58:39,093 INFO L89 Accepts]: Start accepts. Operand has 594 places, 1536 transitions, 59001 flow [2022-12-06 03:58:39,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:58:39,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:58:39,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 594 places, 1536 transitions, 59001 flow [2022-12-06 03:58:39,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 591 places, 1536 transitions, 59001 flow [2022-12-06 03:58:40,740 INFO L130 PetriNetUnfolder]: 1292/3519 cut-off events. [2022-12-06 03:58:40,740 INFO L131 PetriNetUnfolder]: For 646631/647448 co-relation queries the response was YES. [2022-12-06 03:58:40,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67637 conditions, 3519 events. 1292/3519 cut-off events. For 646631/647448 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 35697 event pairs, 6 based on Foata normal form. 74/3590 useless extension candidates. Maximal degree in co-relation 67421. Up to 1592 conditions per place. [2022-12-06 03:58:40,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 591 places, 1536 transitions, 59001 flow [2022-12-06 03:58:40,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 4716 [2022-12-06 03:58:40,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:58:41,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L705-6-->L695-5: Formula: (and (= (* 5 v_~prev~0_276) (+ (* 21 v_~cur~0_230) (* v_~prev~0_277 13) (* 3 v_~next~0_142))) (= v_~j~0_359 (+ v_~j~0_361 (* v_~i~0_301 4))) (= (+ 12 v_~x~0_263) v_~x~0_262) (= v_~next~0_142 v_~cur~0_229) (< v_~q~0_258 2) (< v_~x~0_263 1) (= v_~q~0_256 (+ v_~q~0_258 4)) (= (+ (* 3 v_~prev~0_276) (* 21 v_~prev~0_277) (* 34 v_~cur~0_230)) (* 2 v_~next~0_142))) InVars {~j~0=v_~j~0_361, ~prev~0=v_~prev~0_277, ~i~0=v_~i~0_301, ~q~0=v_~q~0_258, ~cur~0=v_~cur~0_230, ~x~0=v_~x~0_263} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_165|, ~j~0=v_~j~0_359, ~next~0=v_~next~0_142, ~prev~0=v_~prev~0_276, ~i~0=v_~i~0_301, ~q~0=v_~q~0_256, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_180|, ~cur~0=v_~cur~0_229, ~x~0=v_~x~0_262} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [418] L687-5-->L695-5: Formula: (and (= v_~j~0_513 (+ v_~j~0_514 v_~i~0_455)) (= v_~p~0_305 (+ v_~p~0_306 1)) (= v_~q~0_384 (+ v_~q~0_385 1)) (< v_~p~0_306 5) (< v_~q~0_385 5) (= (+ v_~j~0_514 v_~i~0_456) v_~i~0_455)) InVars {~j~0=v_~j~0_514, ~i~0=v_~i~0_456, ~q~0=v_~q~0_385, ~p~0=v_~p~0_306} OutVars{~j~0=v_~j~0_513, ~i~0=v_~i~0_455, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_215|, ~q~0=v_~q~0_384, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_267|, ~p~0=v_~p~0_305} AuxVars[] AssignedVars[~j~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0] [2022-12-06 03:58:41,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L705-6-->L695-5: Formula: (and (= (* 5 v_~prev~0_276) (+ (* 21 v_~cur~0_230) (* v_~prev~0_277 13) (* 3 v_~next~0_142))) (= v_~j~0_359 (+ v_~j~0_361 (* v_~i~0_301 4))) (= (+ 12 v_~x~0_263) v_~x~0_262) (= v_~next~0_142 v_~cur~0_229) (< v_~q~0_258 2) (< v_~x~0_263 1) (= v_~q~0_256 (+ v_~q~0_258 4)) (= (+ (* 3 v_~prev~0_276) (* 21 v_~prev~0_277) (* 34 v_~cur~0_230)) (* 2 v_~next~0_142))) InVars {~j~0=v_~j~0_361, ~prev~0=v_~prev~0_277, ~i~0=v_~i~0_301, ~q~0=v_~q~0_258, ~cur~0=v_~cur~0_230, ~x~0=v_~x~0_263} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_165|, ~j~0=v_~j~0_359, ~next~0=v_~next~0_142, ~prev~0=v_~prev~0_276, ~i~0=v_~i~0_301, ~q~0=v_~q~0_256, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_180|, ~cur~0=v_~cur~0_229, ~x~0=v_~x~0_262} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [395] L687-5-->L687-5: Formula: (and (< v_~p~0_207 6) (= v_~p~0_207 (+ v_~p~0_209 2)) (= v_~i~0_327 (+ v_~i~0_329 (* v_~j~0_399 2)))) InVars {~j~0=v_~j~0_399, ~i~0=v_~i~0_329, ~p~0=v_~p~0_209} OutVars{~j~0=v_~j~0_399, ~i~0=v_~i~0_327, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_145|, ~p~0=v_~p~0_207} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:58:41,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L705-6-->L687-5: Formula: (and (= v_~next~0_175 v_~cur~0_286) (= (* 5 v_~prev~0_342) (+ (* 21 v_~cur~0_287) (* 3 v_~next~0_175) (* v_~prev~0_343 13))) (= (+ 12 v_~x~0_329) v_~x~0_328) (= v_~j~0_523 (+ v_~j~0_524 (* v_~i~0_464 4))) (= (* 2 v_~next~0_175) (+ (* 21 v_~prev~0_343) (* 34 v_~cur~0_287) (* 3 v_~prev~0_342))) (= v_~p~0_313 (+ v_~p~0_314 2)) (< v_~p~0_313 6) (< v_~q~0_395 2) (= (+ (* v_~j~0_523 2) v_~i~0_464) v_~i~0_463) (< v_~x~0_329 1) (= (+ v_~q~0_395 4) v_~q~0_394)) InVars {~j~0=v_~j~0_524, ~prev~0=v_~prev~0_343, ~i~0=v_~i~0_464, ~q~0=v_~q~0_395, ~p~0=v_~p~0_314, ~cur~0=v_~cur~0_287, ~x~0=v_~x~0_329} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_207|, ~j~0=v_~j~0_523, ~next~0=v_~next~0_175, ~prev~0=v_~prev~0_342, ~i~0=v_~i~0_463, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_219|, ~q~0=v_~q~0_394, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_273|, ~p~0=v_~p~0_313, ~cur~0=v_~cur~0_286, ~x~0=v_~x~0_328} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:58:41,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L687-5-->L687-5: Formula: (and (= (+ v_~p~0_126 3) v_~p~0_124) (= v_~i~0_219 (+ (* v_~j~0_275 3) v_~i~0_221)) (< v_~p~0_126 3)) InVars {~j~0=v_~j~0_275, ~i~0=v_~i~0_221, ~p~0=v_~p~0_126} OutVars{~j~0=v_~j~0_275, ~i~0=v_~i~0_219, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_87|, ~p~0=v_~p~0_124} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:58:41,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L687-5-->t1EXIT: Formula: (and (= v_~i~0_467 (+ (* v_~j~0_527 3) v_~i~0_468)) (< v_~p~0_318 3) (not (< v_~p~0_317 5)) (= |v_t1Thread1of1ForFork1_#res.offset_45| 0) (= |v_t1Thread1of1ForFork1_#res.base_45| 0) (= v_~p~0_317 (+ v_~p~0_318 3))) InVars {~j~0=v_~j~0_527, ~i~0=v_~i~0_468, ~p~0=v_~p~0_318} OutVars{~j~0=v_~j~0_527, ~i~0=v_~i~0_467, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_221|, t1Thread1of1ForFork1_#res.base=|v_t1Thread1of1ForFork1_#res.base_45|, ~p~0=v_~p~0_317, t1Thread1of1ForFork1_#res.offset=|v_t1Thread1of1ForFork1_#res.offset_45|} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, t1Thread1of1ForFork1_#res.base, ~p~0, t1Thread1of1ForFork1_#res.offset] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:58:41,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [419] L705-6-->L695-5: Formula: (and (= (+ (* 34 v_~cur~0_283) (* 21 v_~prev~0_339) (* 3 v_~prev~0_338)) (* 2 v_~next~0_173)) (= v_~j~0_517 (+ v_~j~0_519 (* v_~i~0_460 4) v_~i~0_459)) (< v_~q~0_388 6) (= v_~q~0_388 (+ 5 v_~q~0_390)) (< v_~p~0_310 5) (< v_~x~0_325 1) (= (+ (* 3 v_~next~0_173) (* v_~prev~0_339 13) (* 21 v_~cur~0_283)) (* 5 v_~prev~0_338)) (= (+ v_~j~0_519 (* 5 v_~i~0_460)) v_~i~0_459) (= v_~p~0_309 (+ v_~p~0_310 1)) (= (+ 12 v_~x~0_325) v_~x~0_324) (= v_~next~0_173 v_~cur~0_282)) InVars {~j~0=v_~j~0_519, ~prev~0=v_~prev~0_339, ~i~0=v_~i~0_460, ~q~0=v_~q~0_390, ~p~0=v_~p~0_310, ~cur~0=v_~cur~0_283, ~x~0=v_~x~0_325} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_205|, ~j~0=v_~j~0_517, ~next~0=v_~next~0_173, ~prev~0=v_~prev~0_338, ~i~0=v_~i~0_459, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_217|, ~q~0=v_~q~0_388, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_269|, ~p~0=v_~p~0_309, ~cur~0=v_~cur~0_282, ~x~0=v_~x~0_324} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:58:41,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [422] L705-6-->L695-5: Formula: (and (= v_~j~0_529 (+ v_~j~0_531 (* v_~i~0_472 4) v_~i~0_471)) (< v_~p~0_321 6) (= (+ v_~i~0_472 (* v_~j~0_529 2)) (* 3 v_~i~0_471)) (= v_~q~0_398 (+ 5 v_~q~0_400)) (= (* 2 v_~next~0_177) (+ (* 21 v_~prev~0_347) (* 3 v_~prev~0_346) (* 34 v_~cur~0_291))) (= (+ 12 v_~x~0_333) v_~x~0_332) (< v_~x~0_333 1) (= v_~next~0_177 v_~cur~0_290) (= v_~p~0_321 (+ v_~p~0_322 2)) (< v_~q~0_398 6) (= (* 5 v_~prev~0_346) (+ (* 21 v_~cur~0_291) (* 3 v_~next~0_177) (* v_~prev~0_347 13)))) InVars {~j~0=v_~j~0_531, ~prev~0=v_~prev~0_347, ~i~0=v_~i~0_472, ~q~0=v_~q~0_400, ~p~0=v_~p~0_322, ~cur~0=v_~cur~0_291, ~x~0=v_~x~0_333} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_209|, ~j~0=v_~j~0_529, ~next~0=v_~next~0_177, ~prev~0=v_~prev~0_346, ~i~0=v_~i~0_471, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_223|, ~q~0=v_~q~0_398, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_275|, ~p~0=v_~p~0_321, ~cur~0=v_~cur~0_290, ~x~0=v_~x~0_332} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:58:41,675 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L687-5-->L687-5: Formula: (and (= (+ v_~i~0_199 (* v_~j~0_267 2)) v_~i~0_197) (< v_~p~0_95 6) (= (+ v_~p~0_97 2) v_~p~0_95)) InVars {~j~0=v_~j~0_267, ~i~0=v_~i~0_199, ~p~0=v_~p~0_97} OutVars{~j~0=v_~j~0_267, ~i~0=v_~i~0_197, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_73|, ~p~0=v_~p~0_95} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:58:41,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L687-5-->t1EXIT: Formula: (and (< v_~p~0_120 6) (= |v_t1Thread1of1ForFork1_#res.offset_24| 0) (= |v_t1Thread1of1ForFork1_#res.base_24| 0) (not (< v_~p~0_120 5)) (= (+ v_~p~0_121 2) v_~p~0_120) (= v_~i~0_215 (+ (* v_~j~0_273 2) v_~i~0_216))) InVars {~j~0=v_~j~0_273, ~i~0=v_~i~0_216, ~p~0=v_~p~0_121} OutVars{~j~0=v_~j~0_273, ~i~0=v_~i~0_215, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_85|, t1Thread1of1ForFork1_#res.base=|v_t1Thread1of1ForFork1_#res.base_24|, ~p~0=v_~p~0_120, t1Thread1of1ForFork1_#res.offset=|v_t1Thread1of1ForFork1_#res.offset_24|} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, t1Thread1of1ForFork1_#res.base, ~p~0, t1Thread1of1ForFork1_#res.offset] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:58:41,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L687-5-->L695-5: Formula: (and (= v_~p~0_345 (+ v_~p~0_346 2)) (= (+ (* v_~j~0_552 2) v_~i~0_496) v_~i~0_495) (= v_~j~0_551 (+ v_~j~0_552 v_~i~0_495)) (< v_~p~0_345 6) (= v_~q~0_420 (+ v_~q~0_421 1)) (< v_~q~0_421 5)) InVars {~j~0=v_~j~0_552, ~i~0=v_~i~0_496, ~q~0=v_~q~0_421, ~p~0=v_~p~0_346} OutVars{~j~0=v_~j~0_551, ~i~0=v_~i~0_495, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_237|, ~q~0=v_~q~0_420, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_287|, ~p~0=v_~p~0_345} AuxVars[] AssignedVars[~j~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:58:41,853 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 03:58:41,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2760 [2022-12-06 03:58:41,853 INFO L495 AbstractCegarLoop]: Abstraction has has 588 places, 1532 transitions, 59103 flow [2022-12-06 03:58:41,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:58:41,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:58:41,853 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:58:41,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-06 03:58:42,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:58:42,057 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:58:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:58:42,058 INFO L85 PathProgramCache]: Analyzing trace with hash 384657047, now seen corresponding path program 1 times [2022-12-06 03:58:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:58:42,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938577661] [2022-12-06 03:58:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:58:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:58:42,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:58:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938577661] [2022-12-06 03:58:42,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938577661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:58:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838097317] [2022-12-06 03:58:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:42,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:58:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:58:42,091 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:58:42,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 03:58:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:42,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:58:42,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:58:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:58:42,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:58:42,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838097317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:58:42,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:58:42,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 03:58:42,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687080992] [2022-12-06 03:58:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:58:42,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:58:42,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:58:42,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:58:42,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:58:42,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 03:58:42,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 1532 transitions, 59103 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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:58:42,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:58:42,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 03:58:42,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:58:48,874 INFO L130 PetriNetUnfolder]: 6157/10746 cut-off events. [2022-12-06 03:58:48,874 INFO L131 PetriNetUnfolder]: For 1885669/1885669 co-relation queries the response was YES. [2022-12-06 03:58:48,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179051 conditions, 10746 events. 6157/10746 cut-off events. For 1885669/1885669 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 87140 event pairs, 707 based on Foata normal form. 111/10855 useless extension candidates. Maximal degree in co-relation 178832. Up to 6064 conditions per place. [2022-12-06 03:58:49,038 INFO L137 encePairwiseOnDemand]: 35/61 looper letters, 1999 selfloop transitions, 423 changer transitions 135/2557 dead transitions. [2022-12-06 03:58:49,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 2557 transitions, 103815 flow [2022-12-06 03:58:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:58:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:58:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-06 03:58:49,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23653395784543327 [2022-12-06 03:58:49,039 INFO L175 Difference]: Start difference. First operand has 588 places, 1532 transitions, 59103 flow. Second operand 7 states and 101 transitions. [2022-12-06 03:58:49,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 2557 transitions, 103815 flow [2022-12-06 03:59:02,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 2557 transitions, 102978 flow, removed 203 selfloop flow, removed 16 redundant places. [2022-12-06 03:59:02,086 INFO L231 Difference]: Finished difference. Result has 581 places, 1630 transitions, 64670 flow [2022-12-06 03:59:02,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=57650, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=64670, PETRI_PLACES=581, PETRI_TRANSITIONS=1630} [2022-12-06 03:59:02,088 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 563 predicate places. [2022-12-06 03:59:02,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:59:02,088 INFO L89 Accepts]: Start accepts. Operand has 581 places, 1630 transitions, 64670 flow [2022-12-06 03:59:02,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:59:02,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:59:02,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 581 places, 1630 transitions, 64670 flow [2022-12-06 03:59:02,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 579 places, 1630 transitions, 64670 flow [2022-12-06 03:59:03,699 INFO L130 PetriNetUnfolder]: 1306/3602 cut-off events. [2022-12-06 03:59:03,700 INFO L131 PetriNetUnfolder]: For 682524/683432 co-relation queries the response was YES. [2022-12-06 03:59:03,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70537 conditions, 3602 events. 1306/3602 cut-off events. For 682524/683432 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 37001 event pairs, 7 based on Foata normal form. 115/3714 useless extension candidates. Maximal degree in co-relation 70325. Up to 1640 conditions per place. [2022-12-06 03:59:03,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 579 places, 1630 transitions, 64670 flow [2022-12-06 03:59:03,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 4984 [2022-12-06 03:59:03,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:59:03,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1720 [2022-12-06 03:59:03,808 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 1630 transitions, 64670 flow [2022-12-06 03:59:03,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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:59:03,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:59:03,808 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:59:03,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-06 03:59:04,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 03:59:04,013 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:59:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:59:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 375811907, now seen corresponding path program 1 times [2022-12-06 03:59:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:59:04,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751237029] [2022-12-06 03:59:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:59:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:59:04,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751237029] [2022-12-06 03:59:04,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751237029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:59:04,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513519401] [2022-12-06 03:59:04,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:59:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:59:04,157 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:59:04,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 03:59:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:04,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 03:59:04,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:59:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:04,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:59:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:04,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513519401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:59:04,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:59:04,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:59:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286386482] [2022-12-06 03:59:04,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:59:04,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:59:04,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:59:04,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:59:04,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:59:04,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 03:59:04,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 1630 transitions, 64670 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:04,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:59:04,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 03:59:04,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:59:13,656 INFO L130 PetriNetUnfolder]: 6089/10669 cut-off events. [2022-12-06 03:59:13,656 INFO L131 PetriNetUnfolder]: For 1999868/1999868 co-relation queries the response was YES. [2022-12-06 03:59:13,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180676 conditions, 10669 events. 6089/10669 cut-off events. For 1999868/1999868 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 85846 event pairs, 1397 based on Foata normal form. 43/10710 useless extension candidates. Maximal degree in co-relation 180461. Up to 9538 conditions per place. [2022-12-06 03:59:13,988 INFO L137 encePairwiseOnDemand]: 14/59 looper letters, 1443 selfloop transitions, 296 changer transitions 38/1777 dead transitions. [2022-12-06 03:59:13,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 1777 transitions, 71425 flow [2022-12-06 03:59:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:59:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:59:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 180 transitions. [2022-12-06 03:59:13,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09533898305084745 [2022-12-06 03:59:13,989 INFO L175 Difference]: Start difference. First operand has 579 places, 1630 transitions, 64670 flow. Second operand 32 states and 180 transitions. [2022-12-06 03:59:13,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 1777 transitions, 71425 flow [2022-12-06 03:59:30,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 1777 transitions, 69582 flow, removed 842 selfloop flow, removed 7 redundant places. [2022-12-06 03:59:30,166 INFO L231 Difference]: Finished difference. Result has 609 places, 1653 transitions, 65050 flow [2022-12-06 03:59:30,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=62966, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=65050, PETRI_PLACES=609, PETRI_TRANSITIONS=1653} [2022-12-06 03:59:30,167 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 591 predicate places. [2022-12-06 03:59:30,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:59:30,167 INFO L89 Accepts]: Start accepts. Operand has 609 places, 1653 transitions, 65050 flow [2022-12-06 03:59:30,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:59:30,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:59:30,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 609 places, 1653 transitions, 65050 flow [2022-12-06 03:59:30,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 609 places, 1653 transitions, 65050 flow [2022-12-06 03:59:31,890 INFO L130 PetriNetUnfolder]: 1306/3640 cut-off events. [2022-12-06 03:59:31,890 INFO L131 PetriNetUnfolder]: For 695984/696752 co-relation queries the response was YES. [2022-12-06 03:59:31,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70436 conditions, 3640 events. 1306/3640 cut-off events. For 695984/696752 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 37584 event pairs, 6 based on Foata normal form. 108/3745 useless extension candidates. Maximal degree in co-relation 70222. Up to 1659 conditions per place. [2022-12-06 03:59:31,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 609 places, 1653 transitions, 65050 flow [2022-12-06 03:59:31,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 5018 [2022-12-06 03:59:32,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L687-5-->L695-5: Formula: (and (= v_~next~0_179 v_~cur~0_294) (< v_~x~0_337 1) (= (+ (* 34 v_~cur~0_295) (* 21 v_~prev~0_351) (* 3 v_~prev~0_350)) (* 2 v_~next~0_179)) (= (+ (* 5 v_~i~0_485) (* v_~j~0_544 6)) v_~i~0_483) (= (* 5 v_~prev~0_350) (+ (* v_~prev~0_351 13) (* 3 v_~next~0_179) (* 21 v_~cur~0_295))) (= (+ 5 v_~q~0_413) v_~q~0_412) (= v_~j~0_543 (+ (* v_~j~0_544 5) (* v_~i~0_485 4) v_~i~0_483)) (= (+ 12 v_~x~0_337) v_~x~0_336) (< v_~p~0_333 6) (< v_~q~0_412 6) (= v_~p~0_333 (+ v_~p~0_335 2))) InVars {~j~0=v_~j~0_544, ~prev~0=v_~prev~0_351, ~i~0=v_~i~0_485, ~q~0=v_~q~0_413, ~p~0=v_~p~0_335, ~cur~0=v_~cur~0_295, ~x~0=v_~x~0_337} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_211|, ~j~0=v_~j~0_543, ~next~0=v_~next~0_179, ~prev~0=v_~prev~0_350, ~i~0=v_~i~0_483, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_229|, ~q~0=v_~q~0_412, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_283|, ~p~0=v_~p~0_333, ~cur~0=v_~cur~0_294, ~x~0=v_~x~0_336} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:59:32,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L687-5-->L695-5: Formula: (and (= (+ v_~p~0_341 3) v_~p~0_339) (= (+ (* v_~prev~0_355 13) (* 3 v_~next~0_181) (* 21 v_~cur~0_299)) (* 5 v_~prev~0_354)) (= (+ 12 v_~x~0_341) v_~x~0_340) (= (+ v_~j~0_548 (* v_~j~0_547 2) v_~i~0_491) (* 3 v_~i~0_489)) (< v_~x~0_341 1) (= (+ 5 v_~q~0_417) v_~q~0_416) (= v_~j~0_547 (+ (* v_~j~0_548 5) v_~i~0_489 (* v_~i~0_491 4))) (= (* 2 v_~next~0_181) (+ (* 3 v_~prev~0_354) (* 21 v_~prev~0_355) (* 34 v_~cur~0_299))) (< v_~q~0_416 6) (< v_~p~0_339 6) (= v_~next~0_181 v_~cur~0_298)) InVars {~j~0=v_~j~0_548, ~prev~0=v_~prev~0_355, ~i~0=v_~i~0_491, ~q~0=v_~q~0_417, ~p~0=v_~p~0_341, ~cur~0=v_~cur~0_299, ~x~0=v_~x~0_341} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_213|, ~j~0=v_~j~0_547, ~next~0=v_~next~0_181, ~prev~0=v_~prev~0_354, ~i~0=v_~i~0_489, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_233|, ~q~0=v_~q~0_416, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_285|, ~p~0=v_~p~0_339, ~cur~0=v_~cur~0_298, ~x~0=v_~x~0_340} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:59:32,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] L687-5-->L687-5: Formula: (and (= v_~i~0_503 (+ v_~j~0_559 v_~i~0_505 (* v_~j~0_560 2))) (= (+ v_~p~0_355 3) v_~p~0_353) (= (* v_~j~0_559 2) (+ v_~j~0_560 v_~i~0_503)) (< v_~p~0_353 6) (< v_~q~0_429 5) (= v_~q~0_428 (+ v_~q~0_429 1))) InVars {~j~0=v_~j~0_560, ~i~0=v_~i~0_505, ~q~0=v_~q~0_429, ~p~0=v_~p~0_355} OutVars{~j~0=v_~j~0_559, ~i~0=v_~i~0_503, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_241|, ~q~0=v_~q~0_428, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_291|, ~p~0=v_~p~0_353} AuxVars[] AssignedVars[~j~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:59:32,487 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:59:32,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2321 [2022-12-06 03:59:32,488 INFO L495 AbstractCegarLoop]: Abstraction has has 605 places, 1649 transitions, 64947 flow [2022-12-06 03:59:32,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:32,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:59:32,488 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:59:32,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-06 03:59:32,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:59:32,698 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:59:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:59:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1744442458, now seen corresponding path program 3 times [2022-12-06 03:59:32,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:59:32,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078825949] [2022-12-06 03:59:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:32,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:59:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:32,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:59:32,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078825949] [2022-12-06 03:59:32,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078825949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:59:32,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085421906] [2022-12-06 03:59:32,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:59:32,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:59:32,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:59:32,830 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:59:32,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 03:59:32,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:59:32,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:59:32,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:59:32,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:59:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:33,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:59:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:33,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085421906] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:59:33,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:59:33,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 03:59:33,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759433707] [2022-12-06 03:59:33,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:59:33,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:59:33,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:59:33,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:59:33,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:59:33,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 03:59:33,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 1649 transitions, 64947 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:33,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:59:33,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 03:59:33,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:59:42,779 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:59:54,924 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 80 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 04:00:05,536 INFO L130 PetriNetUnfolder]: 6408/11294 cut-off events. [2022-12-06 04:00:05,537 INFO L131 PetriNetUnfolder]: For 2489609/2489609 co-relation queries the response was YES. [2022-12-06 04:00:05,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187661 conditions, 11294 events. 6408/11294 cut-off events. For 2489609/2489609 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 92341 event pairs, 615 based on Foata normal form. 100/11392 useless extension candidates. Maximal degree in co-relation 187444. Up to 7468 conditions per place. [2022-12-06 04:00:05,721 INFO L137 encePairwiseOnDemand]: 8/60 looper letters, 1173 selfloop transitions, 858 changer transitions 21/2052 dead transitions. [2022-12-06 04:00:05,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 2052 transitions, 78869 flow [2022-12-06 04:00:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 04:00:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 04:00:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 252 transitions. [2022-12-06 04:00:05,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.105 [2022-12-06 04:00:05,723 INFO L175 Difference]: Start difference. First operand has 605 places, 1649 transitions, 64947 flow. Second operand 40 states and 252 transitions. [2022-12-06 04:00:05,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 2052 transitions, 78869 flow [2022-12-06 04:00:23,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 2052 transitions, 78292 flow, removed 216 selfloop flow, removed 17 redundant places. [2022-12-06 04:00:23,522 INFO L231 Difference]: Finished difference. Result has 639 places, 1775 transitions, 72511 flow [2022-12-06 04:00:23,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=64378, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=742, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=72511, PETRI_PLACES=639, PETRI_TRANSITIONS=1775} [2022-12-06 04:00:23,524 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 621 predicate places. [2022-12-06 04:00:23,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:00:23,524 INFO L89 Accepts]: Start accepts. Operand has 639 places, 1775 transitions, 72511 flow [2022-12-06 04:00:23,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:00:23,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:00:23,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 639 places, 1775 transitions, 72511 flow [2022-12-06 04:00:23,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 639 places, 1775 transitions, 72511 flow [2022-12-06 04:00:25,862 INFO L130 PetriNetUnfolder]: 1376/3869 cut-off events. [2022-12-06 04:00:25,862 INFO L131 PetriNetUnfolder]: For 781589/782365 co-relation queries the response was YES. [2022-12-06 04:00:26,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77130 conditions, 3869 events. 1376/3869 cut-off events. For 781589/782365 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 40791 event pairs, 4 based on Foata normal form. 92/3958 useless extension candidates. Maximal degree in co-relation 76903. Up to 1813 conditions per place. [2022-12-06 04:00:26,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 639 places, 1775 transitions, 72511 flow [2022-12-06 04:00:26,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 5320 [2022-12-06 04:00:26,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:00:26,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2663 [2022-12-06 04:00:26,187 INFO L495 AbstractCegarLoop]: Abstraction has has 639 places, 1775 transitions, 72524 flow [2022-12-06 04:00:26,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:00:26,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:00:26,187 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:00:26,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-06 04:00:26,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-12-06 04:00:26,392 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:00:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:00:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1670751181, now seen corresponding path program 1 times [2022-12-06 04:00:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:00:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849658405] [2022-12-06 04:00:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:00:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:00:26,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:00:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849658405] [2022-12-06 04:00:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849658405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:00:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628372467] [2022-12-06 04:00:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:00:26,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:00:26,428 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:00:26,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-06 04:00:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:26,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 04:00:26,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:00:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:00:26,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:00:26,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628372467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:00:26,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:00:26,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-12-06 04:00:26,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079966836] [2022-12-06 04:00:26,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:00:26,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:00:26,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:00:26,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:00:26,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:00:26,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 04:00:26,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 1775 transitions, 72524 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 04:00:26,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:00:26,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 04:00:26,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:00:35,025 INFO L130 PetriNetUnfolder]: 6406/11292 cut-off events. [2022-12-06 04:00:35,025 INFO L131 PetriNetUnfolder]: For 2047023/2047023 co-relation queries the response was YES. [2022-12-06 04:00:35,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192426 conditions, 11292 events. 6406/11292 cut-off events. For 2047023/2047023 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 94654 event pairs, 1052 based on Foata normal form. 2/11292 useless extension candidates. Maximal degree in co-relation 192196. Up to 5925 conditions per place. [2022-12-06 04:00:35,223 INFO L137 encePairwiseOnDemand]: 53/61 looper letters, 2439 selfloop transitions, 13 changer transitions 219/2671 dead transitions. [2022-12-06 04:00:35,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 2671 transitions, 114814 flow [2022-12-06 04:00:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:00:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:00:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 04:00:35,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28524590163934427 [2022-12-06 04:00:35,224 INFO L175 Difference]: Start difference. First operand has 639 places, 1775 transitions, 72524 flow. Second operand 5 states and 87 transitions. [2022-12-06 04:00:35,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 2671 transitions, 114814 flow [2022-12-06 04:00:54,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 2671 transitions, 110656 flow, removed 1941 selfloop flow, removed 11 redundant places. [2022-12-06 04:00:54,104 INFO L231 Difference]: Finished difference. Result has 632 places, 1772 transitions, 69544 flow [2022-12-06 04:00:54,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=69609, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69544, PETRI_PLACES=632, PETRI_TRANSITIONS=1772} [2022-12-06 04:00:54,106 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 614 predicate places. [2022-12-06 04:00:54,106 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:00:54,106 INFO L89 Accepts]: Start accepts. Operand has 632 places, 1772 transitions, 69544 flow [2022-12-06 04:00:54,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:00:54,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:00:54,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 632 places, 1772 transitions, 69544 flow [2022-12-06 04:00:54,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 631 places, 1772 transitions, 69544 flow [2022-12-06 04:00:55,823 INFO L130 PetriNetUnfolder]: 1375/3865 cut-off events. [2022-12-06 04:00:55,823 INFO L131 PetriNetUnfolder]: For 777598/778335 co-relation queries the response was YES. [2022-12-06 04:00:55,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75611 conditions, 3865 events. 1375/3865 cut-off events. For 777598/778335 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 40727 event pairs, 4 based on Foata normal form. 92/3954 useless extension candidates. Maximal degree in co-relation 75383. Up to 1801 conditions per place. [2022-12-06 04:00:56,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 631 places, 1772 transitions, 69544 flow [2022-12-06 04:00:56,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 5316 [2022-12-06 04:00:56,108 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:00:56,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2003 [2022-12-06 04:00:56,109 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 1772 transitions, 69544 flow [2022-12-06 04:00:56,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 04:00:56,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:00:56,109 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:00:56,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-06 04:00:56,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-06 04:00:56,314 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:00:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:00:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1841922514, now seen corresponding path program 1 times [2022-12-06 04:00:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:00:56,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034571910] [2022-12-06 04:00:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:00:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:00:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:00:56,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034571910] [2022-12-06 04:00:56,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034571910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:00:56,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315232217] [2022-12-06 04:00:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:56,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:00:56,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:00:56,414 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:00:56,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-06 04:00:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:56,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 04:00:56,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:00:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:00:56,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:00:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:00:56,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315232217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:00:56,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:00:56,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:00:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492649] [2022-12-06 04:00:56,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:00:56,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:00:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:00:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:00:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:00:56,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 04:00:56,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 1772 transitions, 69544 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:00:56,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:00:56,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 04:00:56,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:01:12,719 INFO L130 PetriNetUnfolder]: 6459/11395 cut-off events. [2022-12-06 04:01:12,719 INFO L131 PetriNetUnfolder]: For 2140901/2140901 co-relation queries the response was YES. [2022-12-06 04:01:12,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192853 conditions, 11395 events. 6459/11395 cut-off events. For 2140901/2140901 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 93630 event pairs, 1233 based on Foata normal form. 22/11415 useless extension candidates. Maximal degree in co-relation 192622. Up to 9526 conditions per place. [2022-12-06 04:01:12,907 INFO L137 encePairwiseOnDemand]: 10/60 looper letters, 1432 selfloop transitions, 511 changer transitions 33/1976 dead transitions. [2022-12-06 04:01:12,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 1976 transitions, 77706 flow [2022-12-06 04:01:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 04:01:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 04:01:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 215 transitions. [2022-12-06 04:01:12,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09953703703703703 [2022-12-06 04:01:12,920 INFO L175 Difference]: Start difference. First operand has 631 places, 1772 transitions, 69544 flow. Second operand 36 states and 215 transitions. [2022-12-06 04:01:12,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 1976 transitions, 77706 flow [2022-12-06 04:01:33,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 1976 transitions, 77642 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:01:33,669 INFO L231 Difference]: Finished difference. Result has 668 places, 1796 transitions, 72222 flow [2022-12-06 04:01:33,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=69530, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=490, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=72222, PETRI_PLACES=668, PETRI_TRANSITIONS=1796} [2022-12-06 04:01:33,671 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 650 predicate places. [2022-12-06 04:01:33,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:01:33,671 INFO L89 Accepts]: Start accepts. Operand has 668 places, 1796 transitions, 72222 flow [2022-12-06 04:01:33,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:01:33,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:01:33,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 668 places, 1796 transitions, 72222 flow [2022-12-06 04:01:33,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 668 places, 1796 transitions, 72222 flow [2022-12-06 04:01:35,500 INFO L130 PetriNetUnfolder]: 1390/3909 cut-off events. [2022-12-06 04:01:35,500 INFO L131 PetriNetUnfolder]: For 820351/821098 co-relation queries the response was YES. [2022-12-06 04:01:35,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77726 conditions, 3909 events. 1390/3909 cut-off events. For 820351/821098 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 41326 event pairs, 3 based on Foata normal form. 106/4012 useless extension candidates. Maximal degree in co-relation 77494. Up to 1828 conditions per place. [2022-12-06 04:01:35,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 668 places, 1796 transitions, 72222 flow [2022-12-06 04:01:35,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 5374 [2022-12-06 04:01:36,065 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:01:36,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2395 [2022-12-06 04:01:36,066 INFO L495 AbstractCegarLoop]: Abstraction has has 666 places, 1794 transitions, 72259 flow [2022-12-06 04:01:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:01:36,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:01:36,066 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:01:36,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-06 04:01:36,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:01:36,271 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:01:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:01:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 552748681, now seen corresponding path program 1 times [2022-12-06 04:01:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:01:36,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138648599] [2022-12-06 04:01:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:01:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:01:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:01:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138648599] [2022-12-06 04:01:36,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138648599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:01:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590456594] [2022-12-06 04:01:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:36,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:01:36,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:01:36,310 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:01:36,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-06 04:01:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:36,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 04:01:36,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:01:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:01:36,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:01:36,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590456594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:01:36,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:01:36,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 04:01:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773877800] [2022-12-06 04:01:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:01:36,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:01:36,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:01:36,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:01:36,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:01:36,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 04:01:36,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 1794 transitions, 72259 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 04:01:36,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:01:36,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 04:01:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:01:44,880 INFO L130 PetriNetUnfolder]: 6445/11367 cut-off events. [2022-12-06 04:01:44,880 INFO L131 PetriNetUnfolder]: For 2116556/2116556 co-relation queries the response was YES. [2022-12-06 04:01:45,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194932 conditions, 11367 events. 6445/11367 cut-off events. For 2116556/2116556 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 95496 event pairs, 1056 based on Foata normal form. 2/11367 useless extension candidates. Maximal degree in co-relation 194697. Up to 5965 conditions per place. [2022-12-06 04:01:45,068 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 2460 selfloop transitions, 13 changer transitions 226/2699 dead transitions. [2022-12-06 04:01:45,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 2699 transitions, 114607 flow [2022-12-06 04:01:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:01:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:01:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-06 04:01:45,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 04:01:45,080 INFO L175 Difference]: Start difference. First operand has 666 places, 1794 transitions, 72259 flow. Second operand 4 states and 88 transitions. [2022-12-06 04:01:45,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 2699 transitions, 114607 flow [2022-12-06 04:02:02,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 2699 transitions, 113988 flow, removed 187 selfloop flow, removed 20 redundant places. [2022-12-06 04:02:02,745 INFO L231 Difference]: Finished difference. Result has 649 places, 1791 transitions, 71725 flow [2022-12-06 04:02:02,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=71768, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71725, PETRI_PLACES=649, PETRI_TRANSITIONS=1791} [2022-12-06 04:02:02,747 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 631 predicate places. [2022-12-06 04:02:02,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:02:02,747 INFO L89 Accepts]: Start accepts. Operand has 649 places, 1791 transitions, 71725 flow [2022-12-06 04:02:02,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:02:02,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:02:02,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 649 places, 1791 transitions, 71725 flow [2022-12-06 04:02:02,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 649 places, 1791 transitions, 71725 flow [2022-12-06 04:02:04,625 INFO L130 PetriNetUnfolder]: 1391/3904 cut-off events. [2022-12-06 04:02:04,625 INFO L131 PetriNetUnfolder]: For 822666/823397 co-relation queries the response was YES. [2022-12-06 04:02:04,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78130 conditions, 3904 events. 1391/3904 cut-off events. For 822666/823397 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 41170 event pairs, 5 based on Foata normal form. 108/4009 useless extension candidates. Maximal degree in co-relation 77898. Up to 1828 conditions per place. [2022-12-06 04:02:04,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 649 places, 1791 transitions, 71725 flow [2022-12-06 04:02:04,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 5360 [2022-12-06 04:02:04,747 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:02:04,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2000 [2022-12-06 04:02:04,747 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 1791 transitions, 71725 flow [2022-12-06 04:02:04,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 04:02:04,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:02:04,747 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:02:04,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-06 04:02:04,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-06 04:02:04,952 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:02:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:02:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1113864908, now seen corresponding path program 4 times [2022-12-06 04:02:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:02:04,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447392284] [2022-12-06 04:02:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:04,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:02:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:02:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:02:05,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447392284] [2022-12-06 04:02:05,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447392284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:02:05,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294044702] [2022-12-06 04:02:05,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 04:02:05,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:02:05,073 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:02:05,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-06 04:02:05,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 04:02:05,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:02:05,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 04:02:05,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:02:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:02:05,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:02:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:02:05,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294044702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:02:05,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:02:05,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 04:02:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810982093] [2022-12-06 04:02:05,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:02:05,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 04:02:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:02:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 04:02:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-12-06 04:02:05,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 04:02:05,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 1791 transitions, 71725 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:02:05,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:02:05,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 04:02:05,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:02:26,990 INFO L130 PetriNetUnfolder]: 7469/13144 cut-off events. [2022-12-06 04:02:26,990 INFO L131 PetriNetUnfolder]: For 3885540/3885540 co-relation queries the response was YES. [2022-12-06 04:02:27,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235440 conditions, 13144 events. 7469/13144 cut-off events. For 3885540/3885540 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 109684 event pairs, 413 based on Foata normal form. 136/13278 useless extension candidates. Maximal degree in co-relation 235205. Up to 5536 conditions per place. [2022-12-06 04:02:27,347 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 883 selfloop transitions, 1452 changer transitions 21/2356 dead transitions. [2022-12-06 04:02:27,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 2356 transitions, 92842 flow [2022-12-06 04:02:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-06 04:02:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-06 04:02:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 302 transitions. [2022-12-06 04:02:27,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10199257007767647 [2022-12-06 04:02:27,349 INFO L175 Difference]: Start difference. First operand has 649 places, 1791 transitions, 71725 flow. Second operand 47 states and 302 transitions. [2022-12-06 04:02:27,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 2356 transitions, 92842 flow [2022-12-06 04:02:53,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 2356 transitions, 92445 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-06 04:02:53,172 INFO L231 Difference]: Finished difference. Result has 703 places, 2016 transitions, 86399 flow [2022-12-06 04:02:53,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=71637, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=86399, PETRI_PLACES=703, PETRI_TRANSITIONS=2016} [2022-12-06 04:02:53,173 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 685 predicate places. [2022-12-06 04:02:53,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:02:53,173 INFO L89 Accepts]: Start accepts. Operand has 703 places, 2016 transitions, 86399 flow [2022-12-06 04:02:53,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:02:53,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:02:53,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 703 places, 2016 transitions, 86399 flow [2022-12-06 04:02:53,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 703 places, 2016 transitions, 86399 flow [2022-12-06 04:02:55,774 INFO L130 PetriNetUnfolder]: 1595/4477 cut-off events. [2022-12-06 04:02:55,775 INFO L131 PetriNetUnfolder]: For 1250704/1251633 co-relation queries the response was YES. [2022-12-06 04:02:55,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98168 conditions, 4477 events. 1595/4477 cut-off events. For 1250704/1251633 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 48551 event pairs, 6 based on Foata normal form. 109/4583 useless extension candidates. Maximal degree in co-relation 97926. Up to 2207 conditions per place. [2022-12-06 04:02:55,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 703 places, 2016 transitions, 86399 flow [2022-12-06 04:02:55,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 6052 [2022-12-06 04:02:56,015 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:02:56,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2843 [2022-12-06 04:02:56,016 INFO L495 AbstractCegarLoop]: Abstraction has has 703 places, 2016 transitions, 86414 flow [2022-12-06 04:02:56,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:02:56,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:02:56,016 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:02:56,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-06 04:02:56,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-06 04:02:56,221 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:02:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:02:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1020430743, now seen corresponding path program 1 times [2022-12-06 04:02:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:02:56,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590420025] [2022-12-06 04:02:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:02:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:02:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:02:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590420025] [2022-12-06 04:02:56,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590420025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:02:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735207309] [2022-12-06 04:02:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:56,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:02:56,365 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:02:56,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-06 04:02:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:56,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 04:02:56,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:02:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:02:56,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:02:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:02:57,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735207309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:02:57,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:02:57,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:02:57,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953542658] [2022-12-06 04:02:57,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:02:57,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:02:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:02:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:02:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:02:57,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 04:02:57,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 2016 transitions, 86414 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:02:57,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:02:57,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 04:02:57,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:01,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:13,539 INFO L130 PetriNetUnfolder]: 8269/14474 cut-off events. [2022-12-06 04:03:13,539 INFO L131 PetriNetUnfolder]: For 4533632/4533632 co-relation queries the response was YES. [2022-12-06 04:03:13,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280417 conditions, 14474 events. 8269/14474 cut-off events. For 4533632/4533632 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 121589 event pairs, 626 based on Foata normal form. 52/14524 useless extension candidates. Maximal degree in co-relation 280172. Up to 8006 conditions per place. [2022-12-06 04:03:13,808 INFO L137 encePairwiseOnDemand]: 8/65 looper letters, 1119 selfloop transitions, 1229 changer transitions 6/2354 dead transitions. [2022-12-06 04:03:13,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 2354 transitions, 101382 flow [2022-12-06 04:03:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 04:03:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 04:03:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 182 transitions. [2022-12-06 04:03:13,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12727272727272726 [2022-12-06 04:03:13,810 INFO L175 Difference]: Start difference. First operand has 703 places, 2016 transitions, 86414 flow. Second operand 22 states and 182 transitions. [2022-12-06 04:03:13,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 2354 transitions, 101382 flow [2022-12-06 04:03:48,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 2354 transitions, 96241 flow, removed 2361 selfloop flow, removed 23 redundant places. [2022-12-06 04:03:48,876 INFO L231 Difference]: Finished difference. Result has 707 places, 2156 transitions, 91888 flow [2022-12-06 04:03:48,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=81661, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=91888, PETRI_PLACES=707, PETRI_TRANSITIONS=2156} [2022-12-06 04:03:48,878 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 689 predicate places. [2022-12-06 04:03:48,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:03:48,878 INFO L89 Accepts]: Start accepts. Operand has 707 places, 2156 transitions, 91888 flow [2022-12-06 04:03:48,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:03:48,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:48,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 707 places, 2156 transitions, 91888 flow [2022-12-06 04:03:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 707 places, 2156 transitions, 91888 flow [2022-12-06 04:03:52,041 INFO L130 PetriNetUnfolder]: 1781/4913 cut-off events. [2022-12-06 04:03:52,043 INFO L131 PetriNetUnfolder]: For 1746190/1747219 co-relation queries the response was YES. [2022-12-06 04:03:52,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112510 conditions, 4913 events. 1781/4913 cut-off events. For 1746190/1747219 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 53462 event pairs, 23 based on Foata normal form. 100/5010 useless extension candidates. Maximal degree in co-relation 112264. Up to 2491 conditions per place. [2022-12-06 04:03:52,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 707 places, 2156 transitions, 91888 flow [2022-12-06 04:03:52,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 6514 [2022-12-06 04:03:52,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:03:52,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3471 [2022-12-06 04:03:52,349 INFO L495 AbstractCegarLoop]: Abstraction has has 707 places, 2156 transitions, 91905 flow [2022-12-06 04:03:52,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:03:52,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:52,349 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:52,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-06 04:03:52,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:03:52,555 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:03:52,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 328886258, now seen corresponding path program 1 times [2022-12-06 04:03:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:52,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197718967] [2022-12-06 04:03:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:03:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:52,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197718967] [2022-12-06 04:03:52,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197718967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:03:52,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122214144] [2022-12-06 04:03:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:52,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:03:52,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:03:52,587 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:03:52,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-06 04:03:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:52,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 04:03:52,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:03:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:03:52,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:03:52,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122214144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:03:52,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:03:52,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 04:03:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990543424] [2022-12-06 04:03:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:03:52,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:03:52,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:03:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:03:52,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 04:03:52,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 2156 transitions, 91905 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 04:03:52,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:52,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 04:03:52,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:05,916 INFO L130 PetriNetUnfolder]: 8232/14422 cut-off events. [2022-12-06 04:04:05,916 INFO L131 PetriNetUnfolder]: For 4390686/4390686 co-relation queries the response was YES. [2022-12-06 04:04:06,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279361 conditions, 14422 events. 8232/14422 cut-off events. For 4390686/4390686 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 123305 event pairs, 932 based on Foata normal form. 48/14468 useless extension candidates. Maximal degree in co-relation 279112. Up to 7284 conditions per place. [2022-12-06 04:04:06,187 INFO L137 encePairwiseOnDemand]: 43/66 looper letters, 2871 selfloop transitions, 60 changer transitions 249/3180 dead transitions. [2022-12-06 04:04:06,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 3180 transitions, 141580 flow [2022-12-06 04:04:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:04:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:04:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-06 04:04:06,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2601010101010101 [2022-12-06 04:04:06,188 INFO L175 Difference]: Start difference. First operand has 707 places, 2156 transitions, 91905 flow. Second operand 6 states and 103 transitions. [2022-12-06 04:04:06,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 3180 transitions, 141580 flow [2022-12-06 04:04:38,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 3180 transitions, 140522 flow, removed 410 selfloop flow, removed 13 redundant places. [2022-12-06 04:04:38,524 INFO L231 Difference]: Finished difference. Result has 701 places, 2119 transitions, 89492 flow [2022-12-06 04:04:38,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=89582, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89492, PETRI_PLACES=701, PETRI_TRANSITIONS=2119} [2022-12-06 04:04:38,526 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 683 predicate places. [2022-12-06 04:04:38,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:38,526 INFO L89 Accepts]: Start accepts. Operand has 701 places, 2119 transitions, 89492 flow [2022-12-06 04:04:38,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:38,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:38,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 701 places, 2119 transitions, 89492 flow [2022-12-06 04:04:38,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 699 places, 2119 transitions, 89492 flow [2022-12-06 04:04:41,428 INFO L130 PetriNetUnfolder]: 1767/4880 cut-off events. [2022-12-06 04:04:41,429 INFO L131 PetriNetUnfolder]: For 1743768/1744623 co-relation queries the response was YES. [2022-12-06 04:04:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112288 conditions, 4880 events. 1767/4880 cut-off events. For 1743768/1744623 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 52930 event pairs, 28 based on Foata normal form. 95/4972 useless extension candidates. Maximal degree in co-relation 112042. Up to 2460 conditions per place. [2022-12-06 04:04:41,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 699 places, 2119 transitions, 89492 flow [2022-12-06 04:04:41,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 6444 [2022-12-06 04:04:41,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_257) v_~x~0_256) (= (* 5 v_~prev~0_270) (+ (* 21 v_~cur~0_225) (* v_~prev~0_271 13) (* 3 v_~next~0_139))) (< v_~x~0_257 1) (< v_~q~0_239 3) (= v_~j~0_335 (+ v_~j~0_337 (* 3 v_~i~0_275))) (= (+ v_~q~0_239 3) v_~q~0_237) (= (* 2 v_~next~0_139) (+ (* 21 v_~prev~0_271) (* 34 v_~cur~0_225) (* 3 v_~prev~0_270))) (= v_~next~0_139 v_~cur~0_224)) InVars {~j~0=v_~j~0_337, ~prev~0=v_~prev~0_271, ~i~0=v_~i~0_275, ~q~0=v_~q~0_239, ~cur~0=v_~cur~0_225, ~x~0=v_~x~0_257} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_161|, ~j~0=v_~j~0_335, ~next~0=v_~next~0_139, ~prev~0=v_~prev~0_270, ~i~0=v_~i~0_275, ~q~0=v_~q~0_237, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_168|, ~cur~0=v_~cur~0_224, ~x~0=v_~x~0_256} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [388] L687-5-->L687-5: Formula: (and (= (+ v_~p~0_190 2) v_~p~0_188) (= v_~i~0_295 (+ (* v_~j~0_357 2) v_~i~0_297)) (< v_~p~0_190 4)) InVars {~j~0=v_~j~0_357, ~i~0=v_~i~0_297, ~p~0=v_~p~0_190} OutVars{~j~0=v_~j~0_357, ~i~0=v_~i~0_295, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_130|, ~p~0=v_~p~0_188} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:04:41,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_257) v_~x~0_256) (= (* 5 v_~prev~0_270) (+ (* 21 v_~cur~0_225) (* v_~prev~0_271 13) (* 3 v_~next~0_139))) (< v_~x~0_257 1) (< v_~q~0_239 3) (= v_~j~0_335 (+ v_~j~0_337 (* 3 v_~i~0_275))) (= (+ v_~q~0_239 3) v_~q~0_237) (= (* 2 v_~next~0_139) (+ (* 21 v_~prev~0_271) (* 34 v_~cur~0_225) (* 3 v_~prev~0_270))) (= v_~next~0_139 v_~cur~0_224)) InVars {~j~0=v_~j~0_337, ~prev~0=v_~prev~0_271, ~i~0=v_~i~0_275, ~q~0=v_~q~0_239, ~cur~0=v_~cur~0_225, ~x~0=v_~x~0_257} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_161|, ~j~0=v_~j~0_335, ~next~0=v_~next~0_139, ~prev~0=v_~prev~0_270, ~i~0=v_~i~0_275, ~q~0=v_~q~0_237, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_168|, ~cur~0=v_~cur~0_224, ~x~0=v_~x~0_256} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:04:41,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] L695-5-->L695-5: Formula: (and (= v_~j~0_387 (+ v_~j~0_389 (* 3 v_~i~0_323))) (< v_~q~0_280 6) (= (+ v_~q~0_282 3) v_~q~0_280)) InVars {~j~0=v_~j~0_389, ~i~0=v_~i~0_323, ~q~0=v_~q~0_282} OutVars{~j~0=v_~j~0_387, ~i~0=v_~i~0_323, ~q~0=v_~q~0_280, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_198|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:04:41,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [447] L705-6-->L687-5: Formula: (and (= (+ (* v_~j~0_659 2) v_~i~0_614) v_~i~0_613) (= (+ (* v_~prev~0_385 13) (* 3 v_~next~0_196) (* 21 v_~cur~0_324)) (* 5 v_~prev~0_384)) (= v_~j~0_659 (+ v_~j~0_660 (* 3 v_~i~0_614))) (= (+ v_~p~0_458 2) v_~p~0_457) (< v_~p~0_458 4) (= (* 2 v_~next~0_196) (+ (* 21 v_~prev~0_385) (* 34 v_~cur~0_324) (* 3 v_~prev~0_384))) (< v_~q~0_514 3) (< v_~x~0_371 1) (= (+ v_~q~0_514 3) v_~q~0_513) (= (+ 12 v_~x~0_371) v_~x~0_370) (= v_~next~0_196 v_~cur~0_323)) InVars {~j~0=v_~j~0_660, ~prev~0=v_~prev~0_385, ~i~0=v_~i~0_614, ~q~0=v_~q~0_514, ~p~0=v_~p~0_458, ~cur~0=v_~cur~0_324, ~x~0=v_~x~0_371} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_233|, ~j~0=v_~j~0_659, ~next~0=v_~next~0_196, ~prev~0=v_~prev~0_384, ~i~0=v_~i~0_613, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_308|, ~q~0=v_~q~0_513, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_347|, ~p~0=v_~p~0_457, ~cur~0=v_~cur~0_323, ~x~0=v_~x~0_370} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-06 04:04:41,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [448] L705-6-->L687-5: Formula: (and (= v_~j~0_663 (+ v_~j~0_664 (* 3 v_~i~0_618))) (< v_~q~0_518 3) (= v_~p~0_461 (+ v_~p~0_462 1)) (= v_~next~0_198 v_~cur~0_327) (= (* 5 v_~prev~0_388) (+ (* v_~prev~0_389 13) (* 3 v_~next~0_198) (* 21 v_~cur~0_328))) (< v_~p~0_462 5) (= v_~i~0_617 (+ v_~j~0_663 v_~i~0_618)) (< v_~x~0_375 1) (= (+ 12 v_~x~0_375) v_~x~0_374) (= (* 2 v_~next~0_198) (+ (* 21 v_~prev~0_389) (* 34 v_~cur~0_328) (* 3 v_~prev~0_388))) (= (+ v_~q~0_518 3) v_~q~0_517)) InVars {~j~0=v_~j~0_664, ~prev~0=v_~prev~0_389, ~i~0=v_~i~0_618, ~q~0=v_~q~0_518, ~p~0=v_~p~0_462, ~cur~0=v_~cur~0_328, ~x~0=v_~x~0_375} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_235|, ~j~0=v_~j~0_663, ~next~0=v_~next~0_198, ~prev~0=v_~prev~0_388, ~i~0=v_~i~0_617, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_310|, ~q~0=v_~q~0_517, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_349|, ~p~0=v_~p~0_461, ~cur~0=v_~cur~0_327, ~x~0=v_~x~0_374} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] [2022-12-06 04:04:41,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] L687-5-->L687-5: Formula: (and (= (+ v_~j~0_676 v_~j~0_675 v_~i~0_633) v_~i~0_631) (= v_~next~0_202 v_~cur~0_335) (= (+ v_~j~0_676 (* 3 v_~i~0_631)) (* v_~j~0_675 4)) (= (* 5 v_~prev~0_396) (+ (* 3 v_~next~0_202) (* v_~prev~0_397 13) (* 21 v_~cur~0_336))) (< v_~p~0_477 4) (= v_~q~0_529 (+ v_~q~0_530 3)) (< v_~q~0_530 3) (< v_~x~0_383 1) (= (+ 12 v_~x~0_383) v_~x~0_382) (= v_~p~0_475 (+ v_~p~0_477 2)) (= (+ (* 34 v_~cur~0_336) (* 3 v_~prev~0_396) (* 21 v_~prev~0_397)) (* 2 v_~next~0_202))) InVars {~j~0=v_~j~0_676, ~prev~0=v_~prev~0_397, ~i~0=v_~i~0_633, ~q~0=v_~q~0_530, ~p~0=v_~p~0_477, ~cur~0=v_~cur~0_336, ~x~0=v_~x~0_383} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_239|, ~j~0=v_~j~0_675, ~next~0=v_~next~0_202, ~prev~0=v_~prev~0_396, ~i~0=v_~i~0_631, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_318|, ~q~0=v_~q~0_529, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_355|, ~p~0=v_~p~0_475, ~cur~0=v_~cur~0_335, ~x~0=v_~x~0_382} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 04:04:42,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L687-5-->L687-5: Formula: (and (= (* 5 v_~prev~0_392) (+ (* 3 v_~next~0_200) (* 21 v_~cur~0_332) (* v_~prev~0_393 13))) (= v_~p~0_469 (+ v_~p~0_471 3)) (= (+ v_~q~0_526 3) v_~q~0_525) (= (+ v_~j~0_672 (* v_~j~0_671 2) v_~i~0_627) v_~i~0_625) (< v_~x~0_379 1) (= v_~next~0_200 v_~cur~0_331) (= (* v_~j~0_671 7) (+ v_~j~0_672 (* 3 v_~i~0_625))) (< v_~q~0_526 3) (< v_~p~0_471 3) (= (* 2 v_~next~0_200) (+ (* 21 v_~prev~0_393) (* 34 v_~cur~0_332) (* 3 v_~prev~0_392))) (= (+ 12 v_~x~0_379) v_~x~0_378)) InVars {~j~0=v_~j~0_672, ~prev~0=v_~prev~0_393, ~i~0=v_~i~0_627, ~q~0=v_~q~0_526, ~p~0=v_~p~0_471, ~cur~0=v_~cur~0_332, ~x~0=v_~x~0_379} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_237|, ~j~0=v_~j~0_671, ~next~0=v_~next~0_200, ~prev~0=v_~prev~0_392, ~i~0=v_~i~0_625, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_314|, ~q~0=v_~q~0_525, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_353|, ~p~0=v_~p~0_469, ~cur~0=v_~cur~0_331, ~x~0=v_~x~0_378} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 04:04:42,262 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:04:42,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3736 [2022-12-06 04:04:42,262 INFO L495 AbstractCegarLoop]: Abstraction has has 696 places, 2116 transitions, 89454 flow [2022-12-06 04:04:42,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 04:04:42,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:42,263 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:04:42,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-06 04:04:42,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:04:42,468 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:04:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 328350020, now seen corresponding path program 2 times [2022-12-06 04:04:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814137770] [2022-12-06 04:04:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:42,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:42,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814137770] [2022-12-06 04:04:42,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814137770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:04:42,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844703212] [2022-12-06 04:04:42,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:04:42,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:04:42,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:04:42,581 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:04:42,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-06 04:04:42,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:04:42,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:04:42,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 04:04:42,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:04:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:42,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:04:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:43,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844703212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:04:43,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:04:43,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 04:04:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308323051] [2022-12-06 04:04:43,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:04:43,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 04:04:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:43,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 04:04:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-12-06 04:04:43,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 04:04:43,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 2116 transitions, 89454 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:04:43,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:43,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 04:04:43,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:47,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:49,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:52,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:56,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:57,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:11,931 INFO L130 PetriNetUnfolder]: 8257/14489 cut-off events. [2022-12-06 04:05:11,931 INFO L131 PetriNetUnfolder]: For 4679583/4679583 co-relation queries the response was YES. [2022-12-06 04:05:12,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280935 conditions, 14489 events. 8257/14489 cut-off events. For 4679583/4679583 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 122228 event pairs, 1669 based on Foata normal form. 64/14551 useless extension candidates. Maximal degree in co-relation 280686. Up to 12152 conditions per place. [2022-12-06 04:05:12,327 INFO L137 encePairwiseOnDemand]: 11/64 looper letters, 1717 selfloop transitions, 604 changer transitions 62/2383 dead transitions. [2022-12-06 04:05:12,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 2383 transitions, 100241 flow [2022-12-06 04:05:12,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 04:05:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 04:05:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 253 transitions. [2022-12-06 04:05:12,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0859375 [2022-12-06 04:05:12,328 INFO L175 Difference]: Start difference. First operand has 696 places, 2116 transitions, 89454 flow. Second operand 46 states and 253 transitions. [2022-12-06 04:05:12,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 2383 transitions, 100241 flow [2022-12-06 04:05:48,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 2383 transitions, 100027 flow, removed 75 selfloop flow, removed 3 redundant places. [2022-12-06 04:05:48,850 INFO L231 Difference]: Finished difference. Result has 743 places, 2138 transitions, 92324 flow [2022-12-06 04:05:48,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=89246, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=92324, PETRI_PLACES=743, PETRI_TRANSITIONS=2138} [2022-12-06 04:05:48,851 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 725 predicate places. [2022-12-06 04:05:48,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:48,851 INFO L89 Accepts]: Start accepts. Operand has 743 places, 2138 transitions, 92324 flow [2022-12-06 04:05:48,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:48,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:48,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 743 places, 2138 transitions, 92324 flow [2022-12-06 04:05:48,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 741 places, 2138 transitions, 92324 flow [2022-12-06 04:05:51,847 INFO L130 PetriNetUnfolder]: 1767/4907 cut-off events. [2022-12-06 04:05:51,847 INFO L131 PetriNetUnfolder]: For 1747891/1748748 co-relation queries the response was YES. [2022-12-06 04:05:51,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113644 conditions, 4907 events. 1767/4907 cut-off events. For 1747891/1748748 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 53347 event pairs, 25 based on Foata normal form. 100/5004 useless extension candidates. Maximal degree in co-relation 113394. Up to 2479 conditions per place. [2022-12-06 04:05:52,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 741 places, 2138 transitions, 92324 flow [2022-12-06 04:05:52,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 6468 [2022-12-06 04:05:52,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L687-5-->L695-5: Formula: (and (< v_~p~0_482 4) (= (* 5 v_~prev~0_400) (+ (* v_~prev~0_401 13) (* 21 v_~cur~0_340) (* 3 v_~next~0_204))) (= v_~p~0_481 (+ v_~p~0_482 2)) (= (+ 12 v_~x~0_387) v_~x~0_386) (< v_~q~0_535 2) (= v_~next~0_204 v_~cur~0_339) (< v_~x~0_387 1) (= (+ v_~j~0_679 v_~j~0_681 v_~i~0_638) (* 2 v_~i~0_637)) (= v_~q~0_533 (+ v_~q~0_535 4)) (= (* 2 v_~next~0_204) (+ (* 34 v_~cur~0_340) (* 3 v_~prev~0_400) (* 21 v_~prev~0_401))) (= (+ (* v_~j~0_681 5) (* v_~i~0_638 4)) v_~i~0_637)) InVars {~j~0=v_~j~0_681, ~prev~0=v_~prev~0_401, ~i~0=v_~i~0_638, ~q~0=v_~q~0_535, ~p~0=v_~p~0_482, ~cur~0=v_~cur~0_340, ~x~0=v_~x~0_387} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_241|, ~j~0=v_~j~0_679, ~next~0=v_~next~0_204, ~prev~0=v_~prev~0_400, ~i~0=v_~i~0_637, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_322|, ~q~0=v_~q~0_533, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_357|, ~p~0=v_~p~0_481, ~cur~0=v_~cur~0_339, ~x~0=v_~x~0_386} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:05:52,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] L687-5-->L695-5: Formula: (and (= (* 5 v_~prev~0_404) (+ (* v_~prev~0_405 13) (* 3 v_~next~0_206) (* 21 v_~cur~0_344))) (< v_~p~0_486 3) (= (+ v_~p~0_486 3) v_~p~0_485) (= (+ (* 21 v_~prev~0_405) (* 3 v_~prev~0_404) (* 34 v_~cur~0_344)) (* 2 v_~next~0_206)) (= (+ v_~j~0_687 (* v_~i~0_641 10)) (* v_~j~0_685 7)) (= (+ 12 v_~x~0_391) v_~x~0_390) (= v_~next~0_206 v_~cur~0_343) (= v_~q~0_539 (+ v_~q~0_541 4)) (< v_~x~0_391 1) (< v_~q~0_541 2) (= (+ v_~j~0_687 (* v_~j~0_685 2) v_~i~0_642) (* 3 v_~i~0_641))) InVars {~j~0=v_~j~0_687, ~prev~0=v_~prev~0_405, ~i~0=v_~i~0_642, ~q~0=v_~q~0_541, ~p~0=v_~p~0_486, ~cur~0=v_~cur~0_344, ~x~0=v_~x~0_391} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_243|, ~j~0=v_~j~0_685, ~next~0=v_~next~0_206, ~prev~0=v_~prev~0_404, ~i~0=v_~i~0_641, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_324|, ~q~0=v_~q~0_539, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_361|, ~p~0=v_~p~0_485, ~cur~0=v_~cur~0_343, ~x~0=v_~x~0_390} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:05:52,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] L687-5-->L695-5: Formula: (and (= (* 5 v_~prev~0_404) (+ (* v_~prev~0_405 13) (* 3 v_~next~0_206) (* 21 v_~cur~0_344))) (< v_~p~0_486 3) (= (+ v_~p~0_486 3) v_~p~0_485) (= (+ (* 21 v_~prev~0_405) (* 3 v_~prev~0_404) (* 34 v_~cur~0_344)) (* 2 v_~next~0_206)) (= (+ v_~j~0_687 (* v_~i~0_641 10)) (* v_~j~0_685 7)) (= (+ 12 v_~x~0_391) v_~x~0_390) (= v_~next~0_206 v_~cur~0_343) (= v_~q~0_539 (+ v_~q~0_541 4)) (< v_~x~0_391 1) (< v_~q~0_541 2) (= (+ v_~j~0_687 (* v_~j~0_685 2) v_~i~0_642) (* 3 v_~i~0_641))) InVars {~j~0=v_~j~0_687, ~prev~0=v_~prev~0_405, ~i~0=v_~i~0_642, ~q~0=v_~q~0_541, ~p~0=v_~p~0_486, ~cur~0=v_~cur~0_344, ~x~0=v_~x~0_391} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_243|, ~j~0=v_~j~0_685, ~next~0=v_~next~0_206, ~prev~0=v_~prev~0_404, ~i~0=v_~i~0_641, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_324|, ~q~0=v_~q~0_539, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_361|, ~p~0=v_~p~0_485, ~cur~0=v_~cur~0_343, ~x~0=v_~x~0_390} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [457] L687-5-->L687-5: Formula: (and (= v_~p~0_503 (+ v_~p~0_505 2)) (= (+ (* v_~j~0_711 2) v_~i~0_665) v_~i~0_663) (< v_~p~0_505 4)) InVars {~j~0=v_~j~0_711, ~i~0=v_~i~0_665, ~p~0=v_~p~0_505} OutVars{~j~0=v_~j~0_711, ~i~0=v_~i~0_663, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_336|, ~p~0=v_~p~0_503} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:05:52,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L687-5-->L687-5: Formula: (and (= (+ (* v_~prev~0_419 13) (* 3 v_~next~0_213) (* 21 v_~cur~0_357)) (* 5 v_~prev~0_418)) (= (+ 12 v_~x~0_405) v_~x~0_404) (= v_~p~0_513 (+ v_~p~0_515 3)) (= (+ v_~j~0_720 v_~i~0_675 (* v_~j~0_719 3)) (* 2 v_~i~0_673)) (= (+ (* 34 v_~cur~0_357) (* 21 v_~prev~0_419) (* 3 v_~prev~0_418)) (* 2 v_~next~0_213)) (= (+ v_~j~0_719 (* v_~i~0_675 4) (* v_~j~0_720 5)) v_~i~0_673) (< v_~q~0_568 2) (= v_~next~0_213 v_~cur~0_356) (< v_~x~0_405 1) (< v_~p~0_513 6) (= (+ v_~q~0_568 4) v_~q~0_567)) InVars {~j~0=v_~j~0_720, ~prev~0=v_~prev~0_419, ~i~0=v_~i~0_675, ~q~0=v_~q~0_568, ~p~0=v_~p~0_515, ~cur~0=v_~cur~0_357, ~x~0=v_~x~0_405} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_251|, ~j~0=v_~j~0_719, ~next~0=v_~next~0_213, ~prev~0=v_~prev~0_418, ~i~0=v_~i~0_673, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_342|, ~q~0=v_~q~0_567, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_381|, ~p~0=v_~p~0_513, ~cur~0=v_~cur~0_356, ~x~0=v_~x~0_404} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 04:05:53,089 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] L687-5-->L687-5: Formula: (and (= v_~p~0_519 (+ v_~p~0_521 4)) (= (+ v_~q~0_572 4) v_~q~0_571) (< v_~p~0_519 6) (< v_~x~0_409 1) (= v_~next~0_215 v_~cur~0_360) (< v_~q~0_572 2) (= (+ v_~j~0_724 (* v_~i~0_679 10)) (* v_~j~0_723 17)) (= (* 2 v_~next~0_215) (+ (* 21 v_~prev~0_423) (* 34 v_~cur~0_361) (* 3 v_~prev~0_422))) (= (* 3 v_~i~0_679) (+ v_~j~0_724 (* v_~j~0_723 5) v_~i~0_681)) (= (* 5 v_~prev~0_422) (+ (* 3 v_~next~0_215) (* v_~prev~0_423 13) (* 21 v_~cur~0_361))) (= (+ 12 v_~x~0_409) v_~x~0_408)) InVars {~j~0=v_~j~0_724, ~prev~0=v_~prev~0_423, ~i~0=v_~i~0_681, ~q~0=v_~q~0_572, ~p~0=v_~p~0_521, ~cur~0=v_~cur~0_361, ~x~0=v_~x~0_409} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_253|, ~j~0=v_~j~0_723, ~next~0=v_~next~0_215, ~prev~0=v_~prev~0_422, ~i~0=v_~i~0_679, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_346|, ~q~0=v_~q~0_571, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_383|, ~p~0=v_~p~0_519, ~cur~0=v_~cur~0_360, ~x~0=v_~x~0_408} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 04:05:53,209 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 04:05:53,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4359 [2022-12-06 04:05:53,210 INFO L495 AbstractCegarLoop]: Abstraction has has 739 places, 2136 transitions, 92721 flow [2022-12-06 04:05:53,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:53,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:53,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:53,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-06 04:05:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:53,411 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:05:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 17847340, now seen corresponding path program 1 times [2022-12-06 04:05:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540820206] [2022-12-06 04:05:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:53,513 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 04:05:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:53,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540820206] [2022-12-06 04:05:53,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540820206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:53,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:53,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:05:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271407319] [2022-12-06 04:05:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:05:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:05:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:05:53,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 04:05:53,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 2136 transitions, 92721 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 04:05:53,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:53,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 04:05:53,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 04:05:59,806 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 04:05:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:05:59,859 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 04:05:59,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 04:05:59,860 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (5states, 0/73 universal loopers) in iteration 60,while PetriNetUnfolder was constructing finite prefix that currently has 105700 conditions, 6603 events (3613/6602 cut-off events. For 729881/729881 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 59728 event pairs, 1527 based on Foata normal form. 4/8028 useless extension candidates. Maximal degree in co-relation 105447. Up to 6457 conditions per place.). [2022-12-06 04:05:59,861 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 04:05:59,861 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 04:05:59,861 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:59,863 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:05:59,863 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:05:59,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:05:59 BasicIcfg [2022-12-06 04:05:59,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:05:59,865 INFO L158 Benchmark]: Toolchain (without parser) took 848802.52ms. Allocated memory was 201.3MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 175.4MB in the beginning and 509.4MB in the end (delta: -334.0MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-12-06 04:05:59,865 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 109.2MB in the beginning and 109.2MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:05:59,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.39ms. Allocated memory is still 201.3MB. Free memory was 175.1MB in the beginning and 154.8MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.77ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 153.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,865 INFO L158 Benchmark]: Boogie Preprocessor took 38.19ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 151.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,865 INFO L158 Benchmark]: RCFGBuilder took 423.61ms. Allocated memory is still 201.3MB. Free memory was 151.3MB in the beginning and 173.8MB in the end (delta: -22.5MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,865 INFO L158 Benchmark]: TraceAbstraction took 847919.39ms. Allocated memory was 201.3MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 172.8MB in the beginning and 509.4MB in the end (delta: -336.6MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2022-12-06 04:05:59,866 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 127.9MB. Free memory was 109.2MB in the beginning and 109.2MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 379.39ms. Allocated memory is still 201.3MB. Free memory was 175.1MB in the beginning and 154.8MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.77ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 153.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.19ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 151.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 423.61ms. Allocated memory is still 201.3MB. Free memory was 151.3MB in the beginning and 173.8MB in the end (delta: -22.5MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * TraceAbstraction took 847919.39ms. Allocated memory was 201.3MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 172.8MB in the beginning and 509.4MB in the end (delta: -336.6MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 91 PlacesBefore, 18 PlacesAfterwards, 91 TransitionsBefore, 14 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 1109, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1122, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1096, unknown conditional: 0, unknown unconditional: 1096] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1936, Positive conditional cache size: 0, Positive unconditional cache size: 1936, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 18 PlacesBefore, 18 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 78 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.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 42, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 102, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 150, Positive conditional cache size: 150, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 186, Positive conditional cache size: 186, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 20 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 204, Positive conditional cache size: 204, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 28 PlacesBefore, 28 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 236, Positive conditional cache size: 236, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 46 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 347, Positive conditional cache size: 347, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 349, Positive conditional cache size: 349, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 353, Positive conditional cache size: 353, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 444 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): 353, Positive cache size: 353, Positive conditional cache size: 353, 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, 80 PlacesBefore, 80 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 439, Positive conditional cache size: 439, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 99 PlacesBefore, 99 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 18, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 494, Positive conditional cache size: 494, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 545, Positive cache size: 545, Positive conditional cache size: 545, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 118 PlacesBefore, 118 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 647, Positive cache size: 647, Positive conditional cache size: 647, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 850 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): 647, Positive cache size: 647, Positive conditional cache size: 647, 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, 128 PlacesBefore, 128 PlacesAfterwards, 264 TransitionsBefore, 264 TransitionsAfterwards, 798 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 694, Positive cache size: 694, Positive conditional cache size: 694, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 348 TransitionsBefore, 348 TransitionsAfterwards, 1040 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): 694, Positive cache size: 694, Positive conditional cache size: 694, 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, 178 PlacesBefore, 178 PlacesAfterwards, 418 TransitionsBefore, 418 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 797, Positive cache size: 797, Positive conditional cache size: 797, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 178 PlacesBefore, 178 PlacesAfterwards, 415 TransitionsBefore, 415 TransitionsAfterwards, 1248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 846, Positive conditional cache size: 846, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 184 PlacesBefore, 184 PlacesAfterwards, 420 TransitionsBefore, 420 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 938, Positive conditional cache size: 938, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 202 PlacesBefore, 202 PlacesAfterwards, 481 TransitionsBefore, 481 TransitionsAfterwards, 1504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1031, Positive cache size: 1031, Positive conditional cache size: 1031, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 214 PlacesBefore, 214 PlacesAfterwards, 509 TransitionsBefore, 509 TransitionsAfterwards, 1556 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): 1031, Positive cache size: 1031, Positive conditional cache size: 1031, 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, 237 PlacesBefore, 237 PlacesAfterwards, 574 TransitionsBefore, 574 TransitionsAfterwards, 1724 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 235 PlacesBefore, 235 PlacesAfterwards, 566 TransitionsBefore, 566 TransitionsAfterwards, 1750 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, 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, 238 PlacesBefore, 238 PlacesAfterwards, 560 TransitionsBefore, 560 TransitionsAfterwards, 1726 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, 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, 254 PlacesBefore, 254 PlacesAfterwards, 592 TransitionsBefore, 592 TransitionsAfterwards, 1814 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, 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, 276 PlacesBefore, 276 PlacesAfterwards, 695 TransitionsBefore, 695 TransitionsAfterwards, 2192 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): 1088, Positive cache size: 1088, Positive conditional cache size: 1088, 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.2s, 307 PlacesBefore, 307 PlacesAfterwards, 760 TransitionsBefore, 760 TransitionsAfterwards, 2428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1095, Positive cache size: 1095, Positive conditional cache size: 1095, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 298 PlacesBefore, 298 PlacesAfterwards, 782 TransitionsBefore, 782 TransitionsAfterwards, 2534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 34, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1159, Positive conditional cache size: 1159, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 300 PlacesBefore, 300 PlacesAfterwards, 777 TransitionsBefore, 777 TransitionsAfterwards, 2458 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): 1159, Positive cache size: 1159, Positive conditional cache size: 1159, 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, 308 PlacesBefore, 308 PlacesAfterwards, 834 TransitionsBefore, 834 TransitionsAfterwards, 2690 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): 1159, Positive cache size: 1159, Positive conditional cache size: 1159, 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.2s, 342 PlacesBefore, 342 PlacesAfterwards, 895 TransitionsBefore, 895 TransitionsAfterwards, 2802 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1390, Positive cache size: 1390, Positive conditional cache size: 1390, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 335 PlacesBefore, 335 PlacesAfterwards, 843 TransitionsBefore, 843 TransitionsAfterwards, 2664 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): 1390, Positive cache size: 1390, Positive conditional cache size: 1390, 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, 365 PlacesBefore, 365 PlacesAfterwards, 909 TransitionsBefore, 909 TransitionsAfterwards, 2798 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1447, Positive cache size: 1447, Positive conditional cache size: 1447, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 403 PlacesBefore, 403 PlacesAfterwards, 1045 TransitionsBefore, 1045 TransitionsAfterwards, 3176 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): 1447, Positive cache size: 1447, Positive conditional cache size: 1447, 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.2s, 430 PlacesBefore, 430 PlacesAfterwards, 1111 TransitionsBefore, 1111 TransitionsAfterwards, 3324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1767, Positive cache size: 1767, Positive conditional cache size: 1767, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 458 PlacesBefore, 457 PlacesAfterwards, 1193 TransitionsBefore, 1192 TransitionsAfterwards, 3544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1784, Positive cache size: 1784, Positive conditional cache size: 1784, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 451 PlacesBefore, 451 PlacesAfterwards, 1181 TransitionsBefore, 1181 TransitionsAfterwards, 3526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1865, Positive cache size: 1865, Positive conditional cache size: 1865, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 476 PlacesBefore, 476 PlacesAfterwards, 1225 TransitionsBefore, 1225 TransitionsAfterwards, 3632 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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): 2003, Positive cache size: 2003, Positive conditional cache size: 2003, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 498 PlacesBefore, 496 PlacesAfterwards, 1264 TransitionsBefore, 1262 TransitionsAfterwards, 3716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2009, Positive cache size: 2009, Positive conditional cache size: 2009, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 523 PlacesBefore, 523 PlacesAfterwards, 1372 TransitionsBefore, 1372 TransitionsAfterwards, 3974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2018, Positive cache size: 2018, Positive conditional cache size: 2018, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 540 PlacesBefore, 540 PlacesAfterwards, 1461 TransitionsBefore, 1461 TransitionsAfterwards, 4182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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): 2294, Positive cache size: 2294, Positive conditional cache size: 2294, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 570 PlacesBefore, 569 PlacesAfterwards, 1514 TransitionsBefore, 1513 TransitionsAfterwards, 4300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2411, Positive cache size: 2411, Positive conditional cache size: 2411, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 561 PlacesBefore, 561 PlacesAfterwards, 1503 TransitionsBefore, 1503 TransitionsAfterwards, 4538 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): 2411, Positive cache size: 2411, Positive conditional cache size: 2411, 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, 566 PlacesBefore, 566 PlacesAfterwards, 1503 TransitionsBefore, 1503 TransitionsAfterwards, 4560 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): 2411, Positive cache size: 2411, Positive conditional cache size: 2411, 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, 605 PlacesBefore, 604 PlacesAfterwards, 1560 TransitionsBefore, 1559 TransitionsAfterwards, 4654 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2588, Positive conditional cache size: 2588, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 590 PlacesBefore, 590 PlacesAfterwards, 1557 TransitionsBefore, 1557 TransitionsAfterwards, 4754 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2659, Positive cache size: 2659, Positive conditional cache size: 2659, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 591 PlacesBefore, 588 PlacesAfterwards, 1536 TransitionsBefore, 1532 TransitionsAfterwards, 4716 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 28, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3009, Positive cache size: 3009, Positive conditional cache size: 3009, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 579 PlacesBefore, 579 PlacesAfterwards, 1630 TransitionsBefore, 1630 TransitionsAfterwards, 4984 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): 3009, Positive cache size: 3009, Positive conditional cache size: 3009, 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.5s, 609 PlacesBefore, 605 PlacesAfterwards, 1653 TransitionsBefore, 1649 TransitionsAfterwards, 5018 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3200, Positive cache size: 3200, Positive conditional cache size: 3200, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 639 PlacesBefore, 639 PlacesAfterwards, 1775 TransitionsBefore, 1775 TransitionsAfterwards, 5320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3256, Positive cache size: 3256, Positive conditional cache size: 3256, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 631 PlacesBefore, 631 PlacesAfterwards, 1772 TransitionsBefore, 1772 TransitionsAfterwards, 5316 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): 3256, Positive cache size: 3256, Positive conditional cache size: 3256, 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.4s, 668 PlacesBefore, 666 PlacesAfterwards, 1796 TransitionsBefore, 1794 TransitionsAfterwards, 5374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3495, Positive cache size: 3495, Positive conditional cache size: 3495, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 649 PlacesBefore, 649 PlacesAfterwards, 1791 TransitionsBefore, 1791 TransitionsAfterwards, 5360 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): 3495, Positive cache size: 3495, Positive conditional cache size: 3495, 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, 703 PlacesBefore, 703 PlacesAfterwards, 2016 TransitionsBefore, 2016 TransitionsAfterwards, 6052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3648, Positive cache size: 3648, Positive conditional cache size: 3648, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 707 PlacesBefore, 707 PlacesAfterwards, 2156 TransitionsBefore, 2156 TransitionsAfterwards, 6514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3695, Positive cache size: 3695, Positive conditional cache size: 3695, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 699 PlacesBefore, 696 PlacesAfterwards, 2119 TransitionsBefore, 2116 TransitionsAfterwards, 6444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3742, Positive cache size: 3742, Positive conditional cache size: 3742, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 741 PlacesBefore, 739 PlacesAfterwards, 2138 TransitionsBefore, 2136 TransitionsAfterwards, 6468 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 14, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4091, Positive cache size: 4091, Positive conditional cache size: 4091, 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: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (5states, 0/73 universal loopers) in iteration 60,while PetriNetUnfolder was constructing finite prefix that currently has 105700 conditions, 6603 events (3613/6602 cut-off events. For 729881/729881 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 59728 event pairs, 1527 based on Foata normal form. 4/8028 useless extension candidates. Maximal degree in co-relation 105447. Up to 6457 conditions per place.). - TimeoutResultAtElement [Line: 720]: 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 (5states, 0/73 universal loopers) in iteration 60,while PetriNetUnfolder was constructing finite prefix that currently has 105700 conditions, 6603 events (3613/6602 cut-off events. For 729881/729881 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 59728 event pairs, 1527 based on Foata normal form. 4/8028 useless extension candidates. Maximal degree in co-relation 105447. Up to 6457 conditions per place.). - TimeoutResultAtElement [Line: 721]: 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 (5states, 0/73 universal loopers) in iteration 60,while PetriNetUnfolder was constructing finite prefix that currently has 105700 conditions, 6603 events (3613/6602 cut-off events. For 729881/729881 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 59728 event pairs, 1527 based on Foata normal form. 4/8028 useless extension candidates. Maximal degree in co-relation 105447. Up to 6457 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 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: 847.8s, OverallIterations: 60, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 752.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 6566 SdHoareTripleChecker+Valid, 75.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6566 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 72.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7047 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21531 IncrementalHoareTripleChecker+Invalid, 28592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7047 mSolverCounterUnsat, 0 mSDtfsCounter, 21531 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1883 GetRequests, 652 SyntacticMatches, 2 SemanticMatches, 1229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 102.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92721occurred in iteration=59, InterpolantAutomatonStates: 966, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 1336 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 1622 ConstructedInterpolants, 281 QuantifiedInterpolants, 37093 SizeOfPredicates, 34 NumberOfNonLiveVariables, 8864 ConjunctsInSsa, 750 ConjunctsInUnsatCore, 155 InterpolantComputations, 21 PerfectInterpolantSequences, 181/550 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