/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_unsafe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:51:49,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:51:49,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:51:49,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:51:49,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:51:49,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:51:49,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:51:49,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:51:49,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:51:49,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:51:49,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:51:49,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:51:49,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:51:49,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:51:49,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:51:49,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:51:49,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:51:49,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:51:49,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:51:49,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:51:49,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:51:49,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:51:49,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:51:49,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:51:49,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:51:49,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:51:49,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:51:49,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:51:49,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:51:49,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:51:49,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:51:49,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:51:49,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:51:49,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:51:49,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:51:49,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:51:49,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:51:49,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:51:49,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:51:49,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:51:49,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:51:49,470 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,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:51:49,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:51:49,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:51:49,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:51:49,511 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:51:49,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:51:49,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:51:49,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:51:49,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:51:49,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:51:49,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:51:49,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:51:49,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:51:49,514 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:51:49,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:51:49,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:51:49,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:51:49,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:51:49,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:51:49,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:51:49,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:51:49,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:49,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:51:49,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:51:49,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:51:49,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:51:49,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:51:49,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:51:49,516 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,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:51:49,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:51:49,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:51:49,818 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:51:49,818 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:51:49,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-12-06 03:51:50,967 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:51:51,341 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:51:51,342 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-12-06 03:51:51,369 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac9bf9b67/5f6fdd9f1a274fa89f217c7dc01c8d10/FLAG21240a3ab [2022-12-06 03:51:51,379 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac9bf9b67/5f6fdd9f1a274fa89f217c7dc01c8d10 [2022-12-06 03:51:51,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:51:51,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:51:51,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:51,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:51:51,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:51:51,385 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,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517027d5 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,385 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,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:51:51,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:51:51,636 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_unsafe-5.i[30243,30256] [2022-12-06 03:51:51,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,665 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:51:51,701 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_unsafe-5.i[30243,30256] [2022-12-06 03:51:51,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,736 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:51:51,736 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,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:51,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:51:51,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:51:51,742 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,751 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,771 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-06 03:51:51,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:51:51,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:51:51,778 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,778 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,783 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,784 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,787 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,789 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,790 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,790 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,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:51:51,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:51:51,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:51:51,793 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,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:51,832 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,854 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,872 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 03:51:51,872 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 03:51:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 03:51:51,873 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:51:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:51:51,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:51:51,874 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,997 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:51:51,998 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:51:52,201 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:51:52,206 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:51:52,207 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:51:52,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:52 BoogieIcfgContainer [2022-12-06 03:51:52,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:51:52,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:51:52,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:51:52,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:51:52,213 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:52,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb2dac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:52, skipping insertion in model container [2022-12-06 03:51:52,214 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:52,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb2dac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:52, skipping insertion in model container [2022-12-06 03:51:52,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:52" (3/3) ... [2022-12-06 03:51:52,218 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2022-12-06 03:51:52,234 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:51:52,234 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:51:52,234 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:51:52,302 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 03:51:52,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:52,400 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:52,401 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:52,407 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,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:52,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:52,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,464 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:52,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:52,465 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,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 03:51:55,565 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-06 03:51:55,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:51:55,591 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;@71014304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:51:55,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:51:55,595 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-06 03:51:55,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,596 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,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-06 03:51:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449551274] [2022-12-06 03:51:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,765 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,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449551274] [2022-12-06 03:51:55,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449551274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:51:55,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:51:55,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:51:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518877931] [2022-12-06 03:51:55,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:51:55,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:51:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:55,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:51:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:51:55,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:55,790 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,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:55,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:55,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:55,837 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 03:51:55,838 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:51:55,838 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,839 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-06 03:51:55,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:51:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:51:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 03:51:55,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 03:51:55,849 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,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,851 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,852 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,853 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,856 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 03:51:55,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:55,856 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:55,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:55,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,862 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 03:51:55,862 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,862 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,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 03:51:55,863 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:51:55,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 03:51:55,864 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,864 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,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:51:55,865 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,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-06 03:51:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131991015] [2022-12-06 03:51:55,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,930 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,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131991015] [2022-12-06 03:51:55,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131991015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:55,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102407017] [2022-12-06 03:51:55,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:55,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:55,934 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,996 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:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:56,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:56,054 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,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:56,064 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,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102407017] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:56,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:56,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086841848] [2022-12-06 03:51:56,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:56,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:56,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:56,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 03:51:56,066 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:56,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:56,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 03:51:56,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:56,147 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:56,147 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:56,147 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:56,148 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:56,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:56,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 03:51:56,150 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:56,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:56,150 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:56,151 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,151 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:56,152 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:56,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:56,152 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:56,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:56,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,155 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:56,155 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:56,155 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,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:56,342 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:56,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 03:51:56,344 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:56,344 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,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:56,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:56,353 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,550 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,550 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,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-06 03:51:56,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:56,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082478783] [2022-12-06 03:51:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,617 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,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:56,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082478783] [2022-12-06 03:51:56,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082478783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:56,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22740013] [2022-12-06 03:51:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:56,619 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,622 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,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:56,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:56,680 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,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:56,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:51:56,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22740013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:56,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:56,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273152107] [2022-12-06 03:51:56,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:56,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:56,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:56,692 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,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:56,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:56,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:56,756 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:56,757 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 03:51:56,757 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,758 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:56,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:56,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 03:51:56,760 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,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,761 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,762 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,762 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,763 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:56,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:56,763 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:56,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:56,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,766 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:56,766 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:56,766 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,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:56,975 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:56,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 03:51:56,976 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:56,976 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,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:56,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:56,983 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:57,176 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:57,177 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:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-06 03:51:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:57,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680206132] [2022-12-06 03:51:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,212 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,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680206132] [2022-12-06 03:51:57,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680206132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668391712] [2022-12-06 03:51:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,214 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,216 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,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:57,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:57,288 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,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:57,298 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,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668391712] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:57,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:57,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:57,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835522562] [2022-12-06 03:51:57,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:57,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:57,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:57,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:57,299 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,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:57,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:57,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:57,368 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:57,369 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-06 03:51:57,369 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,370 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:57,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:57,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:57,371 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,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:57,372 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,373 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,373 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,374 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:57,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:57,374 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:57,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:57,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,377 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:57,377 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:57,377 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,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:57,499 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:57,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 03:51:57,500 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:57,500 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,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:57,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:57,519 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,701 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,701 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,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149196, now seen corresponding path program 1 times [2022-12-06 03:51:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:57,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018332089] [2022-12-06 03:51:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,745 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,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018332089] [2022-12-06 03:51:57,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018332089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372275187] [2022-12-06 03:51:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,747 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,749 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,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:57,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:57,807 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,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:57,816 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,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372275187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:57,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:57,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635374244] [2022-12-06 03:51:57,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:57,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:57,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:57,819 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,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:57,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:57,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:57,869 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:57,870 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 03:51:57,871 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,872 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:57,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:57,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:57,874 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,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:57,877 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,877 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,878 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,879 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:57,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:57,879 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:57,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:57,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,883 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:57,883 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:57,884 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,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:58,015 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:58,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 03:51:58,017 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:58,017 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:58,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:58,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:58,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:58,222 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,222 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,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149134, now seen corresponding path program 1 times [2022-12-06 03:51:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694252002] [2022-12-06 03:51:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,255 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,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:58,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694252002] [2022-12-06 03:51:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694252002] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:58,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819155261] [2022-12-06 03:51:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:58,256 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,258 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,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,312 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,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:58,327 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,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819155261] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:58,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:58,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-06 03:51:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250839430] [2022-12-06 03:51:58,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:58,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:51:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:51:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:51:58,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:58,328 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,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:58,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:58,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:58,365 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 03:51:58,365 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 03:51:58,366 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,366 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 03:51:58,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-06 03:51:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:51:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:51:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 03:51:58,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:51:58,367 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,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-06 03:51:58,367 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,368 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,368 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,368 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 03:51:58,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:58,368 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:58,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:58,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,370 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 03:51:58,370 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:58,370 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,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 03:51:58,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 03:51:58,429 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:51:58,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 03:51:58,430 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-06 03:51:58,430 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,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:58,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:58,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:58,635 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,636 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,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149103, now seen corresponding path program 1 times [2022-12-06 03:51:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900523064] [2022-12-06 03:51:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,768 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,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:58,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900523064] [2022-12-06 03:51:58,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900523064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:58,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277105383] [2022-12-06 03:51:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:58,770 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,772 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,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,868 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,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:59,027 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:59,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277105383] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:59,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:59,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-06 03:51:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924549265] [2022-12-06 03:51:59,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:59,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:51:59,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:51:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:51:59,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:59,029 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:59,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:59,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:59,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:01,238 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,280 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,296 INFO L130 PetriNetUnfolder]: 265/405 cut-off events. [2022-12-06 03:52:03,296 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 03:52:03,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 405 events. 265/405 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1301 event pairs, 28 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 1045. Up to 167 conditions per place. [2022-12-06 03:52:03,298 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 46 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2022-12-06 03:52:03,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 65 transitions, 326 flow [2022-12-06 03:52:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:52:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:52:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-06 03:52:03,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 03:52:03,299 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:52:03,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 65 transitions, 326 flow [2022-12-06 03:52:03,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 65 transitions, 294 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:03,300 INFO L231 Difference]: Finished difference. Result has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:03,300 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=159, PETRI_PLACES=27, PETRI_TRANSITIONS=33} [2022-12-06 03:52:03,301 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 9 predicate places. [2022-12-06 03:52:03,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:03,301 INFO L89 Accepts]: Start accepts. Operand has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:03,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:03,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:03,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:03,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:03,305 INFO L130 PetriNetUnfolder]: 35/76 cut-off events. [2022-12-06 03:52:03,305 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-12-06 03:52:03,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 76 events. 35/76 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 212 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 175. Up to 41 conditions per place. [2022-12-06 03:52:03,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:03,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 03:52:03,315 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:52:03,361 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:52:03,477 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:52:03,517 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:52:03,620 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:03,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-06 03:52:03,621 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 33 transitions, 181 flow [2022-12-06 03:52:03,621 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:52:03,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:03,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:03,627 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:52:03,821 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:52:03,822 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:52:03,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148917, now seen corresponding path program 1 times [2022-12-06 03:52:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:03,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119512844] [2022-12-06 03:52:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:03,860 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:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:03,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119512844] [2022-12-06 03:52:03,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119512844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:03,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:03,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703963158] [2022-12-06 03:52:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:03,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:03,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:52:03,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 33 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:03,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:52:03,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:03,912 INFO L130 PetriNetUnfolder]: 180/286 cut-off events. [2022-12-06 03:52:03,913 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-06 03:52:03,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 286 events. 180/286 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 897 event pairs, 63 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 818. Up to 155 conditions per place. [2022-12-06 03:52:03,914 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 25 selfloop transitions, 6 changer transitions 2/33 dead transitions. [2022-12-06 03:52:03,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 227 flow [2022-12-06 03:52:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 03:52:03,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 03:52:03,928 INFO L175 Difference]: Start difference. First operand has 27 places, 33 transitions, 181 flow. Second operand 3 states and 26 transitions. [2022-12-06 03:52:03,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 227 flow [2022-12-06 03:52:03,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 215 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 03:52:03,929 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 131 flow [2022-12-06 03:52:03,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-06 03:52:03,930 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 10 predicate places. [2022-12-06 03:52:03,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:03,930 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 131 flow [2022-12-06 03:52:03,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:03,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:03,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 131 flow [2022-12-06 03:52:03,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 131 flow [2022-12-06 03:52:03,934 INFO L130 PetriNetUnfolder]: 26/58 cut-off events. [2022-12-06 03:52:03,934 INFO L131 PetriNetUnfolder]: For 66/68 co-relation queries the response was YES. [2022-12-06 03:52:03,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 58 events. 26/58 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 137. Up to 33 conditions per place. [2022-12-06 03:52:03,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 131 flow [2022-12-06 03:52:03,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 03:52:03,935 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:03,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:52:03,936 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 131 flow [2022-12-06 03:52:03,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:03,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:03,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 03:52:03,936 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,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1106078701, now seen corresponding path program 1 times [2022-12-06 03:52:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:03,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620661156] [2022-12-06 03:52:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,180 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,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:04,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620661156] [2022-12-06 03:52:04,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620661156] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:04,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647016731] [2022-12-06 03:52:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:04,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:04,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:04,182 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:52:04,212 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:52:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:04,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:04,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:04,329 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,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:04,585 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,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647016731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:04,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:04,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257452032] [2022-12-06 03:52:04,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:04,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:04,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:04,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:52:04,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 131 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,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:04,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:52:04,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:05,332 INFO L130 PetriNetUnfolder]: 350/539 cut-off events. [2022-12-06 03:52:05,332 INFO L131 PetriNetUnfolder]: For 665/665 co-relation queries the response was YES. [2022-12-06 03:52:05,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 539 events. 350/539 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1931 event pairs, 25 based on Foata normal form. 20/559 useless extension candidates. Maximal degree in co-relation 1582. Up to 219 conditions per place. [2022-12-06 03:52:05,334 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-06 03:52:05,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 101 transitions, 612 flow [2022-12-06 03:52:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:52:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:52:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-12-06 03:52:05,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-06 03:52:05,335 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 131 flow. Second operand 12 states and 100 transitions. [2022-12-06 03:52:05,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 101 transitions, 612 flow [2022-12-06 03:52:05,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 101 transitions, 576 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:05,338 INFO L231 Difference]: Finished difference. Result has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:05,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=37, PETRI_TRANSITIONS=55} [2022-12-06 03:52:05,338 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-06 03:52:05,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:05,338 INFO L89 Accepts]: Start accepts. Operand has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:05,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:05,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:05,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:05,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:05,345 INFO L130 PetriNetUnfolder]: 52/109 cut-off events. [2022-12-06 03:52:05,345 INFO L131 PetriNetUnfolder]: For 129/133 co-relation queries the response was YES. [2022-12-06 03:52:05,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 109 events. 52/109 cut-off events. For 129/133 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 346 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 339. Up to 72 conditions per place. [2022-12-06 03:52:05,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:05,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-06 03:52:05,378 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 [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (< v_~x~0_22 12) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-06 03:52:05,486 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L705-6-->L687-5: Formula: (and (= (+ v_~j~0_125 v_~i~0_110) v_~i~0_109) (= v_~p~0_43 (+ v_~p~0_44 1)) (< v_~p~0_44 5) (= v_~cur~0_127 v_~next~0_80) (= (+ 12 v_~x~0_141) v_~x~0_140) (< v_~x~0_141 1) (= (* 2 v_~next~0_80) (+ (* 34 v_~cur~0_128) (* 21 v_~prev~0_157) (* 3 v_~prev~0_156))) (= (* 5 v_~prev~0_156) (+ (* 3 v_~next~0_80) (* v_~prev~0_157 13) (* 21 v_~cur~0_128)))) InVars {~j~0=v_~j~0_125, ~prev~0=v_~prev~0_157, ~i~0=v_~i~0_110, ~p~0=v_~p~0_44, ~cur~0=v_~cur~0_128, ~x~0=v_~x~0_141} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_85|, ~j~0=v_~j~0_125, ~next~0=v_~next~0_80, ~prev~0=v_~prev~0_156, ~i~0=v_~i~0_109, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_30|, ~p~0=v_~p~0_43, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_140} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (< v_~x~0_22 12) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-06 03:52:05,603 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:05,677 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:52:05,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 339 [2022-12-06 03:52:05,677 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 55 transitions, 403 flow [2022-12-06 03:52:05,677 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,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:05,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:05,685 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:05,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:05,878 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:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1421157024, now seen corresponding path program 1 times [2022-12-06 03:52:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:05,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926788717] [2022-12-06 03:52:05,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:05,916 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:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926788717] [2022-12-06 03:52:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926788717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:05,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087832013] [2022-12-06 03:52:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:05,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:05,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:05,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:05,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:52:05,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 55 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:05,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:52:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:05,966 INFO L130 PetriNetUnfolder]: 285/446 cut-off events. [2022-12-06 03:52:05,966 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-06 03:52:05,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 446 events. 285/446 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1554 event pairs, 111 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 1520. Up to 251 conditions per place. [2022-12-06 03:52:05,968 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-06 03:52:05,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 511 flow [2022-12-06 03:52:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 03:52:05,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 03:52:05,969 INFO L175 Difference]: Start difference. First operand has 37 places, 55 transitions, 403 flow. Second operand 3 states and 30 transitions. [2022-12-06 03:52:05,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 511 flow [2022-12-06 03:52:05,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 439 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:05,972 INFO L231 Difference]: Finished difference. Result has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:05,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=37, PETRI_TRANSITIONS=50} [2022-12-06 03:52:05,973 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-06 03:52:05,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:05,973 INFO L89 Accepts]: Start accepts. Operand has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:05,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:05,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:05,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:05,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:05,980 INFO L130 PetriNetUnfolder]: 43/92 cut-off events. [2022-12-06 03:52:05,980 INFO L131 PetriNetUnfolder]: For 157/166 co-relation queries the response was YES. [2022-12-06 03:52:05,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 92 events. 43/92 cut-off events. For 157/166 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 288 event pairs, 0 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 258. Up to 45 conditions per place. [2022-12-06 03:52:05,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:05,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 03:52:05,982 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:05,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 03:52:05,983 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:05,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have 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,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:05,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:05,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 03:52:05,983 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,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1105155242, now seen corresponding path program 1 times [2022-12-06 03:52:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:05,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959630142] [2022-12-06 03:52:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:06,118 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:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:06,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959630142] [2022-12-06 03:52:06,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959630142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:06,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004366833] [2022-12-06 03:52:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:06,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:06,120 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:06,123 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:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:06,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:52:06,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:06,255 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:06,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:06,530 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:06,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004366833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:06,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:06,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:06,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242001722] [2022-12-06 03:52:06,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:06,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:06,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:06,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:06,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 50 transitions, 321 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:06,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:06,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:06,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:08,796 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:08,979 INFO L130 PetriNetUnfolder]: 497/766 cut-off events. [2022-12-06 03:52:08,979 INFO L131 PetriNetUnfolder]: For 1304/1304 co-relation queries the response was YES. [2022-12-06 03:52:08,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 766 events. 497/766 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3091 event pairs, 28 based on Foata normal form. 20/772 useless extension candidates. Maximal degree in co-relation 2431. Up to 279 conditions per place. [2022-12-06 03:52:08,984 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 58 selfloop transitions, 65 changer transitions 0/123 dead transitions. [2022-12-06 03:52:08,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 850 flow [2022-12-06 03:52:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:52:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:52:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-06 03:52:08,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 03:52:08,985 INFO L175 Difference]: Start difference. First operand has 37 places, 50 transitions, 321 flow. Second operand 10 states and 96 transitions. [2022-12-06 03:52:08,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 850 flow [2022-12-06 03:52:08,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 123 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:08,992 INFO L231 Difference]: Finished difference. Result has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:08,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=635, PETRI_PLACES=47, PETRI_TRANSITIONS=79} [2022-12-06 03:52:08,993 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 29 predicate places. [2022-12-06 03:52:08,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:08,993 INFO L89 Accepts]: Start accepts. Operand has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:08,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:08,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:08,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:08,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:09,005 INFO L130 PetriNetUnfolder]: 77/159 cut-off events. [2022-12-06 03:52:09,005 INFO L131 PetriNetUnfolder]: For 382/391 co-relation queries the response was YES. [2022-12-06 03:52:09,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 159 events. 77/159 cut-off events. For 382/391 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 630 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 578. Up to 96 conditions per place. [2022-12-06 03:52:09,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:09,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 03:52:09,007 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:09,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 03:52:09,007 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:09,008 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:09,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:09,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:09,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 03:52:09,213 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,SelfDestructingSolverStorable10 [2022-12-06 03:52:09,213 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:09,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1106194796, now seen corresponding path program 1 times [2022-12-06 03:52:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:09,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896993711] [2022-12-06 03:52:09,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:09,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:09,281 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:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:09,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896993711] [2022-12-06 03:52:09,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896993711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:09,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:09,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:52:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050641100] [2022-12-06 03:52:09,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:09,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:52:09,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:09,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:52:09,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:52:09,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:09,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 79 transitions, 635 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:09,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:09,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:09,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:09,356 INFO L130 PetriNetUnfolder]: 382/627 cut-off events. [2022-12-06 03:52:09,356 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2022-12-06 03:52:09,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 627 events. 382/627 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2647 event pairs, 163 based on Foata normal form. 67/683 useless extension candidates. Maximal degree in co-relation 2205. Up to 359 conditions per place. [2022-12-06 03:52:09,358 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 58 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-06 03:52:09,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 703 flow [2022-12-06 03:52:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:52:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:52:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 03:52:09,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-06 03:52:09,359 INFO L175 Difference]: Start difference. First operand has 47 places, 79 transitions, 635 flow. Second operand 4 states and 29 transitions. [2022-12-06 03:52:09,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 703 flow [2022-12-06 03:52:09,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 665 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:09,364 INFO L231 Difference]: Finished difference. Result has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:09,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=45, PETRI_TRANSITIONS=63} [2022-12-06 03:52:09,365 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-06 03:52:09,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:09,365 INFO L89 Accepts]: Start accepts. Operand has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:09,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:09,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:09,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:09,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:09,372 INFO L130 PetriNetUnfolder]: 52/131 cut-off events. [2022-12-06 03:52:09,373 INFO L131 PetriNetUnfolder]: For 281/289 co-relation queries the response was YES. [2022-12-06 03:52:09,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 131 events. 52/131 cut-off events. For 281/289 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 561 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 427. Up to 53 conditions per place. [2022-12-06 03:52:09,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:09,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 03:52:09,374 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:09,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 03:52:09,374 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:09,375 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:09,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:09,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:09,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 03:52:09,375 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:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1429433377, now seen corresponding path program 1 times [2022-12-06 03:52:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:09,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660913433] [2022-12-06 03:52:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:09,477 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:09,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:09,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660913433] [2022-12-06 03:52:09,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660913433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:09,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814583517] [2022-12-06 03:52:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:09,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:09,492 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:09,493 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:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:09,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:09,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:09,636 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:09,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:09,844 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:09,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814583517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:09,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:09,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610259040] [2022-12-06 03:52:09,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:09,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:09,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:52:09,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 63 transitions, 509 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:09,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:09,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:52:09,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:10,256 INFO L130 PetriNetUnfolder]: 412/689 cut-off events. [2022-12-06 03:52:10,257 INFO L131 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2022-12-06 03:52:10,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 689 events. 412/689 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3044 event pairs, 37 based on Foata normal form. 26/701 useless extension candidates. Maximal degree in co-relation 2326. Up to 427 conditions per place. [2022-12-06 03:52:10,259 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 68 selfloop transitions, 42 changer transitions 0/110 dead transitions. [2022-12-06 03:52:10,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 883 flow [2022-12-06 03:52:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:52:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:52:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 03:52:10,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 03:52:10,261 INFO L175 Difference]: Start difference. First operand has 45 places, 63 transitions, 509 flow. Second operand 10 states and 74 transitions. [2022-12-06 03:52:10,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 883 flow [2022-12-06 03:52:10,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:10,265 INFO L231 Difference]: Finished difference. Result has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:10,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=56, PETRI_TRANSITIONS=77} [2022-12-06 03:52:10,266 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-06 03:52:10,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:10,266 INFO L89 Accepts]: Start accepts. Operand has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:10,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:10,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:10,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:10,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:10,275 INFO L130 PetriNetUnfolder]: 62/154 cut-off events. [2022-12-06 03:52:10,275 INFO L131 PetriNetUnfolder]: For 397/411 co-relation queries the response was YES. [2022-12-06 03:52:10,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 154 events. 62/154 cut-off events. For 397/411 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 690 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 598. Up to 62 conditions per place. [2022-12-06 03:52:10,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:10,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 03:52:10,457 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:10,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 03:52:10,458 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 77 transitions, 732 flow [2022-12-06 03:52:10,458 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:10,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:10,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:10,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:10,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 03:52:10,659 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,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash 67788185, now seen corresponding path program 1 times [2022-12-06 03:52:10,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:10,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058154050] [2022-12-06 03:52:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:10,859 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:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058154050] [2022-12-06 03:52:10,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058154050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183219021] [2022-12-06 03:52:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:10,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:10,872 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:10,898 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:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:10,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:10,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:11,067 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:11,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:11,320 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:11,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183219021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:11,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:11,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:11,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681064934] [2022-12-06 03:52:11,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:11,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:11,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:11,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:11,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:11,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:11,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 77 transitions, 732 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,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:11,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:11,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:12,622 INFO L130 PetriNetUnfolder]: 472/809 cut-off events. [2022-12-06 03:52:12,622 INFO L131 PetriNetUnfolder]: For 3362/3362 co-relation queries the response was YES. [2022-12-06 03:52:12,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 809 events. 472/809 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3821 event pairs, 35 based on Foata normal form. 40/838 useless extension candidates. Maximal degree in co-relation 3038. Up to 460 conditions per place. [2022-12-06 03:52:12,626 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 79 selfloop transitions, 58 changer transitions 0/137 dead transitions. [2022-12-06 03:52:12,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 137 transitions, 1256 flow [2022-12-06 03:52:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:52:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:52:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 03:52:12,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-06 03:52:12,627 INFO L175 Difference]: Start difference. First operand has 56 places, 77 transitions, 732 flow. Second operand 11 states and 82 transitions. [2022-12-06 03:52:12,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 137 transitions, 1256 flow [2022-12-06 03:52:12,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 1203 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:12,634 INFO L231 Difference]: Finished difference. Result has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:12,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1061, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2022-12-06 03:52:12,634 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-06 03:52:12,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:12,634 INFO L89 Accepts]: Start accepts. Operand has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:12,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:12,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:12,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:12,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:12,646 INFO L130 PetriNetUnfolder]: 76/197 cut-off events. [2022-12-06 03:52:12,647 INFO L131 PetriNetUnfolder]: For 730/744 co-relation queries the response was YES. [2022-12-06 03:52:12,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 197 events. 76/197 cut-off events. For 730/744 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 963 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 866. Up to 82 conditions per place. [2022-12-06 03:52:12,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:12,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 03:52:12,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:12,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 03:52:12,684 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 1064 flow [2022-12-06 03:52:12,684 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,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:12,684 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:12,699 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:12,889 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,SelfDestructingSolverStorable13 [2022-12-06 03:52:12,889 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,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1362434503, now seen corresponding path program 1 times [2022-12-06 03:52:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:12,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987478145] [2022-12-06 03:52:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:13,049 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:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987478145] [2022-12-06 03:52:13,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987478145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:13,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587104430] [2022-12-06 03:52:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:13,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:13,051 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:13,077 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:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:13,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:13,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:13,211 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:13,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:13,417 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:13,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587104430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:13,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:13,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571969847] [2022-12-06 03:52:13,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:13,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:13,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:52:13,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 1064 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:13,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:13,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:52:13,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:14,780 INFO L130 PetriNetUnfolder]: 512/889 cut-off events. [2022-12-06 03:52:14,780 INFO L131 PetriNetUnfolder]: For 4839/4839 co-relation queries the response was YES. [2022-12-06 03:52:14,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 889 events. 512/889 cut-off events. For 4839/4839 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4407 event pairs, 42 based on Foata normal form. 24/902 useless extension candidates. Maximal degree in co-relation 3656. Up to 544 conditions per place. [2022-12-06 03:52:14,786 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 91 selfloop transitions, 62 changer transitions 0/153 dead transitions. [2022-12-06 03:52:14,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1586 flow [2022-12-06 03:52:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:52:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:52:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-06 03:52:14,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-06 03:52:14,787 INFO L175 Difference]: Start difference. First operand has 67 places, 101 transitions, 1064 flow. Second operand 11 states and 83 transitions. [2022-12-06 03:52:14,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1586 flow [2022-12-06 03:52:14,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 1547 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:14,801 INFO L231 Difference]: Finished difference. Result has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:14,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=78, PETRI_TRANSITIONS=117} [2022-12-06 03:52:14,801 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 60 predicate places. [2022-12-06 03:52:14,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:14,802 INFO L89 Accepts]: Start accepts. Operand has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:14,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:14,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:14,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:14,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:14,820 INFO L130 PetriNetUnfolder]: 86/226 cut-off events. [2022-12-06 03:52:14,820 INFO L131 PetriNetUnfolder]: For 1142/1154 co-relation queries the response was YES. [2022-12-06 03:52:14,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 226 events. 86/226 cut-off events. For 1142/1154 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1164 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 1100. Up to 102 conditions per place. [2022-12-06 03:52:14,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:14,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 03:52:14,929 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:14,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 03:52:14,930 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 117 transitions, 1375 flow [2022-12-06 03:52:14,930 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:14,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:14,930 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:14,956 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:15,130 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,SelfDestructingSolverStorable14 [2022-12-06 03:52:15,131 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,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 549134360, now seen corresponding path program 1 times [2022-12-06 03:52:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:15,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197374111] [2022-12-06 03:52:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:15,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:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197374111] [2022-12-06 03:52:15,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197374111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983318602] [2022-12-06 03:52:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:15,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:15,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:15,280 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:15,288 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:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:15,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:15,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:15,442 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,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:15,643 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,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983318602] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:15,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:15,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400405575] [2022-12-06 03:52:15,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:15,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:15,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:52:15,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 117 transitions, 1375 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:15,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:15,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:52:15,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:21,418 INFO L130 PetriNetUnfolder]: 532/933 cut-off events. [2022-12-06 03:52:21,418 INFO L131 PetriNetUnfolder]: For 5436/5436 co-relation queries the response was YES. [2022-12-06 03:52:21,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 933 events. 532/933 cut-off events. For 5436/5436 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4772 event pairs, 36 based on Foata normal form. 12/934 useless extension candidates. Maximal degree in co-relation 4128. Up to 468 conditions per place. [2022-12-06 03:52:21,422 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 101 selfloop transitions, 88 changer transitions 2/191 dead transitions. [2022-12-06 03:52:21,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 2063 flow [2022-12-06 03:52:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:52:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:52:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-06 03:52:21,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2669683257918552 [2022-12-06 03:52:21,424 INFO L175 Difference]: Start difference. First operand has 78 places, 117 transitions, 1375 flow. Second operand 17 states and 118 transitions. [2022-12-06 03:52:21,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 2063 flow [2022-12-06 03:52:21,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 191 transitions, 2003 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:21,438 INFO L231 Difference]: Finished difference. Result has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:21,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1764, PETRI_PLACES=93, PETRI_TRANSITIONS=133} [2022-12-06 03:52:21,438 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-06 03:52:21,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:21,438 INFO L89 Accepts]: Start accepts. Operand has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:21,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:21,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:21,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:21,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:21,454 INFO L130 PetriNetUnfolder]: 91/244 cut-off events. [2022-12-06 03:52:21,454 INFO L131 PetriNetUnfolder]: For 1391/1399 co-relation queries the response was YES. [2022-12-06 03:52:21,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 244 events. 91/244 cut-off events. For 1391/1399 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1338 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1314. Up to 112 conditions per place. [2022-12-06 03:52:21,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:21,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 03:52:21,887 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:52:21,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 450 [2022-12-06 03:52:21,888 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 133 transitions, 1799 flow [2022-12-06 03:52:21,888 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:21,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:21,888 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:21,897 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:22,088 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,SelfDestructingSolverStorable15 [2022-12-06 03:52:22,089 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:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2099725158, now seen corresponding path program 1 times [2022-12-06 03:52:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:22,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246476866] [2022-12-06 03:52:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:22,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:22,278 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:22,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:22,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246476866] [2022-12-06 03:52:22,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246476866] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:22,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659200306] [2022-12-06 03:52:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:22,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:22,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:22,280 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:22,282 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:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:22,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:22,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:22,441 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:22,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:22,764 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:22,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659200306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:22,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:22,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446106033] [2022-12-06 03:52:22,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:22,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:22,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:22,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:22,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 03:52:22,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 133 transitions, 1799 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:22,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:22,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 03:52:22,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:24,503 INFO L130 PetriNetUnfolder]: 766/1357 cut-off events. [2022-12-06 03:52:24,503 INFO L131 PetriNetUnfolder]: For 18043/18043 co-relation queries the response was YES. [2022-12-06 03:52:24,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1357 events. 766/1357 cut-off events. For 18043/18043 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7567 event pairs, 46 based on Foata normal form. 54/1400 useless extension candidates. Maximal degree in co-relation 6410. Up to 427 conditions per place. [2022-12-06 03:52:24,512 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 111 selfloop transitions, 163 changer transitions 0/274 dead transitions. [2022-12-06 03:52:24,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 274 transitions, 3397 flow [2022-12-06 03:52:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:52:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:52:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2022-12-06 03:52:24,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-06 03:52:24,514 INFO L175 Difference]: Start difference. First operand has 93 places, 133 transitions, 1799 flow. Second operand 18 states and 144 transitions. [2022-12-06 03:52:24,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 274 transitions, 3397 flow [2022-12-06 03:52:24,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 274 transitions, 3265 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-06 03:52:24,539 INFO L231 Difference]: Finished difference. Result has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:24,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=109, PETRI_TRANSITIONS=205} [2022-12-06 03:52:24,540 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 91 predicate places. [2022-12-06 03:52:24,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:24,540 INFO L89 Accepts]: Start accepts. Operand has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:24,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:24,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:24,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:24,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:24,575 INFO L130 PetriNetUnfolder]: 133/352 cut-off events. [2022-12-06 03:52:24,576 INFO L131 PetriNetUnfolder]: For 2819/2833 co-relation queries the response was YES. [2022-12-06 03:52:24,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 352 events. 133/352 cut-off events. For 2819/2833 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2094 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 2172. Up to 183 conditions per place. [2022-12-06 03:52:24,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:24,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-06 03:52:24,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:24,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 03:52:24,627 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 205 transitions, 3056 flow [2022-12-06 03:52:24,627 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:24,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:24,627 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:24,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:24,833 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,SelfDestructingSolverStorable16 [2022-12-06 03:52:24,833 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:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1363954805, now seen corresponding path program 1 times [2022-12-06 03:52:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:24,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940281768] [2022-12-06 03:52:24,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:24,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940281768] [2022-12-06 03:52:24,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940281768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:24,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803135896] [2022-12-06 03:52:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:24,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:24,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:24,973 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:24,976 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:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:25,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:25,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:25,129 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:25,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:25,362 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:25,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803135896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:25,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:25,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829427000] [2022-12-06 03:52:25,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:25,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:25,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:25,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:25,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 03:52:25,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 205 transitions, 3056 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:25,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:25,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 03:52:25,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:29,091 INFO L130 PetriNetUnfolder]: 868/1533 cut-off events. [2022-12-06 03:52:29,091 INFO L131 PetriNetUnfolder]: For 18338/18338 co-relation queries the response was YES. [2022-12-06 03:52:29,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 1533 events. 868/1533 cut-off events. For 18338/18338 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8839 event pairs, 95 based on Foata normal form. 22/1536 useless extension candidates. Maximal degree in co-relation 8047. Up to 1000 conditions per place. [2022-12-06 03:52:29,101 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 176 selfloop transitions, 104 changer transitions 2/282 dead transitions. [2022-12-06 03:52:29,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 282 transitions, 4120 flow [2022-12-06 03:52:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 03:52:29,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465437788018433 [2022-12-06 03:52:29,102 INFO L175 Difference]: Start difference. First operand has 109 places, 205 transitions, 3056 flow. Second operand 14 states and 107 transitions. [2022-12-06 03:52:29,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 282 transitions, 4120 flow [2022-12-06 03:52:29,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 282 transitions, 3891 flow, removed 92 selfloop flow, removed 6 redundant places. [2022-12-06 03:52:29,145 INFO L231 Difference]: Finished difference. Result has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:29,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3569, PETRI_PLACES=121, PETRI_TRANSITIONS=234} [2022-12-06 03:52:29,145 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 103 predicate places. [2022-12-06 03:52:29,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:29,145 INFO L89 Accepts]: Start accepts. Operand has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:29,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:29,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:29,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:29,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:29,175 INFO L130 PetriNetUnfolder]: 153/401 cut-off events. [2022-12-06 03:52:29,175 INFO L131 PetriNetUnfolder]: For 2859/2871 co-relation queries the response was YES. [2022-12-06 03:52:29,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 401 events. 153/401 cut-off events. For 2859/2871 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2502 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 2526. Up to 187 conditions per place. [2022-12-06 03:52:29,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:29,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 03:52:29,180 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 [364] L705-6-->L695-5: Formula: (and (= (* 2 v_~next~0_112) (+ (* 34 v_~cur~0_182) (* 21 v_~prev~0_217) (* 3 v_~prev~0_216))) (= (+ (* v_~prev~0_217 13) (* 3 v_~next~0_112) (* 21 v_~cur~0_182)) (* 5 v_~prev~0_216)) (= v_~j~0_207 (+ v_~j~0_209 (* 2 v_~i~0_185))) (< v_~x~0_201 1) (= v_~next~0_112 v_~cur~0_181) (= (+ 2 v_~q~0_128) v_~q~0_126) (= (+ 12 v_~x~0_201) v_~x~0_200) (< v_~q~0_126 6)) InVars {~j~0=v_~j~0_209, ~prev~0=v_~prev~0_217, ~i~0=v_~i~0_185, ~q~0=v_~q~0_128, ~cur~0=v_~cur~0_182, ~x~0=v_~x~0_201} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_123|, ~j~0=v_~j~0_207, ~next~0=v_~next~0_112, ~prev~0=v_~prev~0_216, ~i~0=v_~i~0_185, ~q~0=v_~q~0_126, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_90|, ~cur~0=v_~cur~0_181, ~x~0=v_~x~0_200} 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:29,255 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:29,391 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:29,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-06 03:52:29,392 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 234 transitions, 3562 flow [2022-12-06 03:52:29,392 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:29,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:29,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:29,400 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:29,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:29,592 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:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2101076944, now seen corresponding path program 1 times [2022-12-06 03:52:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:29,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202799821] [2022-12-06 03:52:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:29,715 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,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:29,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202799821] [2022-12-06 03:52:29,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202799821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:29,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967483185] [2022-12-06 03:52:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:29,718 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:29,720 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:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:29,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:29,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:29,878 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,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:30,193 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:30,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967483185] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:30,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:30,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:30,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643339680] [2022-12-06 03:52:30,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:30,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:30,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:30,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:30,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:30,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 03:52:30,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 234 transitions, 3562 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:30,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:30,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 03:52:30,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:32,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:32,676 INFO L130 PetriNetUnfolder]: 1116/1949 cut-off events. [2022-12-06 03:52:32,676 INFO L131 PetriNetUnfolder]: For 25468/25468 co-relation queries the response was YES. [2022-12-06 03:52:32,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 1949 events. 1116/1949 cut-off events. For 25468/25468 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11493 event pairs, 53 based on Foata normal form. 26/1953 useless extension candidates. Maximal degree in co-relation 10634. Up to 566 conditions per place. [2022-12-06 03:52:32,688 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 99 selfloop transitions, 253 changer transitions 0/352 dead transitions. [2022-12-06 03:52:32,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 352 transitions, 5256 flow [2022-12-06 03:52:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:52:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:52:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2022-12-06 03:52:32,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27647058823529413 [2022-12-06 03:52:32,689 INFO L175 Difference]: Start difference. First operand has 121 places, 234 transitions, 3562 flow. Second operand 15 states and 141 transitions. [2022-12-06 03:52:32,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 352 transitions, 5256 flow [2022-12-06 03:52:32,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 352 transitions, 5190 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:32,739 INFO L231 Difference]: Finished difference. Result has 137 places, 281 transitions, 5019 flow [2022-12-06 03:52:32,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3500, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5019, PETRI_PLACES=137, PETRI_TRANSITIONS=281} [2022-12-06 03:52:32,740 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 119 predicate places. [2022-12-06 03:52:32,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:32,740 INFO L89 Accepts]: Start accepts. Operand has 137 places, 281 transitions, 5019 flow [2022-12-06 03:52:32,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:32,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:32,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 281 transitions, 5019 flow [2022-12-06 03:52:32,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 281 transitions, 5019 flow [2022-12-06 03:52:32,779 INFO L130 PetriNetUnfolder]: 184/484 cut-off events. [2022-12-06 03:52:32,779 INFO L131 PetriNetUnfolder]: For 5415/5433 co-relation queries the response was YES. [2022-12-06 03:52:32,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 484 events. 184/484 cut-off events. For 5415/5433 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3129 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 3580. Up to 229 conditions per place. [2022-12-06 03:52:32,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 281 transitions, 5019 flow [2022-12-06 03:52:32,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-06 03:52:32,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:32,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 03:52:32,820 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 281 transitions, 5023 flow [2022-12-06 03:52:32,820 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:32,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:32,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:32,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 03:52:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:33,039 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:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1361980911, now seen corresponding path program 1 times [2022-12-06 03:52:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411001240] [2022-12-06 03:52:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:33,129 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:33,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411001240] [2022-12-06 03:52:33,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411001240] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938203592] [2022-12-06 03:52:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:33,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:33,145 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:33,146 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:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:33,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:33,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:33,283 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:33,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:33,453 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:33,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938203592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:33,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:33,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273357713] [2022-12-06 03:52:33,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:33,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:33,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:33,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:33,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:33,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:33,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 281 transitions, 5023 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:33,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:33,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:33,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:34,395 INFO L130 PetriNetUnfolder]: 1266/2207 cut-off events. [2022-12-06 03:52:34,395 INFO L131 PetriNetUnfolder]: For 39729/39729 co-relation queries the response was YES. [2022-12-06 03:52:34,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13569 conditions, 2207 events. 1266/2207 cut-off events. For 39729/39729 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 13450 event pairs, 135 based on Foata normal form. 30/2215 useless extension candidates. Maximal degree in co-relation 13511. Up to 1395 conditions per place. [2022-12-06 03:52:34,409 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 214 selfloop transitions, 154 changer transitions 0/368 dead transitions. [2022-12-06 03:52:34,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 368 transitions, 6568 flow [2022-12-06 03:52:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-12-06 03:52:34,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23877551020408164 [2022-12-06 03:52:34,410 INFO L175 Difference]: Start difference. First operand has 137 places, 281 transitions, 5023 flow. Second operand 14 states and 117 transitions. [2022-12-06 03:52:34,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 368 transitions, 6568 flow [2022-12-06 03:52:34,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 368 transitions, 6292 flow, removed 63 selfloop flow, removed 8 redundant places. [2022-12-06 03:52:34,509 INFO L231 Difference]: Finished difference. Result has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:34,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4775, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5968, PETRI_PLACES=152, PETRI_TRANSITIONS=319} [2022-12-06 03:52:34,510 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-06 03:52:34,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:34,510 INFO L89 Accepts]: Start accepts. Operand has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:34,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:34,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:34,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:34,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:34,558 INFO L130 PetriNetUnfolder]: 204/533 cut-off events. [2022-12-06 03:52:34,559 INFO L131 PetriNetUnfolder]: For 7198/7214 co-relation queries the response was YES. [2022-12-06 03:52:34,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 533 events. 204/533 cut-off events. For 7198/7214 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3604 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 4182. Up to 247 conditions per place. [2022-12-06 03:52:34,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:34,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-06 03:52:34,566 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:34,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 03:52:34,566 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 319 transitions, 5968 flow [2022-12-06 03:52:34,566 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:34,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:34,567 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:34,571 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,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:34,771 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:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash 550335610, now seen corresponding path program 1 times [2022-12-06 03:52:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:34,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519503459] [2022-12-06 03:52:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:52:34,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:34,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519503459] [2022-12-06 03:52:34,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519503459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:34,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:34,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515248192] [2022-12-06 03:52:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:34,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:34,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:34,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:34,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:34,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:34,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 319 transitions, 5968 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 03:52:34,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:34,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:34,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:35,044 INFO L130 PetriNetUnfolder]: 1218/2117 cut-off events. [2022-12-06 03:52:35,045 INFO L131 PetriNetUnfolder]: For 37589/37589 co-relation queries the response was YES. [2022-12-06 03:52:35,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14373 conditions, 2117 events. 1218/2117 cut-off events. For 37589/37589 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 12641 event pairs, 413 based on Foata normal form. 111/2214 useless extension candidates. Maximal degree in co-relation 14309. Up to 1598 conditions per place. [2022-12-06 03:52:35,057 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 293 selfloop transitions, 45 changer transitions 0/338 dead transitions. [2022-12-06 03:52:35,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 338 transitions, 6916 flow [2022-12-06 03:52:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 03:52:35,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-06 03:52:35,058 INFO L175 Difference]: Start difference. First operand has 152 places, 319 transitions, 5968 flow. Second operand 3 states and 43 transitions. [2022-12-06 03:52:35,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 338 transitions, 6916 flow [2022-12-06 03:52:35,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 338 transitions, 6763 flow, removed 61 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:35,210 INFO L231 Difference]: Finished difference. Result has 152 places, 321 transitions, 5960 flow [2022-12-06 03:52:35,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5648, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5960, PETRI_PLACES=152, PETRI_TRANSITIONS=321} [2022-12-06 03:52:35,210 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-06 03:52:35,210 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:35,210 INFO L89 Accepts]: Start accepts. Operand has 152 places, 321 transitions, 5960 flow [2022-12-06 03:52:35,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:35,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:35,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 321 transitions, 5960 flow [2022-12-06 03:52:35,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 321 transitions, 5960 flow [2022-12-06 03:52:35,256 INFO L130 PetriNetUnfolder]: 199/520 cut-off events. [2022-12-06 03:52:35,256 INFO L131 PetriNetUnfolder]: For 6882/6907 co-relation queries the response was YES. [2022-12-06 03:52:35,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4206 conditions, 520 events. 199/520 cut-off events. For 6882/6907 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3433 event pairs, 0 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 4145. Up to 231 conditions per place. [2022-12-06 03:52:35,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 321 transitions, 5960 flow [2022-12-06 03:52:35,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-06 03:52:35,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:35,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 03:52:35,265 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 321 transitions, 5960 flow [2022-12-06 03:52:35,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 03:52:35,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:35,265 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:35,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 03:52:35,265 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:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 727133362, now seen corresponding path program 2 times [2022-12-06 03:52:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:35,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324299144] [2022-12-06 03:52:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:35,365 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:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:35,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324299144] [2022-12-06 03:52:35,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324299144] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:35,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847762488] [2022-12-06 03:52:35,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:52:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:35,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:35,367 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,383 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,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:52:35,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:52:35,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:52:35,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:35,538 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:35,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:35,933 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:35,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847762488] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:35,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:35,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580108814] [2022-12-06 03:52:35,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:35,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:35,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:35,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 03:52:35,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 321 transitions, 5960 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:35,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:35,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 03:52:35,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:37,170 INFO L130 PetriNetUnfolder]: 1448/2501 cut-off events. [2022-12-06 03:52:37,170 INFO L131 PetriNetUnfolder]: For 51745/51745 co-relation queries the response was YES. [2022-12-06 03:52:37,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17369 conditions, 2501 events. 1448/2501 cut-off events. For 51745/51745 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 15352 event pairs, 110 based on Foata normal form. 18/2505 useless extension candidates. Maximal degree in co-relation 17305. Up to 1218 conditions per place. [2022-12-06 03:52:37,192 INFO L137 encePairwiseOnDemand]: 10/34 looper letters, 209 selfloop transitions, 220 changer transitions 0/429 dead transitions. [2022-12-06 03:52:37,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 429 transitions, 7989 flow [2022-12-06 03:52:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:52:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:52:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2022-12-06 03:52:37,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2549019607843137 [2022-12-06 03:52:37,194 INFO L175 Difference]: Start difference. First operand has 152 places, 321 transitions, 5960 flow. Second operand 15 states and 130 transitions. [2022-12-06 03:52:37,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 429 transitions, 7989 flow [2022-12-06 03:52:37,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 429 transitions, 7944 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:37,395 INFO L231 Difference]: Finished difference. Result has 169 places, 369 transitions, 7439 flow [2022-12-06 03:52:37,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5915, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7439, PETRI_PLACES=169, PETRI_TRANSITIONS=369} [2022-12-06 03:52:37,396 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 151 predicate places. [2022-12-06 03:52:37,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:37,396 INFO L89 Accepts]: Start accepts. Operand has 169 places, 369 transitions, 7439 flow [2022-12-06 03:52:37,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:37,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:37,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 369 transitions, 7439 flow [2022-12-06 03:52:37,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 369 transitions, 7439 flow [2022-12-06 03:52:37,504 INFO L130 PetriNetUnfolder]: 238/618 cut-off events. [2022-12-06 03:52:37,504 INFO L131 PetriNetUnfolder]: For 10923/10965 co-relation queries the response was YES. [2022-12-06 03:52:37,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5434 conditions, 618 events. 238/618 cut-off events. For 10923/10965 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4288 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 5368. Up to 294 conditions per place. [2022-12-06 03:52:37,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 369 transitions, 7439 flow [2022-12-06 03:52:37,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 03:52:37,592 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:37,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 03:52:37,593 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 369 transitions, 7457 flow [2022-12-06 03:52:37,593 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:37,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:37,594 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:37,601 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,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:37,801 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:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash 727310930, now seen corresponding path program 1 times [2022-12-06 03:52:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:37,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109107362] [2022-12-06 03:52:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:37,854 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:37,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:37,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109107362] [2022-12-06 03:52:37,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109107362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:37,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514739295] [2022-12-06 03:52:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:37,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:37,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:37,856 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,871 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:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:37,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:52:37,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:37,948 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:37,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:37,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514739295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:37,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:37,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-06 03:52:37,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342095702] [2022-12-06 03:52:37,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:37,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:52:37,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:37,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:52:37,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:52:37,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 03:52:37,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 369 transitions, 7457 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:37,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:37,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 03:52:37,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:38,394 INFO L130 PetriNetUnfolder]: 1558/2651 cut-off events. [2022-12-06 03:52:38,395 INFO L131 PetriNetUnfolder]: For 65689/65689 co-relation queries the response was YES. [2022-12-06 03:52:38,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19923 conditions, 2651 events. 1558/2651 cut-off events. For 65689/65689 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 16344 event pairs, 408 based on Foata normal form. 17/2660 useless extension candidates. Maximal degree in co-relation 19854. Up to 1416 conditions per place. [2022-12-06 03:52:38,414 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 535 selfloop transitions, 9 changer transitions 1/545 dead transitions. [2022-12-06 03:52:38,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 545 transitions, 12170 flow [2022-12-06 03:52:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:52:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:52:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 03:52:38,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 03:52:38,415 INFO L175 Difference]: Start difference. First operand has 169 places, 369 transitions, 7457 flow. Second operand 5 states and 54 transitions. [2022-12-06 03:52:38,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 545 transitions, 12170 flow [2022-12-06 03:52:38,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 545 transitions, 11878 flow, removed 113 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:38,671 INFO L231 Difference]: Finished difference. Result has 170 places, 361 transitions, 7122 flow [2022-12-06 03:52:38,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7086, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7122, PETRI_PLACES=170, PETRI_TRANSITIONS=361} [2022-12-06 03:52:38,672 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 152 predicate places. [2022-12-06 03:52:38,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:38,672 INFO L89 Accepts]: Start accepts. Operand has 170 places, 361 transitions, 7122 flow [2022-12-06 03:52:38,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:38,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:38,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 361 transitions, 7122 flow [2022-12-06 03:52:38,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 361 transitions, 7122 flow [2022-12-06 03:52:38,737 INFO L130 PetriNetUnfolder]: 248/648 cut-off events. [2022-12-06 03:52:38,737 INFO L131 PetriNetUnfolder]: For 13668/13715 co-relation queries the response was YES. [2022-12-06 03:52:38,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5784 conditions, 648 events. 248/648 cut-off events. For 13668/13715 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 4604 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 5718. Up to 304 conditions per place. [2022-12-06 03:52:38,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 361 transitions, 7122 flow [2022-12-06 03:52:38,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-06 03:52:38,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:38,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 03:52:38,746 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 361 transitions, 7122 flow [2022-12-06 03:52:38,747 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,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:38,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:38,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:38,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:38,948 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:38,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 729283863, now seen corresponding path program 1 times [2022-12-06 03:52:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:38,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674828686] [2022-12-06 03:52:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:38,991 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:52:38,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:38,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674828686] [2022-12-06 03:52:38,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674828686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:38,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277027725] [2022-12-06 03:52:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:38,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:38,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:39,009 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,011 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,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:39,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:52:39,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:39,081 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:52:39,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:39,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277027725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:39,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:39,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-06 03:52:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869230624] [2022-12-06 03:52:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:39,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:52:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:39,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:52:39,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:52:39,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 03:52:39,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 361 transitions, 7122 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:39,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:39,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 03:52:39,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:39,499 INFO L130 PetriNetUnfolder]: 1606/2725 cut-off events. [2022-12-06 03:52:39,499 INFO L131 PetriNetUnfolder]: For 74472/74472 co-relation queries the response was YES. [2022-12-06 03:52:39,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20933 conditions, 2725 events. 1606/2725 cut-off events. For 74472/74472 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 16790 event pairs, 381 based on Foata normal form. 21/2732 useless extension candidates. Maximal degree in co-relation 20864. Up to 1142 conditions per place. [2022-12-06 03:52:39,539 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 532 selfloop transitions, 14 changer transitions 1/547 dead transitions. [2022-12-06 03:52:39,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 547 transitions, 11897 flow [2022-12-06 03:52:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:52:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:52:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 03:52:39,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 03:52:39,540 INFO L175 Difference]: Start difference. First operand has 170 places, 361 transitions, 7122 flow. Second operand 5 states and 54 transitions. [2022-12-06 03:52:39,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 547 transitions, 11897 flow [2022-12-06 03:52:39,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 547 transitions, 11892 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:39,858 INFO L231 Difference]: Finished difference. Result has 175 places, 364 transitions, 7194 flow [2022-12-06 03:52:39,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7119, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7194, PETRI_PLACES=175, PETRI_TRANSITIONS=364} [2022-12-06 03:52:39,859 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 157 predicate places. [2022-12-06 03:52:39,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:39,859 INFO L89 Accepts]: Start accepts. Operand has 175 places, 364 transitions, 7194 flow [2022-12-06 03:52:39,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:39,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:39,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 364 transitions, 7194 flow [2022-12-06 03:52:39,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 364 transitions, 7194 flow [2022-12-06 03:52:39,964 INFO L130 PetriNetUnfolder]: 257/675 cut-off events. [2022-12-06 03:52:39,964 INFO L131 PetriNetUnfolder]: For 17135/17184 co-relation queries the response was YES. [2022-12-06 03:52:39,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6256 conditions, 675 events. 257/675 cut-off events. For 17135/17184 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4793 event pairs, 0 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 6187. Up to 319 conditions per place. [2022-12-06 03:52:39,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 364 transitions, 7194 flow [2022-12-06 03:52:39,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 1196 [2022-12-06 03:52:39,978 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:39,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 03:52:39,979 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 364 transitions, 7194 flow [2022-12-06 03:52:39,979 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:39,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:39,979 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:39,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 03:52:40,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:40,184 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:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash -173314828, now seen corresponding path program 1 times [2022-12-06 03:52:40,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:40,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498027171] [2022-12-06 03:52:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:40,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:40,355 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:40,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:40,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498027171] [2022-12-06 03:52:40,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498027171] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:40,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425315871] [2022-12-06 03:52:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:40,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:40,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:40,357 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,358 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,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:40,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:52:40,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:40,519 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:40,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:40,751 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:40,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425315871] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:40,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:40,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435029902] [2022-12-06 03:52:40,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:40,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:40,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:40,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:40,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:40,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 03:52:40,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 364 transitions, 7194 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:40,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:40,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 03:52:40,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:45,444 INFO L130 PetriNetUnfolder]: 1678/2879 cut-off events. [2022-12-06 03:52:45,445 INFO L131 PetriNetUnfolder]: For 105149/105149 co-relation queries the response was YES. [2022-12-06 03:52:45,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22830 conditions, 2879 events. 1678/2879 cut-off events. For 105149/105149 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 17919 event pairs, 216 based on Foata normal form. 54/2925 useless extension candidates. Maximal degree in co-relation 22758. Up to 2060 conditions per place. [2022-12-06 03:52:45,463 INFO L137 encePairwiseOnDemand]: 9/36 looper letters, 295 selfloop transitions, 188 changer transitions 5/488 dead transitions. [2022-12-06 03:52:45,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 488 transitions, 9551 flow [2022-12-06 03:52:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:52:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:52:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 144 transitions. [2022-12-06 03:52:45,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2022-12-06 03:52:45,464 INFO L175 Difference]: Start difference. First operand has 175 places, 364 transitions, 7194 flow. Second operand 22 states and 144 transitions. [2022-12-06 03:52:45,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 488 transitions, 9551 flow [2022-12-06 03:52:45,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 488 transitions, 9550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:45,675 INFO L231 Difference]: Finished difference. Result has 200 places, 408 transitions, 8758 flow [2022-12-06 03:52:45,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7193, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8758, PETRI_PLACES=200, PETRI_TRANSITIONS=408} [2022-12-06 03:52:45,675 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 182 predicate places. [2022-12-06 03:52:45,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:45,675 INFO L89 Accepts]: Start accepts. Operand has 200 places, 408 transitions, 8758 flow [2022-12-06 03:52:45,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:45,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:45,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 408 transitions, 8758 flow [2022-12-06 03:52:45,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 408 transitions, 8758 flow [2022-12-06 03:52:45,757 INFO L130 PetriNetUnfolder]: 275/735 cut-off events. [2022-12-06 03:52:45,757 INFO L131 PetriNetUnfolder]: For 20029/20089 co-relation queries the response was YES. [2022-12-06 03:52:45,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7177 conditions, 735 events. 275/735 cut-off events. For 20029/20089 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5369 event pairs, 0 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 7102. Up to 361 conditions per place. [2022-12-06 03:52:45,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 408 transitions, 8758 flow [2022-12-06 03:52:45,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 1286 [2022-12-06 03:52:45,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:45,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 03:52:45,802 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 408 transitions, 8764 flow [2022-12-06 03:52:45,802 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:45,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:45,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:45,807 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:46,006 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,SelfDestructingSolverStorable24 [2022-12-06 03:52:46,006 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:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash -110478882, now seen corresponding path program 1 times [2022-12-06 03:52:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:46,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257917974] [2022-12-06 03:52:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:46,131 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,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:46,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257917974] [2022-12-06 03:52:46,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257917974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049565622] [2022-12-06 03:52:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:46,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:46,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:46,147 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:46,201 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:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:46,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:46,381 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,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:46,661 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,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049565622] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:46,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:46,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925956091] [2022-12-06 03:52:46,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:46,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:46,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:46,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:52:46,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 408 transitions, 8764 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,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:46,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:52:46,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:48,208 INFO L130 PetriNetUnfolder]: 1808/3131 cut-off events. [2022-12-06 03:52:48,209 INFO L131 PetriNetUnfolder]: For 136365/136365 co-relation queries the response was YES. [2022-12-06 03:52:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26436 conditions, 3131 events. 1808/3131 cut-off events. For 136365/136365 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 20041 event pairs, 203 based on Foata normal form. 44/3167 useless extension candidates. Maximal degree in co-relation 26358. Up to 1864 conditions per place. [2022-12-06 03:52:48,229 INFO L137 encePairwiseOnDemand]: 10/37 looper letters, 298 selfloop transitions, 254 changer transitions 2/554 dead transitions. [2022-12-06 03:52:48,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 554 transitions, 11723 flow [2022-12-06 03:52:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:52:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:52:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2022-12-06 03:52:48,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19047619047619047 [2022-12-06 03:52:48,230 INFO L175 Difference]: Start difference. First operand has 200 places, 408 transitions, 8764 flow. Second operand 21 states and 148 transitions. [2022-12-06 03:52:48,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 554 transitions, 11723 flow [2022-12-06 03:52:48,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 554 transitions, 11495 flow, removed 84 selfloop flow, removed 8 redundant places. [2022-12-06 03:52:48,500 INFO L231 Difference]: Finished difference. Result has 221 places, 457 transitions, 10569 flow [2022-12-06 03:52:48,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8548, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=10569, PETRI_PLACES=221, PETRI_TRANSITIONS=457} [2022-12-06 03:52:48,500 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 203 predicate places. [2022-12-06 03:52:48,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:48,501 INFO L89 Accepts]: Start accepts. Operand has 221 places, 457 transitions, 10569 flow [2022-12-06 03:52:48,502 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:48,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:48,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 457 transitions, 10569 flow [2022-12-06 03:52:48,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 457 transitions, 10569 flow [2022-12-06 03:52:48,604 INFO L130 PetriNetUnfolder]: 311/813 cut-off events. [2022-12-06 03:52:48,605 INFO L131 PetriNetUnfolder]: For 28230/28301 co-relation queries the response was YES. [2022-12-06 03:52:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8591 conditions, 813 events. 311/813 cut-off events. For 28230/28301 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 5986 event pairs, 0 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 8505. Up to 417 conditions per place. [2022-12-06 03:52:48,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 457 transitions, 10569 flow [2022-12-06 03:52:48,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 1400 [2022-12-06 03:52:48,618 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:52:48,659 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:52:48,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:48,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 03:52:48,703 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 457 transitions, 10593 flow [2022-12-06 03:52:48,703 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:48,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:48,704 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:48,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:48,904 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,SelfDestructingSolverStorable25 [2022-12-06 03:52:48,904 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:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -132900934, now seen corresponding path program 1 times [2022-12-06 03:52:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:48,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943620269] [2022-12-06 03:52:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:49,059 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:49,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:49,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943620269] [2022-12-06 03:52:49,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943620269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:49,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002975787] [2022-12-06 03:52:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:49,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:49,063 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:49,064 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:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:49,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:52:49,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:49,231 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:49,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:49,428 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:49,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002975787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:49,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:49,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368276648] [2022-12-06 03:52:49,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:49,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:49,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:52:49,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 457 transitions, 10593 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:49,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:49,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:52:49,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:51,312 INFO L130 PetriNetUnfolder]: 1888/3297 cut-off events. [2022-12-06 03:52:51,312 INFO L131 PetriNetUnfolder]: For 166945/166945 co-relation queries the response was YES. [2022-12-06 03:52:51,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29403 conditions, 3297 events. 1888/3297 cut-off events. For 166945/166945 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 21630 event pairs, 294 based on Foata normal form. 44/3333 useless extension candidates. Maximal degree in co-relation 29314. Up to 2336 conditions per place. [2022-12-06 03:52:51,336 INFO L137 encePairwiseOnDemand]: 9/39 looper letters, 346 selfloop transitions, 218 changer transitions 3/567 dead transitions. [2022-12-06 03:52:51,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 567 transitions, 13218 flow [2022-12-06 03:52:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:52:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:52:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 124 transitions. [2022-12-06 03:52:51,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17663817663817663 [2022-12-06 03:52:51,338 INFO L175 Difference]: Start difference. First operand has 221 places, 457 transitions, 10593 flow. Second operand 18 states and 124 transitions. [2022-12-06 03:52:51,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 567 transitions, 13218 flow [2022-12-06 03:52:51,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 567 transitions, 12928 flow, removed 106 selfloop flow, removed 7 redundant places. [2022-12-06 03:52:51,742 INFO L231 Difference]: Finished difference. Result has 236 places, 497 transitions, 12141 flow [2022-12-06 03:52:51,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10309, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=12141, PETRI_PLACES=236, PETRI_TRANSITIONS=497} [2022-12-06 03:52:51,742 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 218 predicate places. [2022-12-06 03:52:51,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:51,743 INFO L89 Accepts]: Start accepts. Operand has 236 places, 497 transitions, 12141 flow [2022-12-06 03:52:51,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:51,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:51,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 497 transitions, 12141 flow [2022-12-06 03:52:51,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 497 transitions, 12141 flow [2022-12-06 03:52:51,867 INFO L130 PetriNetUnfolder]: 330/877 cut-off events. [2022-12-06 03:52:51,867 INFO L131 PetriNetUnfolder]: For 31330/31420 co-relation queries the response was YES. [2022-12-06 03:52:51,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9588 conditions, 877 events. 330/877 cut-off events. For 31330/31420 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6705 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 9497. Up to 450 conditions per place. [2022-12-06 03:52:51,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 497 transitions, 12141 flow [2022-12-06 03:52:51,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 1486 [2022-12-06 03:52:51,881 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:51,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 03:52:51,881 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 497 transitions, 12141 flow [2022-12-06 03:52:51,881 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:51,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:51,881 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:51,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:52,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 03:52:52,086 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:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1134601301, now seen corresponding path program 1 times [2022-12-06 03:52:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:52,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266799577] [2022-12-06 03:52:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:52,131 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:52:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:52,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266799577] [2022-12-06 03:52:52,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266799577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:52,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703676945] [2022-12-06 03:52:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:52,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:52,133 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:52,134 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:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:52,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:52:52,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:52,206 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:52:52,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:52:52,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703676945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:52,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:52:52,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 03:52:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194446621] [2022-12-06 03:52:52,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:52,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:52:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:52,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:52:52,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:52:52,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:52:52,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 497 transitions, 12141 flow. Second operand has 7 states, 7 states have (on average 1.7142857142857142) 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:52:52,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:52,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:52:52,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:52,872 INFO L130 PetriNetUnfolder]: 2010/3479 cut-off events. [2022-12-06 03:52:52,872 INFO L131 PetriNetUnfolder]: For 143767/143767 co-relation queries the response was YES. [2022-12-06 03:52:52,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31617 conditions, 3479 events. 2010/3479 cut-off events. For 143767/143767 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 23311 event pairs, 390 based on Foata normal form. 81/3552 useless extension candidates. Maximal degree in co-relation 31523. Up to 1645 conditions per place. [2022-12-06 03:52:52,970 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 672 selfloop transitions, 120 changer transitions 2/794 dead transitions. [2022-12-06 03:52:52,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 794 transitions, 21198 flow [2022-12-06 03:52:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:52:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:52:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-06 03:52:52,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27472527472527475 [2022-12-06 03:52:52,971 INFO L175 Difference]: Start difference. First operand has 235 places, 497 transitions, 12141 flow. Second operand 7 states and 75 transitions. [2022-12-06 03:52:52,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 794 transitions, 21198 flow [2022-12-06 03:52:53,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 794 transitions, 20707 flow, removed 210 selfloop flow, removed 6 redundant places. [2022-12-06 03:52:53,442 INFO L231 Difference]: Finished difference. Result has 238 places, 527 transitions, 13158 flow [2022-12-06 03:52:53,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11389, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13158, PETRI_PLACES=238, PETRI_TRANSITIONS=527} [2022-12-06 03:52:53,442 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 220 predicate places. [2022-12-06 03:52:53,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:53,443 INFO L89 Accepts]: Start accepts. Operand has 238 places, 527 transitions, 13158 flow [2022-12-06 03:52:53,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:53,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:53,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 527 transitions, 13158 flow [2022-12-06 03:52:53,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 527 transitions, 13158 flow [2022-12-06 03:52:53,585 INFO L130 PetriNetUnfolder]: 359/966 cut-off events. [2022-12-06 03:52:53,586 INFO L131 PetriNetUnfolder]: For 38140/38245 co-relation queries the response was YES. [2022-12-06 03:52:53,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10761 conditions, 966 events. 359/966 cut-off events. For 38140/38245 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 7721 event pairs, 0 based on Foata normal form. 1/965 useless extension candidates. Maximal degree in co-relation 10666. Up to 506 conditions per place. [2022-12-06 03:52:53,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 527 transitions, 13158 flow [2022-12-06 03:52:53,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 1656 [2022-12-06 03:52:53,601 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:53,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 03:52:53,602 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 527 transitions, 13158 flow [2022-12-06 03:52:53,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) 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:52:53,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:53,602 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:53,607 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:53,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:53,806 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:52:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:53,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1763697517, now seen corresponding path program 1 times [2022-12-06 03:52:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:53,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872569671] [2022-12-06 03:52:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:53,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:53,964 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:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:53,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872569671] [2022-12-06 03:52:53,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872569671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:53,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567360362] [2022-12-06 03:52:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:53,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:53,981 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:53,982 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:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:54,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:52:54,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:54,194 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:54,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:54,611 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:54,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567360362] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:54,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:54,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:52:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998985449] [2022-12-06 03:52:54,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:54,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:52:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:52:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:52:54,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:52:54,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 527 transitions, 13158 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:54,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:54,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:52:54,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:59,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:01,955 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:03,769 INFO L130 PetriNetUnfolder]: 2566/4419 cut-off events. [2022-12-06 03:53:03,769 INFO L131 PetriNetUnfolder]: For 260610/260610 co-relation queries the response was YES. [2022-12-06 03:53:03,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42335 conditions, 4419 events. 2566/4419 cut-off events. For 260610/260610 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 30265 event pairs, 141 based on Foata normal form. 54/4465 useless extension candidates. Maximal degree in co-relation 42237. Up to 1904 conditions per place. [2022-12-06 03:53:03,804 INFO L137 encePairwiseOnDemand]: 8/39 looper letters, 338 selfloop transitions, 505 changer transitions 4/847 dead transitions. [2022-12-06 03:53:03,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 847 transitions, 20505 flow [2022-12-06 03:53:03,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:53:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:53:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 224 transitions. [2022-12-06 03:53:03,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1794871794871795 [2022-12-06 03:53:03,808 INFO L175 Difference]: Start difference. First operand has 238 places, 527 transitions, 13158 flow. Second operand 32 states and 224 transitions. [2022-12-06 03:53:03,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 847 transitions, 20505 flow [2022-12-06 03:53:04,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 847 transitions, 19807 flow, removed 332 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:04,631 INFO L231 Difference]: Finished difference. Result has 282 places, 681 transitions, 18461 flow [2022-12-06 03:53:04,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=12695, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=18461, PETRI_PLACES=282, PETRI_TRANSITIONS=681} [2022-12-06 03:53:04,631 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 264 predicate places. [2022-12-06 03:53:04,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:04,631 INFO L89 Accepts]: Start accepts. Operand has 282 places, 681 transitions, 18461 flow [2022-12-06 03:53:04,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:04,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:04,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 681 transitions, 18461 flow [2022-12-06 03:53:04,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 681 transitions, 18461 flow [2022-12-06 03:53:04,845 INFO L130 PetriNetUnfolder]: 462/1222 cut-off events. [2022-12-06 03:53:04,846 INFO L131 PetriNetUnfolder]: For 66281/66363 co-relation queries the response was YES. [2022-12-06 03:53:04,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14912 conditions, 1222 events. 462/1222 cut-off events. For 66281/66363 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 10113 event pairs, 0 based on Foata normal form. 1/1221 useless extension candidates. Maximal degree in co-relation 14802. Up to 683 conditions per place. [2022-12-06 03:53:04,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 681 transitions, 18461 flow [2022-12-06 03:53:04,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 2084 [2022-12-06 03:53:04,866 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:04,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 03:53:04,867 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 681 transitions, 18461 flow [2022-12-06 03:53:04,867 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:04,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:04,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:04,871 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:53:05,071 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,SelfDestructingSolverStorable28 [2022-12-06 03:53:05,071 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:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash 349274853, now seen corresponding path program 1 times [2022-12-06 03:53:05,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140348999] [2022-12-06 03:53:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:05,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:05,099 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:53:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:05,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140348999] [2022-12-06 03:53:05,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140348999] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:05,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228936907] [2022-12-06 03:53:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:05,101 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:53:05,102 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:53:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:05,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:53:05,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:05,180 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:53:05,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:05,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228936907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:05,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:05,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-06 03:53:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574026137] [2022-12-06 03:53:05,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:05,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:53:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:05,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:53:05,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:53:05,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:53:05,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 681 transitions, 18461 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:05,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:05,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:53:05,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:06,456 INFO L130 PetriNetUnfolder]: 2713/4593 cut-off events. [2022-12-06 03:53:06,457 INFO L131 PetriNetUnfolder]: For 306344/306344 co-relation queries the response was YES. [2022-12-06 03:53:06,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48482 conditions, 4593 events. 2713/4593 cut-off events. For 306344/306344 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 31913 event pairs, 430 based on Foata normal form. 8/4593 useless extension candidates. Maximal degree in co-relation 48369. Up to 2399 conditions per place. [2022-12-06 03:53:06,503 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 994 selfloop transitions, 10 changer transitions 75/1079 dead transitions. [2022-12-06 03:53:06,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1079 transitions, 31985 flow [2022-12-06 03:53:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:53:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:53:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 03:53:06,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37435897435897436 [2022-12-06 03:53:06,504 INFO L175 Difference]: Start difference. First operand has 282 places, 681 transitions, 18461 flow. Second operand 5 states and 73 transitions. [2022-12-06 03:53:06,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 1079 transitions, 31985 flow [2022-12-06 03:53:07,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 1079 transitions, 28909 flow, removed 1422 selfloop flow, removed 8 redundant places. [2022-12-06 03:53:07,554 INFO L231 Difference]: Finished difference. Result has 278 places, 667 transitions, 16385 flow [2022-12-06 03:53:07,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=16359, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16385, PETRI_PLACES=278, PETRI_TRANSITIONS=667} [2022-12-06 03:53:07,555 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 260 predicate places. [2022-12-06 03:53:07,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:07,555 INFO L89 Accepts]: Start accepts. Operand has 278 places, 667 transitions, 16385 flow [2022-12-06 03:53:07,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:07,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:07,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 667 transitions, 16385 flow [2022-12-06 03:53:07,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 667 transitions, 16385 flow [2022-12-06 03:53:07,832 INFO L130 PetriNetUnfolder]: 513/1314 cut-off events. [2022-12-06 03:53:07,833 INFO L131 PetriNetUnfolder]: For 86247/86369 co-relation queries the response was YES. [2022-12-06 03:53:07,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15566 conditions, 1314 events. 513/1314 cut-off events. For 86247/86369 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 10809 event pairs, 2 based on Foata normal form. 1/1313 useless extension candidates. Maximal degree in co-relation 15457. Up to 729 conditions per place. [2022-12-06 03:53:07,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 667 transitions, 16385 flow [2022-12-06 03:53:07,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 2100 [2022-12-06 03:53:07,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:53:07,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-06 03:53:07,917 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 667 transitions, 16394 flow [2022-12-06 03:53:07,917 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:07,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:07,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:07,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-06 03:53:08,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:08,121 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:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 347219832, now seen corresponding path program 1 times [2022-12-06 03:53:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:08,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47633998] [2022-12-06 03:53:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:08,289 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:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:08,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47633998] [2022-12-06 03:53:08,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47633998] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:08,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243373992] [2022-12-06 03:53:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:08,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:08,290 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:53:08,303 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:53:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:08,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:53:08,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:08,530 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:08,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:08,895 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:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243373992] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:08,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801061709] [2022-12-06 03:53:08,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:08,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:08,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:08,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 03:53:08,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 667 transitions, 16394 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:08,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:08,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 03:53:08,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:14,107 INFO L130 PetriNetUnfolder]: 3380/5693 cut-off events. [2022-12-06 03:53:14,108 INFO L131 PetriNetUnfolder]: For 555657/555657 co-relation queries the response was YES. [2022-12-06 03:53:14,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58488 conditions, 5693 events. 3380/5693 cut-off events. For 555657/555657 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 39150 event pairs, 267 based on Foata normal form. 104/5793 useless extension candidates. Maximal degree in co-relation 58376. Up to 2830 conditions per place. [2022-12-06 03:53:14,199 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 419 selfloop transitions, 555 changer transitions 8/982 dead transitions. [2022-12-06 03:53:14,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 982 transitions, 23705 flow [2022-12-06 03:53:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:53:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:53:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 206 transitions. [2022-12-06 03:53:14,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16940789473684212 [2022-12-06 03:53:14,207 INFO L175 Difference]: Start difference. First operand has 278 places, 667 transitions, 16394 flow. Second operand 32 states and 206 transitions. [2022-12-06 03:53:14,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 982 transitions, 23705 flow [2022-12-06 03:53:15,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 982 transitions, 23702 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 03:53:15,860 INFO L231 Difference]: Finished difference. Result has 321 places, 819 transitions, 22373 flow [2022-12-06 03:53:15,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16391, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=431, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=22373, PETRI_PLACES=321, PETRI_TRANSITIONS=819} [2022-12-06 03:53:15,861 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 303 predicate places. [2022-12-06 03:53:15,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:15,862 INFO L89 Accepts]: Start accepts. Operand has 321 places, 819 transitions, 22373 flow [2022-12-06 03:53:15,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:15,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:15,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 819 transitions, 22373 flow [2022-12-06 03:53:15,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 819 transitions, 22373 flow [2022-12-06 03:53:16,396 INFO L130 PetriNetUnfolder]: 654/1639 cut-off events. [2022-12-06 03:53:16,396 INFO L131 PetriNetUnfolder]: For 143141/143329 co-relation queries the response was YES. [2022-12-06 03:53:16,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21795 conditions, 1639 events. 654/1639 cut-off events. For 143141/143329 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 13872 event pairs, 2 based on Foata normal form. 2/1639 useless extension candidates. Maximal degree in co-relation 21672. Up to 957 conditions per place. [2022-12-06 03:53:16,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 819 transitions, 22373 flow [2022-12-06 03:53:16,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 2540 [2022-12-06 03:53:16,564 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:16,607 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:16,653 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 [381] L705-6-->L687-5: Formula: (and (= (* 5 v_~prev~0_260) (+ (* v_~prev~0_261 13) (* 21 v_~cur~0_216) (* 3 v_~next~0_134))) (< v_~x~0_245 1) (= v_~next~0_134 v_~cur~0_215) (= v_~p~0_164 (+ v_~p~0_165 1)) (= (* 2 v_~next~0_134) (+ (* 3 v_~prev~0_260) (* 34 v_~cur~0_216) (* 21 v_~prev~0_261))) (< v_~p~0_165 5) (= (+ 12 v_~x~0_245) v_~x~0_244) (= (+ v_~j~0_311 v_~i~0_280) v_~i~0_279)) InVars {~j~0=v_~j~0_311, ~prev~0=v_~prev~0_261, ~i~0=v_~i~0_280, ~p~0=v_~p~0_165, ~cur~0=v_~cur~0_216, ~x~0=v_~x~0_245} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_155|, ~j~0=v_~j~0_311, ~next~0=v_~next~0_134, ~prev~0=v_~prev~0_260, ~i~0=v_~i~0_279, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_123|, ~p~0=v_~p~0_164, ~cur~0=v_~cur~0_215, ~x~0=v_~x~0_244} 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:53:16,922 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 03:53:16,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1067 [2022-12-06 03:53:16,929 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 819 transitions, 22433 flow [2022-12-06 03:53:16,929 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:16,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:16,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:16,940 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:17,134 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,SelfDestructingSolverStorable30 [2022-12-06 03:53:17,135 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:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash 67778637, now seen corresponding path program 1 times [2022-12-06 03:53:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:17,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248740092] [2022-12-06 03:53:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:17,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:17,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248740092] [2022-12-06 03:53:17,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248740092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:17,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231382394] [2022-12-06 03:53:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:17,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:17,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:17,184 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:17,186 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:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:17,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:53:17,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:17,262 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:53:17,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:17,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231382394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:17,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:17,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-06 03:53:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519348096] [2022-12-06 03:53:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:17,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:53:17,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:17,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:53:17,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:53:17,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 03:53:17,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 819 transitions, 22433 flow. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 03:53:17,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:17,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 03:53:17,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:19,450 INFO L130 PetriNetUnfolder]: 3431/5759 cut-off events. [2022-12-06 03:53:19,451 INFO L131 PetriNetUnfolder]: For 497118/497118 co-relation queries the response was YES. [2022-12-06 03:53:19,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64362 conditions, 5759 events. 3431/5759 cut-off events. For 497118/497118 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 41407 event pairs, 563 based on Foata normal form. 4/5761 useless extension candidates. Maximal degree in co-relation 64236. Up to 3195 conditions per place. [2022-12-06 03:53:19,513 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 1225 selfloop transitions, 14 changer transitions 76/1315 dead transitions. [2022-12-06 03:53:19,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1315 transitions, 39099 flow [2022-12-06 03:53:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:53:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:53:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 03:53:19,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2022-12-06 03:53:19,514 INFO L175 Difference]: Start difference. First operand has 321 places, 819 transitions, 22433 flow. Second operand 5 states and 79 transitions. [2022-12-06 03:53:19,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1315 transitions, 39099 flow [2022-12-06 03:53:21,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 1315 transitions, 36598 flow, removed 1183 selfloop flow, removed 9 redundant places. [2022-12-06 03:53:21,287 INFO L231 Difference]: Finished difference. Result has 316 places, 815 transitions, 20822 flow [2022-12-06 03:53:21,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=20788, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20822, PETRI_PLACES=316, PETRI_TRANSITIONS=815} [2022-12-06 03:53:21,288 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 298 predicate places. [2022-12-06 03:53:21,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:21,288 INFO L89 Accepts]: Start accepts. Operand has 316 places, 815 transitions, 20822 flow [2022-12-06 03:53:21,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:21,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:21,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 815 transitions, 20822 flow [2022-12-06 03:53:21,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 815 transitions, 20822 flow [2022-12-06 03:53:21,641 INFO L130 PetriNetUnfolder]: 669/1671 cut-off events. [2022-12-06 03:53:21,641 INFO L131 PetriNetUnfolder]: For 149487/149651 co-relation queries the response was YES. [2022-12-06 03:53:21,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21524 conditions, 1671 events. 669/1671 cut-off events. For 149487/149651 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 14107 event pairs, 4 based on Foata normal form. 1/1667 useless extension candidates. Maximal degree in co-relation 21401. Up to 871 conditions per place. [2022-12-06 03:53:21,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 315 places, 815 transitions, 20822 flow [2022-12-06 03:53:21,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 2556 [2022-12-06 03:53:21,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:21,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-06 03:53:21,675 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 815 transitions, 20822 flow [2022-12-06 03:53:21,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 03:53:21,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:21,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:21,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-06 03:53:21,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:21,880 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:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -110366445, now seen corresponding path program 1 times [2022-12-06 03:53:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093197086] [2022-12-06 03:53:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:21,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093197086] [2022-12-06 03:53:21,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093197086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:21,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825142690] [2022-12-06 03:53:21,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:21,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:21,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:21,984 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:21,985 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:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:22,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:53:22,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:22,150 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:53:22,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:22,368 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:53:22,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825142690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:22,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:22,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715248125] [2022-12-06 03:53:22,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:22,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 03:53:22,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 815 transitions, 20822 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:53:22,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:22,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 03:53:22,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:25,076 INFO L130 PetriNetUnfolder]: 3478/5877 cut-off events. [2022-12-06 03:53:25,076 INFO L131 PetriNetUnfolder]: For 554437/554437 co-relation queries the response was YES. [2022-12-06 03:53:25,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63505 conditions, 5877 events. 3478/5877 cut-off events. For 554437/554437 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 40896 event pairs, 577 based on Foata normal form. 47/5922 useless extension candidates. Maximal degree in co-relation 63379. Up to 4763 conditions per place. [2022-12-06 03:53:25,144 INFO L137 encePairwiseOnDemand]: 10/42 looper letters, 690 selfloop transitions, 250 changer transitions 14/954 dead transitions. [2022-12-06 03:53:25,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 954 transitions, 24468 flow [2022-12-06 03:53:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:53:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:53:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 138 transitions. [2022-12-06 03:53:25,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16428571428571428 [2022-12-06 03:53:25,145 INFO L175 Difference]: Start difference. First operand has 315 places, 815 transitions, 20822 flow. Second operand 20 states and 138 transitions. [2022-12-06 03:53:25,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 954 transitions, 24468 flow [2022-12-06 03:53:27,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 954 transitions, 24183 flow, removed 129 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:27,253 INFO L231 Difference]: Finished difference. Result has 336 places, 844 transitions, 22154 flow [2022-12-06 03:53:27,254 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=20575, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=22154, PETRI_PLACES=336, PETRI_TRANSITIONS=844} [2022-12-06 03:53:27,254 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 318 predicate places. [2022-12-06 03:53:27,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:27,254 INFO L89 Accepts]: Start accepts. Operand has 336 places, 844 transitions, 22154 flow [2022-12-06 03:53:27,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:27,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:27,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 844 transitions, 22154 flow [2022-12-06 03:53:27,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 844 transitions, 22154 flow [2022-12-06 03:53:27,588 INFO L130 PetriNetUnfolder]: 678/1719 cut-off events. [2022-12-06 03:53:27,588 INFO L131 PetriNetUnfolder]: For 162487/162656 co-relation queries the response was YES. [2022-12-06 03:53:27,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22451 conditions, 1719 events. 678/1719 cut-off events. For 162487/162656 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 14836 event pairs, 4 based on Foata normal form. 1/1715 useless extension candidates. Maximal degree in co-relation 22323. Up to 901 conditions per place. [2022-12-06 03:53:27,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 844 transitions, 22154 flow [2022-12-06 03:53:27,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 2614 [2022-12-06 03:53:27,622 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:27,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-06 03:53:27,622 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 844 transitions, 22154 flow [2022-12-06 03:53:27,622 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:53:27,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:27,622 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:27,627 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:27,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:27,827 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:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash -110200192, now seen corresponding path program 1 times [2022-12-06 03:53:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:27,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651546916] [2022-12-06 03:53:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:27,939 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:53:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:27,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651546916] [2022-12-06 03:53:27,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651546916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:27,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111710340] [2022-12-06 03:53:27,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:27,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:27,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:27,940 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:27,942 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:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:28,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:53:28,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:28,112 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:53:28,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:28,365 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:53:28,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111710340] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:28,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:28,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:28,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925637422] [2022-12-06 03:53:28,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:28,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:28,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:28,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:28,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 03:53:28,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 844 transitions, 22154 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:53:28,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:28,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 03:53:28,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:31,697 INFO L130 PetriNetUnfolder]: 3565/6052 cut-off events. [2022-12-06 03:53:31,697 INFO L131 PetriNetUnfolder]: For 589941/589941 co-relation queries the response was YES. [2022-12-06 03:53:31,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66284 conditions, 6052 events. 3565/6052 cut-off events. For 589941/589941 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 42637 event pairs, 569 based on Foata normal form. 41/6091 useless extension candidates. Maximal degree in co-relation 66153. Up to 4744 conditions per place. [2022-12-06 03:53:31,772 INFO L137 encePairwiseOnDemand]: 10/42 looper letters, 695 selfloop transitions, 315 changer transitions 6/1016 dead transitions. [2022-12-06 03:53:31,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1016 transitions, 26539 flow [2022-12-06 03:53:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:53:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:53:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 151 transitions. [2022-12-06 03:53:31,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1634199134199134 [2022-12-06 03:53:31,774 INFO L175 Difference]: Start difference. First operand has 336 places, 844 transitions, 22154 flow. Second operand 22 states and 151 transitions. [2022-12-06 03:53:31,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1016 transitions, 26539 flow [2022-12-06 03:53:34,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1016 transitions, 26392 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-12-06 03:53:34,726 INFO L231 Difference]: Finished difference. Result has 353 places, 890 transitions, 24351 flow [2022-12-06 03:53:34,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=22007, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=24351, PETRI_PLACES=353, PETRI_TRANSITIONS=890} [2022-12-06 03:53:34,727 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 335 predicate places. [2022-12-06 03:53:34,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:34,727 INFO L89 Accepts]: Start accepts. Operand has 353 places, 890 transitions, 24351 flow [2022-12-06 03:53:34,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:34,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:34,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 890 transitions, 24351 flow [2022-12-06 03:53:34,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 890 transitions, 24351 flow [2022-12-06 03:53:35,161 INFO L130 PetriNetUnfolder]: 702/1792 cut-off events. [2022-12-06 03:53:35,161 INFO L131 PetriNetUnfolder]: For 175673/175850 co-relation queries the response was YES. [2022-12-06 03:53:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24013 conditions, 1792 events. 702/1792 cut-off events. For 175673/175850 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 15611 event pairs, 4 based on Foata normal form. 1/1788 useless extension candidates. Maximal degree in co-relation 23880. Up to 948 conditions per place. [2022-12-06 03:53:35,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 353 places, 890 transitions, 24351 flow [2022-12-06 03:53:35,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 2710 [2022-12-06 03:53:35,437 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:53:35,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 711 [2022-12-06 03:53:35,438 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 890 transitions, 24450 flow [2022-12-06 03:53:35,438 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:53:35,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:35,438 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:35,444 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:35,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:35,645 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:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash 347795471, now seen corresponding path program 1 times [2022-12-06 03:53:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:35,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591674748] [2022-12-06 03:53:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:35,692 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:53:35,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:35,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591674748] [2022-12-06 03:53:35,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591674748] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:35,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180525633] [2022-12-06 03:53:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:35,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:35,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:35,708 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:35,731 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:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:35,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:53:35,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:35,805 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:53:35,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:53:35,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180525633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:35,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:53:35,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 03:53:35,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460433308] [2022-12-06 03:53:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:35,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:53:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:35,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:53:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:53:35,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 03:53:35,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 890 transitions, 24450 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:35,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:35,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 03:53:35,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:37,574 INFO L130 PetriNetUnfolder]: 3353/5763 cut-off events. [2022-12-06 03:53:37,574 INFO L131 PetriNetUnfolder]: For 528651/528651 co-relation queries the response was YES. [2022-12-06 03:53:37,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64971 conditions, 5763 events. 3353/5763 cut-off events. For 528651/528651 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 42627 event pairs, 476 based on Foata normal form. 103/5864 useless extension candidates. Maximal degree in co-relation 64835. Up to 2947 conditions per place. [2022-12-06 03:53:37,637 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 1277 selfloop transitions, 43 changer transitions 87/1407 dead transitions. [2022-12-06 03:53:37,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1407 transitions, 41846 flow [2022-12-06 03:53:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:53:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:53:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-06 03:53:37,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32971014492753625 [2022-12-06 03:53:37,639 INFO L175 Difference]: Start difference. First operand has 353 places, 890 transitions, 24450 flow. Second operand 6 states and 91 transitions. [2022-12-06 03:53:37,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1407 transitions, 41846 flow [2022-12-06 03:53:39,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 1407 transitions, 41063 flow, removed 247 selfloop flow, removed 10 redundant places. [2022-12-06 03:53:39,739 INFO L231 Difference]: Finished difference. Result has 350 places, 860 transitions, 23485 flow [2022-12-06 03:53:39,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23056, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=23485, PETRI_PLACES=350, PETRI_TRANSITIONS=860} [2022-12-06 03:53:39,740 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 332 predicate places. [2022-12-06 03:53:39,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:39,740 INFO L89 Accepts]: Start accepts. Operand has 350 places, 860 transitions, 23485 flow [2022-12-06 03:53:39,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:39,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:39,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 860 transitions, 23485 flow [2022-12-06 03:53:39,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 860 transitions, 23485 flow [2022-12-06 03:53:40,204 INFO L130 PetriNetUnfolder]: 640/1708 cut-off events. [2022-12-06 03:53:40,204 INFO L131 PetriNetUnfolder]: For 177104/177272 co-relation queries the response was YES. [2022-12-06 03:53:40,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23472 conditions, 1708 events. 640/1708 cut-off events. For 177104/177272 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 15188 event pairs, 4 based on Foata normal form. 13/1718 useless extension candidates. Maximal degree in co-relation 23339. Up to 881 conditions per place. [2022-12-06 03:53:40,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 860 transitions, 23485 flow [2022-12-06 03:53:40,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 2650 [2022-12-06 03:53:40,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:40,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 505 [2022-12-06 03:53:40,245 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 860 transitions, 23485 flow [2022-12-06 03:53:40,246 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:40,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:40,246 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:40,250 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:40,450 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,SelfDestructingSolverStorable34 [2022-12-06 03:53:40,450 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:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash -173233701, now seen corresponding path program 1 times [2022-12-06 03:53:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:40,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490509540] [2022-12-06 03:53:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:40,553 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:53:40,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:40,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490509540] [2022-12-06 03:53:40,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490509540] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:40,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763564068] [2022-12-06 03:53:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:40,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:40,554 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:40,556 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:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:40,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:53:40,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:40,731 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:53:40,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:40,976 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:53:40,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763564068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:40,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:40,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928908261] [2022-12-06 03:53:40,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:40,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:40,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 03:53:40,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 860 transitions, 23485 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:53:40,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:40,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 03:53:40,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:43,851 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:49,197 INFO L130 PetriNetUnfolder]: 3416/5891 cut-off events. [2022-12-06 03:53:49,197 INFO L131 PetriNetUnfolder]: For 569841/569841 co-relation queries the response was YES. [2022-12-06 03:53:49,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67593 conditions, 5891 events. 3416/5891 cut-off events. For 569841/569841 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 42309 event pairs, 634 based on Foata normal form. 20/5909 useless extension candidates. Maximal degree in co-relation 67457. Up to 4979 conditions per place. [2022-12-06 03:53:49,285 INFO L137 encePairwiseOnDemand]: 11/46 looper letters, 741 selfloop transitions, 240 changer transitions 11/992 dead transitions. [2022-12-06 03:53:49,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 992 transitions, 27302 flow [2022-12-06 03:53:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:53:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:53:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 162 transitions. [2022-12-06 03:53:49,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1354515050167224 [2022-12-06 03:53:49,286 INFO L175 Difference]: Start difference. First operand has 350 places, 860 transitions, 23485 flow. Second operand 26 states and 162 transitions. [2022-12-06 03:53:49,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 992 transitions, 27302 flow [2022-12-06 03:53:52,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 992 transitions, 27054 flow, removed 120 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:52,199 INFO L231 Difference]: Finished difference. Result has 377 places, 890 transitions, 24935 flow [2022-12-06 03:53:52,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23253, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=24935, PETRI_PLACES=377, PETRI_TRANSITIONS=890} [2022-12-06 03:53:52,201 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 359 predicate places. [2022-12-06 03:53:52,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:52,201 INFO L89 Accepts]: Start accepts. Operand has 377 places, 890 transitions, 24935 flow [2022-12-06 03:53:52,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:52,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:52,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 377 places, 890 transitions, 24935 flow [2022-12-06 03:53:52,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 890 transitions, 24935 flow [2022-12-06 03:53:52,655 INFO L130 PetriNetUnfolder]: 652/1756 cut-off events. [2022-12-06 03:53:52,655 INFO L131 PetriNetUnfolder]: For 187399/187580 co-relation queries the response was YES. [2022-12-06 03:53:52,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24375 conditions, 1756 events. 652/1756 cut-off events. For 187399/187580 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 15770 event pairs, 2 based on Foata normal form. 12/1764 useless extension candidates. Maximal degree in co-relation 24237. Up to 914 conditions per place. [2022-12-06 03:53:52,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 890 transitions, 24935 flow [2022-12-06 03:53:52,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 2710 [2022-12-06 03:53:53,190 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:53:53,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 991 [2022-12-06 03:53:53,192 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 890 transitions, 25043 flow [2022-12-06 03:53:53,192 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:53:53,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:53,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:53,197 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:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 03:53:53,397 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:53:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash 347794913, now seen corresponding path program 1 times [2022-12-06 03:53:53,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:53,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680920057] [2022-12-06 03:53:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:53,537 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:53,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:53,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680920057] [2022-12-06 03:53:53,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680920057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:53,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150458938] [2022-12-06 03:53:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:53,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:53,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:53,539 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:53,540 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:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:53,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:53:53,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:53,732 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:53,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:54,049 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:54,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150458938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:54,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:54,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:53:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784422799] [2022-12-06 03:53:54,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:54,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:53:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:53:54,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:53:54,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 03:53:54,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 890 transitions, 25043 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:54,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:54,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 03:53:54,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:02,540 INFO L130 PetriNetUnfolder]: 3482/6025 cut-off events. [2022-12-06 03:54:02,540 INFO L131 PetriNetUnfolder]: For 635636/635636 co-relation queries the response was YES. [2022-12-06 03:54:02,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70221 conditions, 6025 events. 3482/6025 cut-off events. For 635636/635636 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 43589 event pairs, 501 based on Foata normal form. 20/6043 useless extension candidates. Maximal degree in co-relation 70080. Up to 4345 conditions per place. [2022-12-06 03:54:02,601 INFO L137 encePairwiseOnDemand]: 8/51 looper letters, 677 selfloop transitions, 397 changer transitions 8/1082 dead transitions. [2022-12-06 03:54:02,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1082 transitions, 29754 flow [2022-12-06 03:54:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 03:54:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 03:54:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 215 transitions. [2022-12-06 03:54:02,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12399077277970011 [2022-12-06 03:54:02,602 INFO L175 Difference]: Start difference. First operand has 377 places, 890 transitions, 25043 flow. Second operand 34 states and 215 transitions. [2022-12-06 03:54:02,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1082 transitions, 29754 flow [2022-12-06 03:54:05,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 1082 transitions, 29422 flow, removed 116 selfloop flow, removed 14 redundant places. [2022-12-06 03:54:05,449 INFO L231 Difference]: Finished difference. Result has 402 places, 919 transitions, 26616 flow [2022-12-06 03:54:05,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=24711, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=26616, PETRI_PLACES=402, PETRI_TRANSITIONS=919} [2022-12-06 03:54:05,450 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 384 predicate places. [2022-12-06 03:54:05,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:05,450 INFO L89 Accepts]: Start accepts. Operand has 402 places, 919 transitions, 26616 flow [2022-12-06 03:54:05,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:05,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:05,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 919 transitions, 26616 flow [2022-12-06 03:54:05,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 919 transitions, 26616 flow [2022-12-06 03:54:05,873 INFO L130 PetriNetUnfolder]: 690/1825 cut-off events. [2022-12-06 03:54:05,873 INFO L131 PetriNetUnfolder]: For 205246/205450 co-relation queries the response was YES. [2022-12-06 03:54:05,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26095 conditions, 1825 events. 690/1825 cut-off events. For 205246/205450 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 16288 event pairs, 2 based on Foata normal form. 17/1836 useless extension candidates. Maximal degree in co-relation 25949. Up to 953 conditions per place. [2022-12-06 03:54:05,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 919 transitions, 26616 flow [2022-12-06 03:54:05,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 2768 [2022-12-06 03:54:05,916 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:05,957 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:06,312 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 03:54:06,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 863 [2022-12-06 03:54:06,313 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 919 transitions, 26818 flow [2022-12-06 03:54:06,313 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:06,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:06,313 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:06,319 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:54:06,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:06,514 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:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -171766254, now seen corresponding path program 1 times [2022-12-06 03:54:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:06,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714325746] [2022-12-06 03:54:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:06,667 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:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:06,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714325746] [2022-12-06 03:54:06,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714325746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:06,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169077443] [2022-12-06 03:54:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:06,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:06,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:06,680 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:54:06,682 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:54:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:06,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:54:06,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:06,867 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:06,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:07,150 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:07,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169077443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:07,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:07,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:54:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457737139] [2022-12-06 03:54:07,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:07,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:54:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:54:07,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:54:07,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 03:54:07,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 919 transitions, 26818 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:07,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:07,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 03:54:07,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:15,273 INFO L130 PetriNetUnfolder]: 3601/6270 cut-off events. [2022-12-06 03:54:15,273 INFO L131 PetriNetUnfolder]: For 719620/719620 co-relation queries the response was YES. [2022-12-06 03:54:15,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75222 conditions, 6270 events. 3601/6270 cut-off events. For 719620/719620 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 46356 event pairs, 680 based on Foata normal form. 31/6299 useless extension candidates. Maximal degree in co-relation 75073. Up to 5028 conditions per place. [2022-12-06 03:54:15,373 INFO L137 encePairwiseOnDemand]: 11/58 looper letters, 756 selfloop transitions, 322 changer transitions 11/1089 dead transitions. [2022-12-06 03:54:15,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 1089 transitions, 32063 flow [2022-12-06 03:54:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:54:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:54:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 175 transitions. [2022-12-06 03:54:15,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11604774535809019 [2022-12-06 03:54:15,375 INFO L175 Difference]: Start difference. First operand has 402 places, 919 transitions, 26818 flow. Second operand 26 states and 175 transitions. [2022-12-06 03:54:15,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 1089 transitions, 32063 flow [2022-12-06 03:54:20,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 1089 transitions, 31395 flow, removed 288 selfloop flow, removed 11 redundant places. [2022-12-06 03:54:20,409 INFO L231 Difference]: Finished difference. Result has 421 places, 976 transitions, 29258 flow [2022-12-06 03:54:20,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=26150, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=29258, PETRI_PLACES=421, PETRI_TRANSITIONS=976} [2022-12-06 03:54:20,410 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 403 predicate places. [2022-12-06 03:54:20,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:20,410 INFO L89 Accepts]: Start accepts. Operand has 421 places, 976 transitions, 29258 flow [2022-12-06 03:54:20,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:20,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:20,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 421 places, 976 transitions, 29258 flow [2022-12-06 03:54:20,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 976 transitions, 29258 flow [2022-12-06 03:54:20,980 INFO L130 PetriNetUnfolder]: 719/1916 cut-off events. [2022-12-06 03:54:20,981 INFO L131 PetriNetUnfolder]: For 222781/223054 co-relation queries the response was YES. [2022-12-06 03:54:21,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28024 conditions, 1916 events. 719/1916 cut-off events. For 222781/223054 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 17490 event pairs, 1 based on Foata normal form. 17/1927 useless extension candidates. Maximal degree in co-relation 27873. Up to 1003 conditions per place. [2022-12-06 03:54:21,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 420 places, 976 transitions, 29258 flow [2022-12-06 03:54:21,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 2876 [2022-12-06 03:54:21,265 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:54:21,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 856 [2022-12-06 03:54:21,266 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 975 transitions, 29265 flow [2022-12-06 03:54:21,266 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:54:21,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:21,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:21,284 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:54:21,467 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,SelfDestructingSolverStorable37 [2022-12-06 03:54:21,468 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:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 67812055, now seen corresponding path program 1 times [2022-12-06 03:54:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:21,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183386308] [2022-12-06 03:54:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:21,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183386308] [2022-12-06 03:54:21,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183386308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:21,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58180575] [2022-12-06 03:54:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:21,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:21,507 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:54:21,509 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:54:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:21,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:54:21,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:21,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:54:21,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58180575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:21,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:54:21,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-06 03:54:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087009396] [2022-12-06 03:54:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:21,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:54:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:54:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:54:21,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 03:54:21,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 975 transitions, 29265 flow. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 03:54:21,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:21,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 03:54:21,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:24,710 INFO L130 PetriNetUnfolder]: 3599/6274 cut-off events. [2022-12-06 03:54:24,710 INFO L131 PetriNetUnfolder]: For 714551/714551 co-relation queries the response was YES. [2022-12-06 03:54:24,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76690 conditions, 6274 events. 3599/6274 cut-off events. For 714551/714551 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 48012 event pairs, 506 based on Foata normal form. 38/6310 useless extension candidates. Maximal degree in co-relation 76536. Up to 3030 conditions per place. [2022-12-06 03:54:24,806 INFO L137 encePairwiseOnDemand]: 39/62 looper letters, 1443 selfloop transitions, 30 changer transitions 91/1564 dead transitions. [2022-12-06 03:54:24,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1564 transitions, 49673 flow [2022-12-06 03:54:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:54:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:54:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-06 03:54:24,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2022-12-06 03:54:24,807 INFO L175 Difference]: Start difference. First operand has 419 places, 975 transitions, 29265 flow. Second operand 5 states and 103 transitions. [2022-12-06 03:54:24,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 1564 transitions, 49673 flow [2022-12-06 03:54:28,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 1564 transitions, 49012 flow, removed 234 selfloop flow, removed 15 redundant places. [2022-12-06 03:54:28,731 INFO L231 Difference]: Finished difference. Result has 410 places, 965 transitions, 28433 flow [2022-12-06 03:54:28,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=28296, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28433, PETRI_PLACES=410, PETRI_TRANSITIONS=965} [2022-12-06 03:54:28,732 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 392 predicate places. [2022-12-06 03:54:28,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:28,732 INFO L89 Accepts]: Start accepts. Operand has 410 places, 965 transitions, 28433 flow [2022-12-06 03:54:28,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:28,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:28,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 410 places, 965 transitions, 28433 flow [2022-12-06 03:54:28,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 409 places, 965 transitions, 28433 flow [2022-12-06 03:54:29,444 INFO L130 PetriNetUnfolder]: 709/1919 cut-off events. [2022-12-06 03:54:29,444 INFO L131 PetriNetUnfolder]: For 232210/232468 co-relation queries the response was YES. [2022-12-06 03:54:29,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28477 conditions, 1919 events. 709/1919 cut-off events. For 232210/232468 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 17620 event pairs, 1 based on Foata normal form. 17/1930 useless extension candidates. Maximal degree in co-relation 28326. Up to 989 conditions per place. [2022-12-06 03:54:29,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 409 places, 965 transitions, 28433 flow [2022-12-06 03:54:29,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 2882 [2022-12-06 03:54:29,508 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:29,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 777 [2022-12-06 03:54:29,509 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 965 transitions, 28433 flow [2022-12-06 03:54:29,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 03:54:29,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:29,509 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:29,517 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:29,714 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,SelfDestructingSolverStorable38 [2022-12-06 03:54:29,714 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:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash -126305188, now seen corresponding path program 1 times [2022-12-06 03:54:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:29,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451643511] [2022-12-06 03:54:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:29,832 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:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451643511] [2022-12-06 03:54:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451643511] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164785356] [2022-12-06 03:54:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:29,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:29,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:29,834 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:29,836 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:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:29,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:54:29,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:30,075 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:30,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:30,414 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:30,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164785356] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:30,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:30,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:54:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873610730] [2022-12-06 03:54:30,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:30,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:54:30,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:30,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:54:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:54:30,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 03:54:30,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 965 transitions, 28433 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:30,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:30,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 03:54:30,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:40,104 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:44,498 INFO L130 PetriNetUnfolder]: 3704/6484 cut-off events. [2022-12-06 03:54:44,498 INFO L131 PetriNetUnfolder]: For 844844/844844 co-relation queries the response was YES. [2022-12-06 03:54:44,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80697 conditions, 6484 events. 3704/6484 cut-off events. For 844844/844844 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 48378 event pairs, 632 based on Foata normal form. 48/6530 useless extension candidates. Maximal degree in co-relation 80543. Up to 5060 conditions per place. [2022-12-06 03:54:44,575 INFO L137 encePairwiseOnDemand]: 11/61 looper letters, 766 selfloop transitions, 360 changer transitions 12/1138 dead transitions. [2022-12-06 03:54:44,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 1138 transitions, 33532 flow [2022-12-06 03:54:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:54:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:54:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 173 transitions. [2022-12-06 03:54:44,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11344262295081967 [2022-12-06 03:54:44,576 INFO L175 Difference]: Start difference. First operand has 409 places, 965 transitions, 28433 flow. Second operand 25 states and 173 transitions. [2022-12-06 03:54:44,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 1138 transitions, 33532 flow [2022-12-06 03:54:49,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 1138 transitions, 33531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:54:49,327 INFO L231 Difference]: Finished difference. Result has 437 places, 1012 transitions, 31141 flow [2022-12-06 03:54:49,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=28432, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=317, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=31141, PETRI_PLACES=437, PETRI_TRANSITIONS=1012} [2022-12-06 03:54:49,329 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 419 predicate places. [2022-12-06 03:54:49,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:49,329 INFO L89 Accepts]: Start accepts. Operand has 437 places, 1012 transitions, 31141 flow [2022-12-06 03:54:49,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:49,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:49,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 437 places, 1012 transitions, 31141 flow [2022-12-06 03:54:49,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 1012 transitions, 31141 flow [2022-12-06 03:54:49,963 INFO L130 PetriNetUnfolder]: 738/2005 cut-off events. [2022-12-06 03:54:49,963 INFO L131 PetriNetUnfolder]: For 259630/259909 co-relation queries the response was YES. [2022-12-06 03:54:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30712 conditions, 2005 events. 738/2005 cut-off events. For 259630/259909 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 18534 event pairs, 1 based on Foata normal form. 18/2019 useless extension candidates. Maximal degree in co-relation 30555. Up to 1037 conditions per place. [2022-12-06 03:54:50,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 437 places, 1012 transitions, 31141 flow [2022-12-06 03:54:50,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-06 03:54:50,034 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:50,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 706 [2022-12-06 03:54:50,035 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 1012 transitions, 31141 flow [2022-12-06 03:54:50,035 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:54:50,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:50,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:50,056 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:50,256 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,SelfDestructingSolverStorable39 [2022-12-06 03:54:50,256 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:54:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash -109878815, now seen corresponding path program 1 times [2022-12-06 03:54:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:50,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742099621] [2022-12-06 03:54:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:50,404 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:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:50,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742099621] [2022-12-06 03:54:50,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742099621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:50,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576110141] [2022-12-06 03:54:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:50,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:50,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:50,427 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:50,457 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:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:50,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:54:50,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:50,658 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:50,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:50,916 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:50,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576110141] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:50,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:50,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:54:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163771692] [2022-12-06 03:54:50,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:50,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:54:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:54:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:54:50,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 03:54:50,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1012 transitions, 31141 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:50,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:50,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 03:54:50,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:52,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:58,621 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:55:04,026 INFO L130 PetriNetUnfolder]: 3754/6598 cut-off events. [2022-12-06 03:55:04,026 INFO L131 PetriNetUnfolder]: For 778156/778156 co-relation queries the response was YES. [2022-12-06 03:55:04,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84295 conditions, 6598 events. 3754/6598 cut-off events. For 778156/778156 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 49552 event pairs, 635 based on Foata normal form. 11/6607 useless extension candidates. Maximal degree in co-relation 84135. Up to 5122 conditions per place. [2022-12-06 03:55:04,123 INFO L137 encePairwiseOnDemand]: 10/61 looper letters, 788 selfloop transitions, 369 changer transitions 23/1180 dead transitions. [2022-12-06 03:55:04,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 1180 transitions, 36083 flow [2022-12-06 03:55:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:55:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:55:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2022-12-06 03:55:04,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11698956780923994 [2022-12-06 03:55:04,125 INFO L175 Difference]: Start difference. First operand has 437 places, 1012 transitions, 31141 flow. Second operand 22 states and 157 transitions. [2022-12-06 03:55:04,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 1180 transitions, 36083 flow [2022-12-06 03:55:09,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 1180 transitions, 35820 flow, removed 65 selfloop flow, removed 12 redundant places. [2022-12-06 03:55:09,872 INFO L231 Difference]: Finished difference. Result has 449 places, 1036 transitions, 32894 flow [2022-12-06 03:55:09,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=30878, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=32894, PETRI_PLACES=449, PETRI_TRANSITIONS=1036} [2022-12-06 03:55:09,874 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 431 predicate places. [2022-12-06 03:55:09,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:09,874 INFO L89 Accepts]: Start accepts. Operand has 449 places, 1036 transitions, 32894 flow [2022-12-06 03:55:09,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:09,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:09,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 1036 transitions, 32894 flow [2022-12-06 03:55:09,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 1036 transitions, 32894 flow [2022-12-06 03:55:10,429 INFO L130 PetriNetUnfolder]: 750/2040 cut-off events. [2022-12-06 03:55:10,429 INFO L131 PetriNetUnfolder]: For 268282/268562 co-relation queries the response was YES. [2022-12-06 03:55:10,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31844 conditions, 2040 events. 750/2040 cut-off events. For 268282/268562 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 19012 event pairs, 1 based on Foata normal form. 18/2054 useless extension candidates. Maximal degree in co-relation 31683. Up to 1062 conditions per place. [2022-12-06 03:55:10,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 448 places, 1036 transitions, 32894 flow [2022-12-06 03:55:10,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 3020 [2022-12-06 03:55:10,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:55:10,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 761 [2022-12-06 03:55:10,635 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 1035 transitions, 32876 flow [2022-12-06 03:55:10,635 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:10,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:10,635 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:10,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:10,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:10,836 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:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -798747923, now seen corresponding path program 1 times [2022-12-06 03:55:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:10,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133509666] [2022-12-06 03:55:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:10,883 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:55:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:10,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133509666] [2022-12-06 03:55:10,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133509666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:10,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939156954] [2022-12-06 03:55:10,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:10,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:10,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:10,885 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:55:10,886 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:55:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:10,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:55:10,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:10,993 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:55:10,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:55:10,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939156954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:55:10,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:55:10,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 03:55:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859669807] [2022-12-06 03:55:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:55:10,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:55:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:55:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:55:10,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 03:55:10,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 1035 transitions, 32876 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:55:10,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:10,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 03:55:10,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:14,129 INFO L130 PetriNetUnfolder]: 4038/7026 cut-off events. [2022-12-06 03:55:14,129 INFO L131 PetriNetUnfolder]: For 893481/893481 co-relation queries the response was YES. [2022-12-06 03:55:14,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92354 conditions, 7026 events. 4038/7026 cut-off events. For 893481/893481 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 54478 event pairs, 495 based on Foata normal form. 156/7180 useless extension candidates. Maximal degree in co-relation 92190. Up to 3970 conditions per place. [2022-12-06 03:55:14,381 INFO L137 encePairwiseOnDemand]: 34/59 looper letters, 1352 selfloop transitions, 247 changer transitions 92/1691 dead transitions. [2022-12-06 03:55:14,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1691 transitions, 57184 flow [2022-12-06 03:55:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:55:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:55:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2022-12-06 03:55:14,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 03:55:14,383 INFO L175 Difference]: Start difference. First operand has 447 places, 1035 transitions, 32876 flow. Second operand 7 states and 118 transitions. [2022-12-06 03:55:14,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1691 transitions, 57184 flow [2022-12-06 03:55:19,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1691 transitions, 56314 flow, removed 186 selfloop flow, removed 16 redundant places. [2022-12-06 03:55:19,922 INFO L231 Difference]: Finished difference. Result has 439 places, 1075 transitions, 34639 flow [2022-12-06 03:55:19,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=31293, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=34639, PETRI_PLACES=439, PETRI_TRANSITIONS=1075} [2022-12-06 03:55:19,923 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 421 predicate places. [2022-12-06 03:55:19,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:19,923 INFO L89 Accepts]: Start accepts. Operand has 439 places, 1075 transitions, 34639 flow [2022-12-06 03:55:19,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:19,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:19,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 1075 transitions, 34639 flow [2022-12-06 03:55:19,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 1075 transitions, 34639 flow [2022-12-06 03:55:20,592 INFO L130 PetriNetUnfolder]: 814/2226 cut-off events. [2022-12-06 03:55:20,593 INFO L131 PetriNetUnfolder]: For 358467/358774 co-relation queries the response was YES. [2022-12-06 03:55:20,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36846 conditions, 2226 events. 814/2226 cut-off events. For 358467/358774 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 21242 event pairs, 8 based on Foata normal form. 18/2243 useless extension candidates. Maximal degree in co-relation 36684. Up to 1160 conditions per place. [2022-12-06 03:55:20,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 1075 transitions, 34639 flow [2022-12-06 03:55:20,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 3346 [2022-12-06 03:55:20,648 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:55:20,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 726 [2022-12-06 03:55:20,649 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 1075 transitions, 34639 flow [2022-12-06 03:55:20,649 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:55:20,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:20,649 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:20,653 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:55:20,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:20,853 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:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1025318405, now seen corresponding path program 1 times [2022-12-06 03:55:20,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:20,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945492770] [2022-12-06 03:55:20,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:20,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945492770] [2022-12-06 03:55:20,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945492770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:20,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666724890] [2022-12-06 03:55:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:20,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:20,999 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:55:21,000 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:55:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:21,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:55:21,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:21,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:21,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666724890] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:21,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:21,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:55:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199741406] [2022-12-06 03:55:21,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:21,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:55:21,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:55:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:55:21,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 03:55:21,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1075 transitions, 34639 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:21,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:21,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 03:55:21,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:27,080 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 75 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:55:33,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:42,074 INFO L130 PetriNetUnfolder]: 4168/7280 cut-off events. [2022-12-06 03:55:42,074 INFO L131 PetriNetUnfolder]: For 1102542/1102542 co-relation queries the response was YES. [2022-12-06 03:55:42,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98201 conditions, 7280 events. 4168/7280 cut-off events. For 1102542/1102542 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 55293 event pairs, 733 based on Foata normal form. 54/7332 useless extension candidates. Maximal degree in co-relation 98036. Up to 5672 conditions per place. [2022-12-06 03:55:42,191 INFO L137 encePairwiseOnDemand]: 10/58 looper letters, 874 selfloop transitions, 398 changer transitions 21/1293 dead transitions. [2022-12-06 03:55:42,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1293 transitions, 41466 flow [2022-12-06 03:55:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 03:55:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 03:55:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 200 transitions. [2022-12-06 03:55:42,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1044932079414838 [2022-12-06 03:55:42,193 INFO L175 Difference]: Start difference. First operand has 439 places, 1075 transitions, 34639 flow. Second operand 33 states and 200 transitions. [2022-12-06 03:55:42,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1293 transitions, 41466 flow [2022-12-06 03:55:49,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1293 transitions, 40541 flow, removed 441 selfloop flow, removed 2 redundant places. [2022-12-06 03:55:49,336 INFO L231 Difference]: Finished difference. Result has 475 places, 1124 transitions, 37193 flow [2022-12-06 03:55:49,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=33864, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=37193, PETRI_PLACES=475, PETRI_TRANSITIONS=1124} [2022-12-06 03:55:49,338 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 457 predicate places. [2022-12-06 03:55:49,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:49,338 INFO L89 Accepts]: Start accepts. Operand has 475 places, 1124 transitions, 37193 flow [2022-12-06 03:55:49,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:49,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:49,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 1124 transitions, 37193 flow [2022-12-06 03:55:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 1124 transitions, 37193 flow [2022-12-06 03:55:50,268 INFO L130 PetriNetUnfolder]: 845/2328 cut-off events. [2022-12-06 03:55:50,268 INFO L131 PetriNetUnfolder]: For 398184/398497 co-relation queries the response was YES. [2022-12-06 03:55:50,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39266 conditions, 2328 events. 845/2328 cut-off events. For 398184/398497 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 22282 event pairs, 6 based on Foata normal form. 17/2344 useless extension candidates. Maximal degree in co-relation 39098. Up to 1225 conditions per place. [2022-12-06 03:55:50,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 1124 transitions, 37193 flow [2022-12-06 03:55:50,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 3472 [2022-12-06 03:55:50,597 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:55:50,597 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1259 [2022-12-06 03:55:50,597 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 1123 transitions, 37212 flow [2022-12-06 03:55:50,597 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:50,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:50,598 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:50,605 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:50,802 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,SelfDestructingSolverStorable42 [2022-12-06 03:55:50,802 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:55:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1030692720, now seen corresponding path program 1 times [2022-12-06 03:55:50,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:50,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280864504] [2022-12-06 03:55:50,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:50,925 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:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:50,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280864504] [2022-12-06 03:55:50,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280864504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:50,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128572275] [2022-12-06 03:55:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:50,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:50,927 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:50,929 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:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:51,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:55:51,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:51,206 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:51,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:51,494 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:51,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128572275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:51,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:51,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:55:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015757982] [2022-12-06 03:55:51,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:51,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:55:51,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:55:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:55:51,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 03:55:51,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 1123 transitions, 37212 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:51,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:51,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 03:55:51,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:56,979 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:56:06,659 INFO L130 PetriNetUnfolder]: 4324/7580 cut-off events. [2022-12-06 03:56:06,659 INFO L131 PetriNetUnfolder]: For 1282186/1282186 co-relation queries the response was YES. [2022-12-06 03:56:06,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104148 conditions, 7580 events. 4324/7580 cut-off events. For 1282186/1282186 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 58018 event pairs, 686 based on Foata normal form. 66/7644 useless extension candidates. Maximal degree in co-relation 103977. Up to 5550 conditions per place. [2022-12-06 03:56:07,030 INFO L137 encePairwiseOnDemand]: 10/63 looper letters, 869 selfloop transitions, 488 changer transitions 24/1381 dead transitions. [2022-12-06 03:56:07,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 1381 transitions, 44948 flow [2022-12-06 03:56:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 03:56:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 03:56:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 214 transitions. [2022-12-06 03:56:07,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09435626102292768 [2022-12-06 03:56:07,031 INFO L175 Difference]: Start difference. First operand has 474 places, 1123 transitions, 37212 flow. Second operand 36 states and 214 transitions. [2022-12-06 03:56:07,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 1381 transitions, 44948 flow [2022-12-06 03:56:16,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1381 transitions, 44319 flow, removed 229 selfloop flow, removed 20 redundant places. [2022-12-06 03:56:16,394 INFO L231 Difference]: Finished difference. Result has 494 places, 1179 transitions, 40691 flow [2022-12-06 03:56:16,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=36587, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=40691, PETRI_PLACES=494, PETRI_TRANSITIONS=1179} [2022-12-06 03:56:16,395 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 476 predicate places. [2022-12-06 03:56:16,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:56:16,395 INFO L89 Accepts]: Start accepts. Operand has 494 places, 1179 transitions, 40691 flow [2022-12-06 03:56:16,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:56:16,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:56:16,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 494 places, 1179 transitions, 40691 flow [2022-12-06 03:56:16,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 494 places, 1179 transitions, 40691 flow [2022-12-06 03:56:17,289 INFO L130 PetriNetUnfolder]: 884/2454 cut-off events. [2022-12-06 03:56:17,289 INFO L131 PetriNetUnfolder]: For 442014/442344 co-relation queries the response was YES. [2022-12-06 03:56:17,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42616 conditions, 2454 events. 884/2454 cut-off events. For 442014/442344 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 23807 event pairs, 5 based on Foata normal form. 17/2470 useless extension candidates. Maximal degree in co-relation 42442. Up to 1285 conditions per place. [2022-12-06 03:56:17,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 494 places, 1179 transitions, 40691 flow [2022-12-06 03:56:17,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 3622 [2022-12-06 03:56:17,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:56:17,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 991 [2022-12-06 03:56:17,387 INFO L495 AbstractCegarLoop]: Abstraction has has 494 places, 1179 transitions, 40709 flow [2022-12-06 03:56:17,387 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:17,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:56:17,387 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:56:17,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-06 03:56:17,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 03:56:17,590 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:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:56:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash 869526835, now seen corresponding path program 2 times [2022-12-06 03:56:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:56:17,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772663150] [2022-12-06 03:56:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:56:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:17,740 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:56:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:56:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772663150] [2022-12-06 03:56:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772663150] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:56:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778341781] [2022-12-06 03:56:17,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:56:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:17,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:56:17,742 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:56:17,745 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:56:17,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:56:17,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:56:17,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:56:17,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:56:17,934 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:56:17,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:56:18,307 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:56:18,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778341781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:56:18,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:56:18,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:56:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64532785] [2022-12-06 03:56:18,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:56:18,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:56:18,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:56:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:56:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:56:18,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 03:56:18,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1179 transitions, 40709 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:18,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:56:18,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 03:56:18,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:24,415 INFO L130 PetriNetUnfolder]: 5283/9156 cut-off events. [2022-12-06 03:56:24,415 INFO L131 PetriNetUnfolder]: For 1962321/1962321 co-relation queries the response was YES. [2022-12-06 03:56:24,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135003 conditions, 9156 events. 5283/9156 cut-off events. For 1962321/1962321 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 71144 event pairs, 291 based on Foata normal form. 64/9218 useless extension candidates. Maximal degree in co-relation 134826. Up to 3777 conditions per place. [2022-12-06 03:56:24,529 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 641 selfloop transitions, 930 changer transitions 9/1580 dead transitions. [2022-12-06 03:56:24,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 1580 transitions, 52894 flow [2022-12-06 03:56:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:56:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:56:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2022-12-06 03:56:24,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14136904761904762 [2022-12-06 03:56:24,530 INFO L175 Difference]: Start difference. First operand has 494 places, 1179 transitions, 40709 flow. Second operand 21 states and 190 transitions. [2022-12-06 03:56:24,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 1580 transitions, 52894 flow [2022-12-06 03:56:33,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 1580 transitions, 52128 flow, removed 309 selfloop flow, removed 18 redundant places. [2022-12-06 03:56:33,732 INFO L231 Difference]: Finished difference. Result has 503 places, 1343 transitions, 48953 flow [2022-12-06 03:56:33,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=40013, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=789, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=48953, PETRI_PLACES=503, PETRI_TRANSITIONS=1343} [2022-12-06 03:56:33,733 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 485 predicate places. [2022-12-06 03:56:33,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:56:33,733 INFO L89 Accepts]: Start accepts. Operand has 503 places, 1343 transitions, 48953 flow [2022-12-06 03:56:33,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:56:33,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:56:33,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 503 places, 1343 transitions, 48953 flow [2022-12-06 03:56:33,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 503 places, 1343 transitions, 48953 flow [2022-12-06 03:56:34,789 INFO L130 PetriNetUnfolder]: 1077/2927 cut-off events. [2022-12-06 03:56:34,789 INFO L131 PetriNetUnfolder]: For 718784/719137 co-relation queries the response was YES. [2022-12-06 03:56:34,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56518 conditions, 2927 events. 1077/2927 cut-off events. For 718784/719137 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 28976 event pairs, 20 based on Foata normal form. 14/2939 useless extension candidates. Maximal degree in co-relation 56336. Up to 1577 conditions per place. [2022-12-06 03:56:34,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 503 places, 1343 transitions, 48953 flow [2022-12-06 03:56:34,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 4176 [2022-12-06 03:56:34,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 4)) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [402] L705-6-->L687-5: Formula: (and (= v_~p~0_288 (+ v_~p~0_290 3)) (= (+ (* 21 v_~cur~0_280) (* 3 v_~next~0_168) (* v_~prev~0_329 13)) (* 5 v_~prev~0_328)) (< v_~p~0_290 3) (= (+ 12 v_~x~0_313) v_~x~0_312) (< v_~x~0_313 1) (= (+ (* v_~j~0_377 3) v_~i~0_409) v_~i~0_407) (= (* 2 v_~next~0_168) (+ (* 3 v_~prev~0_328) (* 34 v_~cur~0_280) (* 21 v_~prev~0_329))) (= v_~next~0_168 v_~cur~0_279)) InVars {~j~0=v_~j~0_377, ~prev~0=v_~prev~0_329, ~i~0=v_~i~0_409, ~p~0=v_~p~0_290, ~cur~0=v_~cur~0_280, ~x~0=v_~x~0_313} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_193|, ~j~0=v_~j~0_377, ~next~0=v_~next~0_168, ~prev~0=v_~prev~0_328, ~i~0=v_~i~0_407, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_204|, ~p~0=v_~p~0_288, ~cur~0=v_~cur~0_279, ~x~0=v_~x~0_312} 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:56:34,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 4)) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [400] L705-6-->L687-5: Formula: (and (= (+ (* v_~prev~0_321 13) (* 3 v_~next~0_164) (* 21 v_~cur~0_272)) (* 5 v_~prev~0_320)) (= v_~next~0_164 v_~cur~0_271) (= (+ v_~j~0_373 v_~i~0_398) v_~i~0_397) (= (+ v_~p~0_279 1) v_~p~0_278) (< v_~x~0_305 1) (= (* 2 v_~next~0_164) (+ (* 34 v_~cur~0_272) (* 3 v_~prev~0_320) (* 21 v_~prev~0_321))) (< v_~p~0_279 5) (= (+ 12 v_~x~0_305) v_~x~0_304)) InVars {~j~0=v_~j~0_373, ~prev~0=v_~prev~0_321, ~i~0=v_~i~0_398, ~p~0=v_~p~0_279, ~cur~0=v_~cur~0_272, ~x~0=v_~x~0_305} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_189|, ~j~0=v_~j~0_373, ~next~0=v_~next~0_164, ~prev~0=v_~prev~0_320, ~i~0=v_~i~0_397, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_198|, ~p~0=v_~p~0_278, ~cur~0=v_~cur~0_271, ~x~0=v_~x~0_304} 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:56:35,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 4)) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [401] L705-6-->L687-5: Formula: (and (= (+ (* 21 v_~cur~0_276) (* v_~prev~0_325 13) (* 3 v_~next~0_166)) (* 5 v_~prev~0_324)) (< v_~p~0_284 4) (< v_~x~0_309 1) (= (* 2 v_~next~0_166) (+ (* 3 v_~prev~0_324) (* 34 v_~cur~0_276) (* 21 v_~prev~0_325))) (= v_~next~0_166 v_~cur~0_275) (= v_~p~0_282 (+ v_~p~0_284 2)) (= (+ 12 v_~x~0_309) v_~x~0_308) (= (+ (* v_~j~0_375 2) v_~i~0_403) v_~i~0_401)) InVars {~j~0=v_~j~0_375, ~prev~0=v_~prev~0_325, ~i~0=v_~i~0_403, ~p~0=v_~p~0_284, ~cur~0=v_~cur~0_276, ~x~0=v_~x~0_309} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_191|, ~j~0=v_~j~0_375, ~next~0=v_~next~0_166, ~prev~0=v_~prev~0_324, ~i~0=v_~i~0_401, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_200|, ~p~0=v_~p~0_282, ~cur~0=v_~cur~0_275, ~x~0=v_~x~0_308} 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:56:35,158 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:56:35,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1425 [2022-12-06 03:56:35,158 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 1343 transitions, 48970 flow [2022-12-06 03:56:35,158 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:35,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:56:35,159 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:56:35,165 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:56:35,362 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,SelfDestructingSolverStorable44 [2022-12-06 03:56:35,363 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:56:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:56:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash 821158124, now seen corresponding path program 1 times [2022-12-06 03:56:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:56:35,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385135954] [2022-12-06 03:56:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:56:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:35,585 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:56:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:56:35,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385135954] [2022-12-06 03:56:35,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385135954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:56:35,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327557282] [2022-12-06 03:56:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:56:35,594 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:56:35,617 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:56:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:35,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:56:35,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:56:35,844 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:56:35,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:56:36,248 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:56:36,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327557282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:56:36,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:56:36,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:56:36,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157256394] [2022-12-06 03:56:36,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:56:36,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:56:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:56:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:56:36,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:56:36,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 03:56:36,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1343 transitions, 48970 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:36,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:56:36,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 03:56:36,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:45,460 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:56:54,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:57:00,417 INFO L130 PetriNetUnfolder]: 5434/9462 cut-off events. [2022-12-06 03:57:00,417 INFO L131 PetriNetUnfolder]: For 2251383/2251383 co-relation queries the response was YES. [2022-12-06 03:57:00,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144083 conditions, 9462 events. 5434/9462 cut-off events. For 2251383/2251383 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 74349 event pairs, 638 based on Foata normal form. 98/9558 useless extension candidates. Maximal degree in co-relation 143898. Up to 6492 conditions per place. [2022-12-06 03:57:00,542 INFO L137 encePairwiseOnDemand]: 8/65 looper letters, 941 selfloop transitions, 705 changer transitions 26/1672 dead transitions. [2022-12-06 03:57:00,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 1672 transitions, 58443 flow [2022-12-06 03:57:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 03:57:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 03:57:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 234 transitions. [2022-12-06 03:57:00,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10588235294117647 [2022-12-06 03:57:00,543 INFO L175 Difference]: Start difference. First operand has 503 places, 1343 transitions, 48970 flow. Second operand 34 states and 234 transitions. [2022-12-06 03:57:00,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 1672 transitions, 58443 flow [2022-12-06 03:57:11,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 1672 transitions, 57184 flow, removed 474 selfloop flow, removed 18 redundant places. [2022-12-06 03:57:11,819 INFO L231 Difference]: Finished difference. Result has 528 places, 1415 transitions, 52828 flow [2022-12-06 03:57:11,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=47785, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=645, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=52828, PETRI_PLACES=528, PETRI_TRANSITIONS=1415} [2022-12-06 03:57:11,820 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 510 predicate places. [2022-12-06 03:57:11,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:11,821 INFO L89 Accepts]: Start accepts. Operand has 528 places, 1415 transitions, 52828 flow [2022-12-06 03:57:11,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:11,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:11,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 528 places, 1415 transitions, 52828 flow [2022-12-06 03:57:11,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 528 places, 1415 transitions, 52828 flow [2022-12-06 03:57:12,929 INFO L130 PetriNetUnfolder]: 1104/3047 cut-off events. [2022-12-06 03:57:12,930 INFO L131 PetriNetUnfolder]: For 728821/729163 co-relation queries the response was YES. [2022-12-06 03:57:12,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58848 conditions, 3047 events. 1104/3047 cut-off events. For 728821/729163 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 30545 event pairs, 25 based on Foata normal form. 14/3060 useless extension candidates. Maximal degree in co-relation 58661. Up to 1645 conditions per place. [2022-12-06 03:57:13,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 528 places, 1415 transitions, 52828 flow [2022-12-06 03:57:13,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 4330 [2022-12-06 03:57:13,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L705-6-->L687-5: Formula: (and (= (+ 12 v_~x~0_257) v_~x~0_256) (= v_~p~0_174 (+ v_~p~0_176 2)) (= v_~next~0_140 v_~cur~0_227) (= (* 5 v_~prev~0_272) (+ (* 3 v_~next~0_140) (* 21 v_~cur~0_228) (* v_~prev~0_273 13))) (= (+ (* 21 v_~prev~0_273) (* 3 v_~prev~0_272) (* 34 v_~cur~0_228)) (* 2 v_~next~0_140)) (< v_~x~0_257 1) (= (+ (* v_~j~0_319 2) v_~i~0_293) v_~i~0_291) (< v_~p~0_174 6)) InVars {~j~0=v_~j~0_319, ~prev~0=v_~prev~0_273, ~i~0=v_~i~0_293, ~p~0=v_~p~0_176, ~cur~0=v_~cur~0_228, ~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_319, ~next~0=v_~next~0_140, ~prev~0=v_~prev~0_272, ~i~0=v_~i~0_291, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_129|, ~p~0=v_~p~0_174, ~cur~0=v_~cur~0_227, ~x~0=v_~x~0_256} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~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:57:13,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:57:13,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1279 [2022-12-06 03:57:13,100 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 1414 transitions, 52810 flow [2022-12-06 03:57:13,100 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:13,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:13,100 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:13,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-06 03:57:13,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 03:57:13,306 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:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1974201687, now seen corresponding path program 1 times [2022-12-06 03:57:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:13,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320687621] [2022-12-06 03:57:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:13,413 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:57:13,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:13,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320687621] [2022-12-06 03:57:13,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320687621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:57:13,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193776047] [2022-12-06 03:57:13,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:13,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:13,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:57:13,415 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:57:13,417 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:57:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:13,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:57:13,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:57:13,616 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:57:13,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:57:14,084 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:57:14,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193776047] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:57:14,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:57:14,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:57:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107141547] [2022-12-06 03:57:14,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:57:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:57:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:57:14,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:57:14,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 03:57:14,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 1414 transitions, 52810 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:14,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:14,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 03:57:14,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:57:24,208 INFO L130 PetriNetUnfolder]: 6475/11239 cut-off events. [2022-12-06 03:57:24,208 INFO L131 PetriNetUnfolder]: For 2748083/2748083 co-relation queries the response was YES. [2022-12-06 03:57:24,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178211 conditions, 11239 events. 6475/11239 cut-off events. For 2748083/2748083 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 90110 event pairs, 322 based on Foata normal form. 80/11317 useless extension candidates. Maximal degree in co-relation 178021. Up to 4253 conditions per place. [2022-12-06 03:57:24,361 INFO L137 encePairwiseOnDemand]: 8/65 looper letters, 597 selfloop transitions, 1287 changer transitions 9/1893 dead transitions. [2022-12-06 03:57:24,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 1893 transitions, 70030 flow [2022-12-06 03:57:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:57:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:57:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 206 transitions. [2022-12-06 03:57:24,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12676923076923077 [2022-12-06 03:57:24,362 INFO L175 Difference]: Start difference. First operand has 527 places, 1414 transitions, 52810 flow. Second operand 25 states and 206 transitions. [2022-12-06 03:57:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 1893 transitions, 70030 flow [2022-12-06 03:57:36,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 1893 transitions, 69091 flow, removed 382 selfloop flow, removed 10 redundant places. [2022-12-06 03:57:37,026 INFO L231 Difference]: Finished difference. Result has 549 places, 1660 transitions, 66530 flow [2022-12-06 03:57:37,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=51917, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1086, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=66530, PETRI_PLACES=549, PETRI_TRANSITIONS=1660} [2022-12-06 03:57:37,028 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 531 predicate places. [2022-12-06 03:57:37,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:37,028 INFO L89 Accepts]: Start accepts. Operand has 549 places, 1660 transitions, 66530 flow [2022-12-06 03:57:37,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:37,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:37,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 549 places, 1660 transitions, 66530 flow [2022-12-06 03:57:37,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 549 places, 1660 transitions, 66530 flow [2022-12-06 03:57:38,668 INFO L130 PetriNetUnfolder]: 1323/3589 cut-off events. [2022-12-06 03:57:38,669 INFO L131 PetriNetUnfolder]: For 980662/981109 co-relation queries the response was YES. [2022-12-06 03:57:38,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74882 conditions, 3589 events. 1323/3589 cut-off events. For 980662/981109 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 36736 event pairs, 32 based on Foata normal form. 20/3607 useless extension candidates. Maximal degree in co-relation 74688. Up to 2007 conditions per place. [2022-12-06 03:57:38,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 549 places, 1660 transitions, 66530 flow [2022-12-06 03:57:38,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 5032 [2022-12-06 03:57:38,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [379] L705-6-->L695-5: Formula: (and (= (* 2 v_~next~0_132) (+ (* 3 v_~prev~0_256) (* 21 v_~prev~0_257) (* 34 v_~cur~0_212))) (= v_~q~0_213 (+ 2 v_~q~0_215)) (< v_~x~0_241 1) (= (* 5 v_~prev~0_256) (+ (* v_~prev~0_257 13) (* 21 v_~cur~0_212) (* 3 v_~next~0_132))) (= (+ 12 v_~x~0_241) v_~x~0_240) (= v_~next~0_132 v_~cur~0_211) (< v_~q~0_215 4) (= v_~j~0_303 (+ v_~j~0_305 (* 2 v_~i~0_271)))) InVars {~j~0=v_~j~0_305, ~prev~0=v_~prev~0_257, ~i~0=v_~i~0_271, ~q~0=v_~q~0_215, ~cur~0=v_~cur~0_212, ~x~0=v_~x~0_241} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_153|, ~j~0=v_~j~0_303, ~next~0=v_~next~0_132, ~prev~0=v_~prev~0_256, ~i~0=v_~i~0_271, ~q~0=v_~q~0_213, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_150|, ~cur~0=v_~cur~0_211, ~x~0=v_~x~0_240} 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:57:38,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [377] L705-6-->L695-5: Formula: (and (= (+ (* 21 v_~prev~0_247) (* 3 v_~prev~0_246) (* 34 v_~cur~0_205)) (* 2 v_~next~0_127)) (< v_~q~0_198 5) (= (* 5 v_~prev~0_246) (+ (* v_~prev~0_247 13) (* 21 v_~cur~0_205) (* 3 v_~next~0_127))) (= v_~next~0_127 v_~cur~0_204) (= (+ 12 v_~x~0_231) v_~x~0_230) (= v_~j~0_289 (+ v_~j~0_290 v_~i~0_247)) (= (+ v_~q~0_198 1) v_~q~0_197) (< v_~x~0_231 1)) InVars {~j~0=v_~j~0_290, ~prev~0=v_~prev~0_247, ~i~0=v_~i~0_247, ~q~0=v_~q~0_198, ~cur~0=v_~cur~0_205, ~x~0=v_~x~0_231} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_145|, ~j~0=v_~j~0_289, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_246, ~i~0=v_~i~0_247, ~q~0=v_~q~0_197, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_141|, ~cur~0=v_~cur~0_204, ~x~0=v_~x~0_230} 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:57:39,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [424] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_347) v_~x~0_346) (< v_~q~0_343 5) (< v_~p~0_375 6) (= v_~j~0_505 (+ v_~j~0_506 v_~i~0_515)) (= v_~next~0_185 v_~cur~0_306) (= (+ (* v_~j~0_506 2) v_~i~0_516) v_~i~0_515) (= (* 5 v_~prev~0_362) (+ (* 3 v_~next~0_185) (* 21 v_~cur~0_307) (* v_~prev~0_363 13))) (= v_~q~0_342 (+ v_~q~0_343 1)) (= (+ (* 21 v_~prev~0_363) (* 34 v_~cur~0_307) (* 3 v_~prev~0_362)) (* 2 v_~next~0_185)) (< v_~x~0_347 1) (= v_~p~0_375 (+ v_~p~0_376 2))) InVars {~j~0=v_~j~0_506, ~prev~0=v_~prev~0_363, ~i~0=v_~i~0_516, ~q~0=v_~q~0_343, ~p~0=v_~p~0_376, ~cur~0=v_~cur~0_307, ~x~0=v_~x~0_347} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_217|, ~j~0=v_~j~0_505, ~next~0=v_~next~0_185, ~prev~0=v_~prev~0_362, ~i~0=v_~i~0_515, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_263|, ~q~0=v_~q~0_342, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_247|, ~p~0=v_~p~0_375, ~cur~0=v_~cur~0_306, ~x~0=v_~x~0_346} 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:57:39,149 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:57:39,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2121 [2022-12-06 03:57:39,149 INFO L495 AbstractCegarLoop]: Abstraction has has 549 places, 1660 transitions, 66557 flow [2022-12-06 03:57:39,149 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:39,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:39,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:39,154 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:57:39,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:39,354 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:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash -56755696, now seen corresponding path program 1 times [2022-12-06 03:57:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:39,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47028387] [2022-12-06 03:57:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:39,443 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:57:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47028387] [2022-12-06 03:57:39,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47028387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:57:39,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705922259] [2022-12-06 03:57:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:39,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:39,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:57:39,445 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:57:39,447 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:57:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:39,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:57:39,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:57:39,627 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:57:39,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:57:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:39,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705922259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:57:39,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:57:39,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:57:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708471277] [2022-12-06 03:57:39,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:57:39,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:57:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:57:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:57:39,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 03:57:39,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 1660 transitions, 66557 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:57:39,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:39,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 03:57:39,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:57:52,137 INFO L130 PetriNetUnfolder]: 6521/11427 cut-off events. [2022-12-06 03:57:52,137 INFO L131 PetriNetUnfolder]: For 3132488/3132488 co-relation queries the response was YES. [2022-12-06 03:57:52,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184553 conditions, 11427 events. 6521/11427 cut-off events. For 3132488/3132488 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 93082 event pairs, 1438 based on Foata normal form. 154/11579 useless extension candidates. Maximal degree in co-relation 184356. Up to 9406 conditions per place. [2022-12-06 03:57:52,313 INFO L137 encePairwiseOnDemand]: 15/67 looper letters, 1386 selfloop transitions, 458 changer transitions 40/1884 dead transitions. [2022-12-06 03:57:52,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 1884 transitions, 75263 flow [2022-12-06 03:57:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 03:57:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 03:57:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2022-12-06 03:57:52,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10634328358208955 [2022-12-06 03:57:52,314 INFO L175 Difference]: Start difference. First operand has 549 places, 1660 transitions, 66557 flow. Second operand 24 states and 171 transitions. [2022-12-06 03:57:52,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 1884 transitions, 75263 flow [2022-12-06 03:58:05,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1884 transitions, 73653 flow, removed 679 selfloop flow, removed 17 redundant places. [2022-12-06 03:58:05,396 INFO L231 Difference]: Finished difference. Result has 560 places, 1713 transitions, 68963 flow [2022-12-06 03:58:05,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=64989, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=408, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=68963, PETRI_PLACES=560, PETRI_TRANSITIONS=1713} [2022-12-06 03:58:05,398 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 542 predicate places. [2022-12-06 03:58:05,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:58:05,398 INFO L89 Accepts]: Start accepts. Operand has 560 places, 1713 transitions, 68963 flow [2022-12-06 03:58:05,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:58:05,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:58:05,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 560 places, 1713 transitions, 68963 flow [2022-12-06 03:58:05,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 560 places, 1713 transitions, 68963 flow [2022-12-06 03:58:06,941 INFO L130 PetriNetUnfolder]: 1307/3614 cut-off events. [2022-12-06 03:58:06,941 INFO L131 PetriNetUnfolder]: For 840660/841108 co-relation queries the response was YES. [2022-12-06 03:58:06,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73080 conditions, 3614 events. 1307/3614 cut-off events. For 840660/841108 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 37374 event pairs, 21 based on Foata normal form. 20/3633 useless extension candidates. Maximal degree in co-relation 72887. Up to 1995 conditions per place. [2022-12-06 03:58:07,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 560 places, 1713 transitions, 68963 flow [2022-12-06 03:58:07,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 5128 [2022-12-06 03:58:07,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] L695-5-->L695-5: Formula: (and (= (+ (* 21 v_~prev~0_377) (* 3 v_~prev~0_376) (* 34 v_~cur~0_320)) (* 2 v_~next~0_192)) (= v_~next~0_192 v_~cur~0_319) (= v_~q~0_379 (+ v_~q~0_381 3)) (= (* 3 v_~i~0_533) (+ (* v_~j~0_543 2) v_~i~0_534)) (= v_~p~0_382 (+ v_~p~0_383 2)) (< v_~x~0_361 1) (= v_~x~0_360 (+ 12 v_~x~0_361)) (= (* 5 v_~prev~0_376) (+ (* v_~prev~0_377 13) (* 21 v_~cur~0_320) (* 3 v_~next~0_192))) (< v_~p~0_382 6) (< v_~q~0_381 3) (= v_~j~0_543 (+ v_~j~0_545 (* 2 v_~i~0_534) v_~i~0_533))) InVars {~j~0=v_~j~0_545, ~prev~0=v_~prev~0_377, ~i~0=v_~i~0_534, ~q~0=v_~q~0_381, ~p~0=v_~p~0_383, ~cur~0=v_~cur~0_320, ~x~0=v_~x~0_361} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_225|, ~j~0=v_~j~0_543, ~next~0=v_~next~0_192, ~prev~0=v_~prev~0_376, ~i~0=v_~i~0_533, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_268|, ~q~0=v_~q~0_379, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_272|, ~p~0=v_~p~0_382, ~cur~0=v_~cur~0_319, ~x~0=v_~x~0_360} 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:58:07,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:58:07,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1879 [2022-12-06 03:58:07,277 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 1713 transitions, 69033 flow [2022-12-06 03:58:07,277 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:58:07,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:58:07,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:58:07,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-06 03:58:07,482 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,SelfDestructingSolverStorable47 [2022-12-06 03:58:07,483 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:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:58:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 552403682, now seen corresponding path program 1 times [2022-12-06 03:58:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:58:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653284197] [2022-12-06 03:58:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:58:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:07,597 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:58:07,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:58:07,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653284197] [2022-12-06 03:58:07,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653284197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:58:07,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639345552] [2022-12-06 03:58:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:58:07,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:58:07,612 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:58:07,624 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:58:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:07,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:58:07,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:58:07,819 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:58:07,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:58:07,991 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:58:07,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639345552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:58:07,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:58:07,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:58:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189027088] [2022-12-06 03:58:07,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:58:07,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:58:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:58:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:58:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:58:07,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 03:58:07,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 1713 transitions, 69033 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:58:07,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:58:07,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 03:58:07,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:58:16,964 INFO L130 PetriNetUnfolder]: 6468/11362 cut-off events. [2022-12-06 03:58:16,964 INFO L131 PetriNetUnfolder]: For 2323027/2323027 co-relation queries the response was YES. [2022-12-06 03:58:17,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182411 conditions, 11362 events. 6468/11362 cut-off events. For 2323027/2323027 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 92742 event pairs, 1564 based on Foata normal form. 26/11386 useless extension candidates. Maximal degree in co-relation 182215. Up to 10070 conditions per place. [2022-12-06 03:58:17,154 INFO L137 encePairwiseOnDemand]: 15/69 looper letters, 1510 selfloop transitions, 311 changer transitions 26/1847 dead transitions. [2022-12-06 03:58:17,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 1847 transitions, 74698 flow [2022-12-06 03:58:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:58:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:58:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 142 transitions. [2022-12-06 03:58:17,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13719806763285025 [2022-12-06 03:58:17,156 INFO L175 Difference]: Start difference. First operand has 560 places, 1713 transitions, 69033 flow. Second operand 15 states and 142 transitions. [2022-12-06 03:58:17,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 1847 transitions, 74698 flow [2022-12-06 03:58:34,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 1847 transitions, 73824 flow, removed 359 selfloop flow, removed 12 redundant places. [2022-12-06 03:58:34,854 INFO L231 Difference]: Finished difference. Result has 566 places, 1718 transitions, 69394 flow [2022-12-06 03:58:34,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=68191, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=69394, PETRI_PLACES=566, PETRI_TRANSITIONS=1718} [2022-12-06 03:58:34,856 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 548 predicate places. [2022-12-06 03:58:34,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:58:34,856 INFO L89 Accepts]: Start accepts. Operand has 566 places, 1718 transitions, 69394 flow [2022-12-06 03:58:34,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:58:34,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:58:34,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 566 places, 1718 transitions, 69394 flow [2022-12-06 03:58:34,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 565 places, 1718 transitions, 69394 flow [2022-12-06 03:58:36,363 INFO L130 PetriNetUnfolder]: 1300/3604 cut-off events. [2022-12-06 03:58:36,364 INFO L131 PetriNetUnfolder]: For 870507/870955 co-relation queries the response was YES. [2022-12-06 03:58:36,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73066 conditions, 3604 events. 1300/3604 cut-off events. For 870507/870955 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 37292 event pairs, 19 based on Foata normal form. 20/3623 useless extension candidates. Maximal degree in co-relation 72870. Up to 1992 conditions per place. [2022-12-06 03:58:36,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 565 places, 1718 transitions, 69394 flow [2022-12-06 03:58:36,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 5128 [2022-12-06 03:58:36,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] L695-5-->L687-5: Formula: (and (= (* 2 v_~next~0_197) (+ (* 34 v_~cur~0_329) (* 3 v_~prev~0_386) (* 21 v_~prev~0_387))) (= v_~q~0_394 (+ v_~q~0_395 3)) (= (* 3 v_~i~0_551) (+ (* v_~j~0_561 5) v_~i~0_553)) (= v_~p~0_399 (+ v_~p~0_401 3)) (= (* 5 v_~prev~0_386) (+ (* 3 v_~next~0_197) (* v_~prev~0_387 13) (* 21 v_~cur~0_329))) (= v_~next~0_197 v_~cur~0_328) (< v_~x~0_371 1) (< v_~p~0_399 6) (= (+ 12 v_~x~0_371) v_~x~0_370) (= (* v_~j~0_561 2) (+ v_~j~0_562 (* 2 v_~i~0_553) v_~i~0_551)) (< v_~q~0_395 3)) InVars {~j~0=v_~j~0_562, ~prev~0=v_~prev~0_387, ~i~0=v_~i~0_553, ~q~0=v_~q~0_395, ~p~0=v_~p~0_401, ~cur~0=v_~cur~0_329, ~x~0=v_~x~0_371} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_231|, ~j~0=v_~j~0_561, ~next~0=v_~next~0_197, ~prev~0=v_~prev~0_386, ~i~0=v_~i~0_551, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_279|, ~q~0=v_~q~0_394, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_283|, ~p~0=v_~p~0_399, ~cur~0=v_~cur~0_328, ~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] 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:36,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [436] L695-5-->L687-5: Formula: (and (= (+ 12 v_~x~0_381) v_~x~0_380) (= (* 3 v_~i~0_567) (+ (* v_~j~0_581 8) v_~i~0_569)) (= (+ v_~j~0_582 (* 2 v_~i~0_569) v_~i~0_567) (* v_~j~0_581 3)) (= v_~p~0_412 (+ v_~p~0_414 4)) (= v_~q~0_413 (+ v_~q~0_414 3)) (= (* 5 v_~prev~0_396) (+ (* 3 v_~next~0_202) (* 21 v_~cur~0_338) (* v_~prev~0_397 13))) (= v_~next~0_202 v_~cur~0_337) (< v_~q~0_414 3) (= (* 2 v_~next~0_202) (+ (* 3 v_~prev~0_396) (* 21 v_~prev~0_397) (* 34 v_~cur~0_338))) (< v_~p~0_412 6) (< v_~x~0_381 1)) InVars {~j~0=v_~j~0_582, ~prev~0=v_~prev~0_397, ~i~0=v_~i~0_569, ~q~0=v_~q~0_414, ~p~0=v_~p~0_414, ~cur~0=v_~cur~0_338, ~x~0=v_~x~0_381} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_237|, ~j~0=v_~j~0_581, ~next~0=v_~next~0_202, ~prev~0=v_~prev~0_396, ~i~0=v_~i~0_567, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_288|, ~q~0=v_~q~0_413, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_296|, ~p~0=v_~p~0_412, ~cur~0=v_~cur~0_337, ~x~0=v_~x~0_380} 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:36,983 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:58:36,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2128 [2022-12-06 03:58:36,984 INFO L495 AbstractCegarLoop]: Abstraction has has 566 places, 1718 transitions, 69570 flow [2022-12-06 03:58:36,984 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:58:36,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:58:36,984 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:58:36,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-06 03:58:37,189 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,SelfDestructingSolverStorable48 [2022-12-06 03:58:37,189 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:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:58:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash 552510353, now seen corresponding path program 1 times [2022-12-06 03:58:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:58:37,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112588954] [2022-12-06 03:58:37,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:58:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:37,270 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:58:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:58:37,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112588954] [2022-12-06 03:58:37,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112588954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:58:37,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284940304] [2022-12-06 03:58:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:37,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:58:37,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:58:37,272 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:58:37,274 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:58:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:37,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:58:37,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:58:37,436 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:58:37,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:58:38,581 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:58:38,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284940304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:58:38,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:58:38,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:58:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251229018] [2022-12-06 03:58:38,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:58:38,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:58:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:58:38,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:58:38,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:58:38,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 03:58:38,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 1718 transitions, 69570 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:58:38,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:58:38,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 03:58:38,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:58:55,926 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:58:57,984 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:59:00,122 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:59:02,272 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:59:04,332 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:59:06,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:59:08,508 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:59:10,573 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:59:12,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:59:14,326 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:59:16,364 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:59:18,534 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:59:20,741 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:59:30,099 INFO L130 PetriNetUnfolder]: 6460/11364 cut-off events. [2022-12-06 03:59:30,100 INFO L131 PetriNetUnfolder]: For 2381387/2381387 co-relation queries the response was YES. [2022-12-06 03:59:30,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183848 conditions, 11364 events. 6460/11364 cut-off events. For 2381387/2381387 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 92961 event pairs, 1858 based on Foata normal form. 12/11374 useless extension candidates. Maximal degree in co-relation 183649. Up to 10480 conditions per place. [2022-12-06 03:59:30,326 INFO L137 encePairwiseOnDemand]: 17/73 looper letters, 1567 selfloop transitions, 217 changer transitions 51/1835 dead transitions. [2022-12-06 03:59:30,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 1835 transitions, 74837 flow [2022-12-06 03:59:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:59:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:59:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 155 transitions. [2022-12-06 03:59:30,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11796042617960426 [2022-12-06 03:59:30,331 INFO L175 Difference]: Start difference. First operand has 566 places, 1718 transitions, 69570 flow. Second operand 18 states and 155 transitions. [2022-12-06 03:59:30,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 1835 transitions, 74837 flow [2022-12-06 03:59:50,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 1835 transitions, 74504 flow, removed 59 selfloop flow, removed 8 redundant places. [2022-12-06 03:59:50,606 INFO L231 Difference]: Finished difference. Result has 578 places, 1710 transitions, 69450 flow [2022-12-06 03:59:50,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=69237, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=69450, PETRI_PLACES=578, PETRI_TRANSITIONS=1710} [2022-12-06 03:59:50,608 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 560 predicate places. [2022-12-06 03:59:50,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:59:50,608 INFO L89 Accepts]: Start accepts. Operand has 578 places, 1710 transitions, 69450 flow [2022-12-06 03:59:50,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:59:50,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:59:50,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 578 places, 1710 transitions, 69450 flow [2022-12-06 03:59:50,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 574 places, 1710 transitions, 69450 flow [2022-12-06 03:59:52,771 INFO L130 PetriNetUnfolder]: 1293/3599 cut-off events. [2022-12-06 03:59:52,772 INFO L131 PetriNetUnfolder]: For 893752/894162 co-relation queries the response was YES. [2022-12-06 03:59:52,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73371 conditions, 3599 events. 1293/3599 cut-off events. For 893752/894162 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 37272 event pairs, 20 based on Foata normal form. 20/3618 useless extension candidates. Maximal degree in co-relation 73171. Up to 1981 conditions per place. [2022-12-06 03:59:52,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 574 places, 1710 transitions, 69450 flow [2022-12-06 03:59:52,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 5104 [2022-12-06 03:59:53,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:59:53,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2536 [2022-12-06 03:59:53,144 INFO L495 AbstractCegarLoop]: Abstraction has has 573 places, 1709 transitions, 69422 flow [2022-12-06 03:59:53,144 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:59:53,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:59:53,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:59:53,164 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:59:53,348 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,SelfDestructingSolverStorable49 [2022-12-06 03:59:53,349 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:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:59:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash 17826756, now seen corresponding path program 1 times [2022-12-06 03:59:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:59:53,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313463673] [2022-12-06 03:59:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:59:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:53,433 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:59:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:59:53,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313463673] [2022-12-06 03:59:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313463673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:59:53,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:59:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:59:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958312878] [2022-12-06 03:59:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:59:53,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:59:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:59:53,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:59:53,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:59:53,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 03:59:53,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 1709 transitions, 69422 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 03:59:53,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:59:53,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 03:59:53,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:00:03,551 INFO L130 PetriNetUnfolder]: 6430/11292 cut-off events. [2022-12-06 04:00:03,552 INFO L131 PetriNetUnfolder]: For 2382064/2382064 co-relation queries the response was YES. [2022-12-06 04:00:03,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183811 conditions, 11292 events. 6430/11292 cut-off events. For 2382064/2382064 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 92332 event pairs, 2133 based on Foata normal form. 4/11294 useless extension candidates. Maximal degree in co-relation 183608. Up to 11055 conditions per place. [2022-12-06 04:00:03,904 INFO L137 encePairwiseOnDemand]: 28/70 looper letters, 1656 selfloop transitions, 76 changer transitions 13/1745 dead transitions. [2022-12-06 04:00:03,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1745 transitions, 73300 flow [2022-12-06 04:00:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:00:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:00:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 04:00:03,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2571428571428571 [2022-12-06 04:00:03,905 INFO L175 Difference]: Start difference. First operand has 573 places, 1709 transitions, 69422 flow. Second operand 5 states and 90 transitions. [2022-12-06 04:00:03,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 1745 transitions, 73300 flow [2022-12-06 04:00:25,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 1745 transitions, 73012 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-12-06 04:00:25,923 INFO L231 Difference]: Finished difference. Result has 569 places, 1707 transitions, 69200 flow [2022-12-06 04:00:25,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=69134, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69200, PETRI_PLACES=569, PETRI_TRANSITIONS=1707} [2022-12-06 04:00:25,924 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 551 predicate places. [2022-12-06 04:00:25,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:00:25,924 INFO L89 Accepts]: Start accepts. Operand has 569 places, 1707 transitions, 69200 flow [2022-12-06 04:00:25,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:00:25,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:00:25,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 569 places, 1707 transitions, 69200 flow [2022-12-06 04:00:25,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 569 places, 1707 transitions, 69200 flow [2022-12-06 04:00:28,179 INFO L130 PetriNetUnfolder]: 1290/3594 cut-off events. [2022-12-06 04:00:28,179 INFO L131 PetriNetUnfolder]: For 904883/905297 co-relation queries the response was YES. [2022-12-06 04:00:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73314 conditions, 3594 events. 1290/3594 cut-off events. For 904883/905297 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 37226 event pairs, 21 based on Foata normal form. 20/3613 useless extension candidates. Maximal degree in co-relation 73113. Up to 1978 conditions per place. [2022-12-06 04:00:28,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 569 places, 1707 transitions, 69200 flow [2022-12-06 04:00:28,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 5100 [2022-12-06 04:00:28,301 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:00:28,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2377 [2022-12-06 04:00:28,301 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 1707 transitions, 69200 flow [2022-12-06 04:00:28,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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:00:28,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:00:28,301 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:00:28,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 04:00:28,301 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 04:00:28,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:00:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash 552581870, now seen corresponding path program 1 times [2022-12-06 04:00:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:00:28,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917474591] [2022-12-06 04:00:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:00:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:28,554 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 04:00:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:00:28,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917474591] [2022-12-06 04:00:28,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917474591] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:00:28,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646403475] [2022-12-06 04:00:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:00:28,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:00:28,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:00:28,556 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 04:00:28,560 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 04:00:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:00:28,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 04:00:28,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:00:28,755 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 04:00:28,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:00:29,337 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 04:00:29,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646403475] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:00:29,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:00:29,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 04:00:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899919903] [2022-12-06 04:00:29,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:00:29,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 04:00:29,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:00:29,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 04:00:29,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 04:00:29,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 04:00:29,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 1707 transitions, 69200 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 04:00:29,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:00:29,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 04:00:29,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:00:42,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:00:46,133 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:00:48,333 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:00:50,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:03,278 INFO L130 PetriNetUnfolder]: 6427/11285 cut-off events. [2022-12-06 04:01:03,278 INFO L131 PetriNetUnfolder]: For 2427916/2427916 co-relation queries the response was YES. [2022-12-06 04:01:03,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183830 conditions, 11285 events. 6427/11285 cut-off events. For 2427916/2427916 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 92034 event pairs, 1906 based on Foata normal form. 4/11287 useless extension candidates. Maximal degree in co-relation 183626. Up to 10653 conditions per place. [2022-12-06 04:01:03,480 INFO L137 encePairwiseOnDemand]: 19/69 looper letters, 1605 selfloop transitions, 168 changer transitions 25/1798 dead transitions. [2022-12-06 04:01:03,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 1798 transitions, 73814 flow [2022-12-06 04:01:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 04:01:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 04:01:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 143 transitions. [2022-12-06 04:01:03,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12190963341858482 [2022-12-06 04:01:03,481 INFO L175 Difference]: Start difference. First operand has 569 places, 1707 transitions, 69200 flow. Second operand 17 states and 143 transitions. [2022-12-06 04:01:03,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 1798 transitions, 73814 flow [2022-12-06 04:01:18,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 1798 transitions, 73605 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-06 04:01:18,431 INFO L231 Difference]: Finished difference. Result has 580 places, 1704 transitions, 69200 flow [2022-12-06 04:01:18,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=68991, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=69200, PETRI_PLACES=580, PETRI_TRANSITIONS=1704} [2022-12-06 04:01:18,440 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 562 predicate places. [2022-12-06 04:01:18,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:01:18,440 INFO L89 Accepts]: Start accepts. Operand has 580 places, 1704 transitions, 69200 flow [2022-12-06 04:01:18,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:01:18,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:01:18,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 580 places, 1704 transitions, 69200 flow [2022-12-06 04:01:18,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 580 places, 1704 transitions, 69200 flow [2022-12-06 04:01:21,051 INFO L130 PetriNetUnfolder]: 1289/3575 cut-off events. [2022-12-06 04:01:21,051 INFO L131 PetriNetUnfolder]: For 909686/910089 co-relation queries the response was YES. [2022-12-06 04:01:21,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73220 conditions, 3575 events. 1289/3575 cut-off events. For 909686/910089 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 36947 event pairs, 21 based on Foata normal form. 20/3594 useless extension candidates. Maximal degree in co-relation 73020. Up to 1975 conditions per place. [2022-12-06 04:01:21,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 580 places, 1704 transitions, 69200 flow [2022-12-06 04:01:21,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 5096 [2022-12-06 04:01:21,201 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:01:21,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2762 [2022-12-06 04:01:21,202 INFO L495 AbstractCegarLoop]: Abstraction has has 580 places, 1704 transitions, 69200 flow [2022-12-06 04:01:21,202 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 04:01:21,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:01:21,202 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:01:21,207 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 04:01:21,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:01:21,406 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:01:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:01:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 882825494, now seen corresponding path program 1 times [2022-12-06 04:01:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:01:21,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001829802] [2022-12-06 04:01:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:01:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:21,536 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:01:21,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:01:21,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001829802] [2022-12-06 04:01:21,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001829802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:01:21,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051207792] [2022-12-06 04:01:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:01:21,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:01:21,538 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 04:01:21,540 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 04:01:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:21,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 04:01:21,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:01:21,746 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:01:21,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:01:22,045 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:01:22,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051207792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:01:22,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:01:22,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:01:22,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149869596] [2022-12-06 04:01:22,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:01:22,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:01:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:01:22,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:01:22,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:01:22,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 04:01:22,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 1704 transitions, 69200 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:01:22,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:01:22,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 04:01:22,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:01:39,482 INFO L130 PetriNetUnfolder]: 6569/11617 cut-off events. [2022-12-06 04:01:39,482 INFO L131 PetriNetUnfolder]: For 2968574/2968574 co-relation queries the response was YES. [2022-12-06 04:01:39,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188191 conditions, 11617 events. 6569/11617 cut-off events. For 2968574/2968574 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 95757 event pairs, 1090 based on Foata normal form. 98/11713 useless extension candidates. Maximal degree in co-relation 187988. Up to 8710 conditions per place. [2022-12-06 04:01:39,653 INFO L137 encePairwiseOnDemand]: 9/68 looper letters, 1254 selfloop transitions, 705 changer transitions 70/2029 dead transitions. [2022-12-06 04:01:39,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 2029 transitions, 80489 flow [2022-12-06 04:01:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 04:01:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 04:01:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 226 transitions. [2022-12-06 04:01:39,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08982511923688394 [2022-12-06 04:01:39,654 INFO L175 Difference]: Start difference. First operand has 580 places, 1704 transitions, 69200 flow. Second operand 37 states and 226 transitions. [2022-12-06 04:01:39,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 2029 transitions, 80489 flow [2022-12-06 04:01:54,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 2029 transitions, 80285 flow, removed 15 selfloop flow, removed 10 redundant places. [2022-12-06 04:01:54,333 INFO L231 Difference]: Finished difference. Result has 611 places, 1772 transitions, 74988 flow [2022-12-06 04:01:54,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=68996, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=638, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=74988, PETRI_PLACES=611, PETRI_TRANSITIONS=1772} [2022-12-06 04:01:54,334 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 593 predicate places. [2022-12-06 04:01:54,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:01:54,334 INFO L89 Accepts]: Start accepts. Operand has 611 places, 1772 transitions, 74988 flow [2022-12-06 04:01:54,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:01:54,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:01:54,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 611 places, 1772 transitions, 74988 flow [2022-12-06 04:01:54,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 611 places, 1772 transitions, 74988 flow [2022-12-06 04:01:56,366 INFO L130 PetriNetUnfolder]: 1309/3675 cut-off events. [2022-12-06 04:01:56,367 INFO L131 PetriNetUnfolder]: For 931436/931875 co-relation queries the response was YES. [2022-12-06 04:01:56,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76573 conditions, 3675 events. 1309/3675 cut-off events. For 931436/931875 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 38381 event pairs, 16 based on Foata normal form. 18/3692 useless extension candidates. Maximal degree in co-relation 76369. Up to 2043 conditions per place. [2022-12-06 04:01:56,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 611 places, 1772 transitions, 74988 flow [2022-12-06 04:01:56,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 5206 [2022-12-06 04:01:56,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L705-6-->L687-5: Formula: (and (< v_~x~0_273 1) (= v_~next~0_148 v_~cur~0_241) (< v_~p~0_221 2) (= v_~p~0_219 (+ v_~p~0_221 4)) (= (+ 12 v_~x~0_273) v_~x~0_272) (= (+ (* 3 v_~next~0_148) (* 21 v_~cur~0_242) (* v_~prev~0_289 13)) (* 5 v_~prev~0_288)) (= (+ (* 3 v_~prev~0_288) (* 34 v_~cur~0_242) (* 21 v_~prev~0_289)) (* 2 v_~next~0_148)) (= (+ v_~i~0_337 (* v_~j~0_339 4)) v_~i~0_335)) InVars {~j~0=v_~j~0_339, ~prev~0=v_~prev~0_289, ~i~0=v_~i~0_337, ~p~0=v_~p~0_221, ~cur~0=v_~cur~0_242, ~x~0=v_~x~0_273} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_171|, ~j~0=v_~j~0_339, ~next~0=v_~next~0_148, ~prev~0=v_~prev~0_288, ~i~0=v_~i~0_335, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_159|, ~p~0=v_~p~0_219, ~cur~0=v_~cur~0_241, ~x~0=v_~x~0_272} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~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:01:56,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L695-5-->L695-5: Formula: (and (= v_~x~0_366 (+ 12 v_~x~0_367)) (= (* 5 v_~i~0_547) (+ (* v_~j~0_555 2) v_~i~0_548)) (= v_~p~0_395 (+ v_~p~0_396 2)) (< v_~q~0_388 6) (= v_~j~0_555 (+ v_~j~0_557 (* 2 v_~i~0_548) (* 2 v_~i~0_547))) (= (+ (* 3 v_~next~0_195) (* v_~prev~0_383 13) (* 21 v_~cur~0_325)) (* 5 v_~prev~0_382)) (< v_~x~0_367 1) (< v_~p~0_395 6) (= v_~next~0_195 v_~cur~0_324) (= v_~q~0_388 (+ v_~q~0_390 4)) (= (* 2 v_~next~0_195) (+ (* 34 v_~cur~0_325) (* 3 v_~prev~0_382) (* 21 v_~prev~0_383)))) InVars {~j~0=v_~j~0_557, ~prev~0=v_~prev~0_383, ~i~0=v_~i~0_548, ~q~0=v_~q~0_390, ~p~0=v_~p~0_396, ~cur~0=v_~cur~0_325, ~x~0=v_~x~0_367} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_229|, ~j~0=v_~j~0_555, ~next~0=v_~next~0_195, ~prev~0=v_~prev~0_382, ~i~0=v_~i~0_547, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_277|, ~q~0=v_~q~0_388, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_279|, ~p~0=v_~p~0_395, ~cur~0=v_~cur~0_324, ~x~0=v_~x~0_366} 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:01:56,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L705-6-->L687-5: Formula: (and (= (* 5 v_~prev~0_284) (+ (* 21 v_~cur~0_238) (* 3 v_~next~0_146) (* v_~prev~0_285 13))) (= v_~next~0_146 v_~cur~0_237) (= (* 2 v_~next~0_146) (+ (* 21 v_~prev~0_285) (* 3 v_~prev~0_284) (* 34 v_~cur~0_238))) (= (+ 12 v_~x~0_269) v_~x~0_268) (< v_~p~0_215 3) (= (+ (* v_~j~0_337 3) v_~i~0_331) v_~i~0_329) (= v_~p~0_213 (+ v_~p~0_215 3)) (< v_~x~0_269 1)) InVars {~j~0=v_~j~0_337, ~prev~0=v_~prev~0_285, ~i~0=v_~i~0_331, ~p~0=v_~p~0_215, ~cur~0=v_~cur~0_238, ~x~0=v_~x~0_269} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_169|, ~j~0=v_~j~0_337, ~next~0=v_~next~0_146, ~prev~0=v_~prev~0_284, ~i~0=v_~i~0_329, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_155|, ~p~0=v_~p~0_213, ~cur~0=v_~cur~0_237, ~x~0=v_~x~0_268} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~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:01:57,062 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [444] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_411) v_~x~0_410) (= v_~j~0_635 (+ v_~j~0_636 v_~i~0_613)) (= v_~next~0_217 v_~cur~0_364) (= (+ (* v_~prev~0_427 13) (* 21 v_~cur~0_365) (* 3 v_~next~0_217)) (* 5 v_~prev~0_426)) (= (+ (* 3 v_~prev~0_426) (* 34 v_~cur~0_365) (* 21 v_~prev~0_427)) (* 2 v_~next~0_217)) (= v_~p~0_451 (+ v_~p~0_452 3)) (< v_~x~0_411 1) (= (+ v_~q~0_464 1) v_~q~0_463) (= (+ (* v_~j~0_636 3) v_~i~0_614) v_~i~0_613) (< v_~q~0_464 5) (< v_~p~0_452 3)) InVars {~j~0=v_~j~0_636, ~prev~0=v_~prev~0_427, ~i~0=v_~i~0_614, ~q~0=v_~q~0_464, ~p~0=v_~p~0_452, ~cur~0=v_~cur~0_365, ~x~0=v_~x~0_411} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_255|, ~j~0=v_~j~0_635, ~next~0=v_~next~0_217, ~prev~0=v_~prev~0_426, ~i~0=v_~i~0_613, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_315|, ~q~0=v_~q~0_463, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_330|, ~p~0=v_~p~0_451, ~cur~0=v_~cur~0_364, ~x~0=v_~x~0_410} 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:01:57,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [441] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_403) v_~x~0_402) (< v_~x~0_403 1) (< v_~q~0_450 5) (= (+ (* v_~prev~0_419 13) (* 3 v_~next~0_213) (* 21 v_~cur~0_357)) (* 5 v_~prev~0_418)) (= (+ (* 34 v_~cur~0_357) (* 21 v_~prev~0_419) (* 3 v_~prev~0_418)) (* 2 v_~next~0_213)) (= (+ (* v_~j~0_622 4) v_~i~0_602) v_~i~0_601) (= v_~next~0_213 v_~cur~0_356) (< v_~p~0_442 2) (= (+ v_~p~0_442 4) v_~p~0_441) (= v_~j~0_621 (+ v_~j~0_622 v_~i~0_601)) (= (+ v_~q~0_450 1) v_~q~0_449)) InVars {~j~0=v_~j~0_622, ~prev~0=v_~prev~0_419, ~i~0=v_~i~0_602, ~q~0=v_~q~0_450, ~p~0=v_~p~0_442, ~cur~0=v_~cur~0_357, ~x~0=v_~x~0_403} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_251|, ~j~0=v_~j~0_621, ~next~0=v_~next~0_213, ~prev~0=v_~prev~0_418, ~i~0=v_~i~0_601, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_309|, ~q~0=v_~q~0_449, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_322|, ~p~0=v_~p~0_441, ~cur~0=v_~cur~0_356, ~x~0=v_~x~0_402} 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:01:57,284 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 04:01:57,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2951 [2022-12-06 04:01:57,285 INFO L495 AbstractCegarLoop]: Abstraction has has 607 places, 1768 transitions, 74979 flow [2022-12-06 04:01:57,285 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:57,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:01:57,285 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:01:57,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-06 04:01:57,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:01:57,490 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:01:57,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:01:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1824591905, now seen corresponding path program 1 times [2022-12-06 04:01:57,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:01:57,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516814244] [2022-12-06 04:01:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:57,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:01:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:57,595 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 04:01:57,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:01:57,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516814244] [2022-12-06 04:01:57,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516814244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:01:57,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358480127] [2022-12-06 04:01:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:57,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:01:57,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:01:57,597 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 04:01:57,599 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 04:01:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:57,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 04:01:57,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:01:57,832 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 04:01:57,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:01:58,075 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 04:01:58,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358480127] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:01:58,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:01:58,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:01:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817098609] [2022-12-06 04:01:58,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:01:58,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:01:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:01:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:01:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:01:58,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 04:01:58,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 1768 transitions, 74979 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:01:58,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:01:58,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 04:01:58,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:02:15,345 INFO L130 PetriNetUnfolder]: 6619/11745 cut-off events. [2022-12-06 04:02:15,346 INFO L131 PetriNetUnfolder]: For 3044585/3044585 co-relation queries the response was YES. [2022-12-06 04:02:15,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193283 conditions, 11745 events. 6619/11745 cut-off events. For 3044585/3044585 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 97503 event pairs, 1060 based on Foata normal form. 92/11835 useless extension candidates. Maximal degree in co-relation 193076. Up to 8637 conditions per place. [2022-12-06 04:02:15,516 INFO L137 encePairwiseOnDemand]: 9/70 looper letters, 1311 selfloop transitions, 714 changer transitions 38/2063 dead transitions. [2022-12-06 04:02:15,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 2063 transitions, 85140 flow [2022-12-06 04:02:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 04:02:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 04:02:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 217 transitions. [2022-12-06 04:02:15,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.096875 [2022-12-06 04:02:15,517 INFO L175 Difference]: Start difference. First operand has 607 places, 1768 transitions, 74979 flow. Second operand 32 states and 217 transitions. [2022-12-06 04:02:15,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 2063 transitions, 85140 flow [2022-12-06 04:02:31,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 2063 transitions, 84351 flow, removed 275 selfloop flow, removed 21 redundant places. [2022-12-06 04:02:31,894 INFO L231 Difference]: Finished difference. Result has 625 places, 1816 transitions, 79113 flow [2022-12-06 04:02:31,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=74190, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=668, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=79113, PETRI_PLACES=625, PETRI_TRANSITIONS=1816} [2022-12-06 04:02:31,896 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 607 predicate places. [2022-12-06 04:02:31,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:02:31,896 INFO L89 Accepts]: Start accepts. Operand has 625 places, 1816 transitions, 79113 flow [2022-12-06 04:02:31,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:02:31,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:02:31,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 625 places, 1816 transitions, 79113 flow [2022-12-06 04:02:31,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 625 places, 1816 transitions, 79113 flow [2022-12-06 04:02:34,487 INFO L130 PetriNetUnfolder]: 1327/3760 cut-off events. [2022-12-06 04:02:34,488 INFO L131 PetriNetUnfolder]: For 975790/976253 co-relation queries the response was YES. [2022-12-06 04:02:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79480 conditions, 3760 events. 1327/3760 cut-off events. For 975790/976253 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 39576 event pairs, 17 based on Foata normal form. 18/3777 useless extension candidates. Maximal degree in co-relation 79267. Up to 2102 conditions per place. [2022-12-06 04:02:34,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 625 places, 1816 transitions, 79113 flow [2022-12-06 04:02:34,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 5320 [2022-12-06 04:02:34,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (not (< v_~x~0_35 12)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] 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:02:34,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (not (< v_~x~0_35 12)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] 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:02:34,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (not (< v_~x~0_35 12)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] 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:02:34,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:02:34,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2998 [2022-12-06 04:02:34,894 INFO L495 AbstractCegarLoop]: Abstraction has has 625 places, 1816 transitions, 79806 flow [2022-12-06 04:02:34,894 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:02:34,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:02:34,894 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:02:34,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-12-06 04:02:35,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:35,094 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:02:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:02:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash -40983764, now seen corresponding path program 1 times [2022-12-06 04:02:35,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:02:35,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115221896] [2022-12-06 04:02:35,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:35,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:02:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:35,226 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 04:02:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:02:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115221896] [2022-12-06 04:02:35,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115221896] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:02:35,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813357350] [2022-12-06 04:02:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:35,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:02:35,228 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 04:02:35,230 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 04:02:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:35,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 04:02:35,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:02:35,417 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 04:02:35,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:02:35,701 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 04:02:35,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813357350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:02:35,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:02:35,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 04:02:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833225959] [2022-12-06 04:02:35,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:02:35,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:02:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:02:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:02:35,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-06 04:02:35,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 04:02:35,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 1816 transitions, 79806 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 04:02:35,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:02:35,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 04:02:35,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:02:46,681 INFO L130 PetriNetUnfolder]: 6611/11751 cut-off events. [2022-12-06 04:02:46,682 INFO L131 PetriNetUnfolder]: For 2704858/2704858 co-relation queries the response was YES. [2022-12-06 04:02:46,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197575 conditions, 11751 events. 6611/11751 cut-off events. For 2704858/2704858 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 97957 event pairs, 1804 based on Foata normal form. 8/11757 useless extension candidates. Maximal degree in co-relation 197359. Up to 10472 conditions per place. [2022-12-06 04:02:46,956 INFO L137 encePairwiseOnDemand]: 20/73 looper letters, 1597 selfloop transitions, 330 changer transitions 43/1970 dead transitions. [2022-12-06 04:02:46,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 1970 transitions, 85993 flow [2022-12-06 04:02:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 04:02:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 04:02:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2022-12-06 04:02:46,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09988584474885845 [2022-12-06 04:02:46,958 INFO L175 Difference]: Start difference. First operand has 625 places, 1816 transitions, 79806 flow. Second operand 24 states and 175 transitions. [2022-12-06 04:02:46,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 1970 transitions, 85993 flow [2022-12-06 04:03:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 1970 transitions, 84002 flow, removed 928 selfloop flow, removed 10 redundant places. [2022-12-06 04:03:11,494 INFO L231 Difference]: Finished difference. Result has 641 places, 1818 transitions, 78978 flow [2022-12-06 04:03:11,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=77825, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=319, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=78978, PETRI_PLACES=641, PETRI_TRANSITIONS=1818} [2022-12-06 04:03:11,495 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 623 predicate places. [2022-12-06 04:03:11,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:03:11,496 INFO L89 Accepts]: Start accepts. Operand has 641 places, 1818 transitions, 78978 flow [2022-12-06 04:03:11,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:03:11,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:03:11,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 641 places, 1818 transitions, 78978 flow [2022-12-06 04:03:11,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 641 places, 1818 transitions, 78978 flow [2022-12-06 04:03:13,610 INFO L130 PetriNetUnfolder]: 1322/3754 cut-off events. [2022-12-06 04:03:13,611 INFO L131 PetriNetUnfolder]: For 967560/968016 co-relation queries the response was YES. [2022-12-06 04:03:13,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79030 conditions, 3754 events. 1322/3754 cut-off events. For 967560/968016 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 39501 event pairs, 18 based on Foata normal form. 18/3771 useless extension candidates. Maximal degree in co-relation 78814. Up to 2094 conditions per place. [2022-12-06 04:03:13,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 641 places, 1818 transitions, 78978 flow [2022-12-06 04:03:13,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 5308 [2022-12-06 04:03:13,933 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:03:13,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2438 [2022-12-06 04:03:13,934 INFO L495 AbstractCegarLoop]: Abstraction has has 640 places, 1817 transitions, 78971 flow [2022-12-06 04:03:13,934 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 04:03:13,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:13,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:13,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-06 04:03:14,138 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,SelfDestructingSolverStorable54 [2022-12-06 04:03:14,138 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:03:14,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash 553016242, now seen corresponding path program 1 times [2022-12-06 04:03:14,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:14,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472372911] [2022-12-06 04:03:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:14,213 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 04:03:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:14,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472372911] [2022-12-06 04:03:14,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472372911] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:03:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997488335] [2022-12-06 04:03:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:03:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:03:14,215 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:03:14,216 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:03:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:14,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 04:03:14,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:03:14,586 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 04:03:14,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:03:15,108 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 04:03:15,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997488335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:03:15,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:03:15,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 04:03:15,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307753125] [2022-12-06 04:03:15,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:03:15,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 04:03:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:15,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 04:03:15,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 04:03:15,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 04:03:15,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 1817 transitions, 78971 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 04:03:15,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:15,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 04:03:15,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:23,993 WARN L233 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 94 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 04:03:31,295 WARN L233 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 92 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 04:03:37,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-06 04:03:43,383 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 [0] [2022-12-06 04:03:45,402 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 [0] [2022-12-06 04:03:47,439 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 [0] [2022-12-06 04:03:49,455 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 [0] [2022-12-06 04:03:51,509 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 [0] [2022-12-06 04:03:53,987 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 [0, 1] [2022-12-06 04:03:56,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:03:58,886 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:02,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:04:04,580 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 [0, 1] [2022-12-06 04:04:05,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:04:07,584 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 [0, 1] [2022-12-06 04:04:09,719 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 [0, 1] [2022-12-06 04:04:13,552 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 [0, 1] [2022-12-06 04:04:17,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:04:19,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:04:22,749 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 [0, 1] [2022-12-06 04:04:24,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:04:26,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 [0, 1] [2022-12-06 04:04:28,882 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 [0, 1] [2022-12-06 04:04:30,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:04:33,128 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 [0, 1] [2022-12-06 04:04:35,339 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 [0, 1] [2022-12-06 04:04:37,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 04:04:41,391 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 [0, 1] [2022-12-06 04:04:43,596 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 [0, 1] [2022-12-06 04:04:46,042 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 [0, 1] [2022-12-06 04:04:48,195 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 [0, 1] [2022-12-06 04:04:50,932 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 [0, 1] [2022-12-06 04:04:54,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:57,168 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 [0, 1] [2022-12-06 04:05:00,144 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 [0] [2022-12-06 04:05:10,628 INFO L130 PetriNetUnfolder]: 6596/11708 cut-off events. [2022-12-06 04:05:10,628 INFO L131 PetriNetUnfolder]: For 2600106/2600106 co-relation queries the response was YES. [2022-12-06 04:05:10,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195544 conditions, 11708 events. 6596/11708 cut-off events. For 2600106/2600106 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 97389 event pairs, 1931 based on Foata normal form. 4/11710 useless extension candidates. Maximal degree in co-relation 195325. Up to 10972 conditions per place. [2022-12-06 04:05:10,855 INFO L137 encePairwiseOnDemand]: 20/73 looper letters, 1705 selfloop transitions, 192 changer transitions 30/1927 dead transitions. [2022-12-06 04:05:10,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 1927 transitions, 84064 flow [2022-12-06 04:05:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 04:05:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 04:05:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 146 transitions. [2022-12-06 04:05:10,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.125 [2022-12-06 04:05:10,857 INFO L175 Difference]: Start difference. First operand has 640 places, 1817 transitions, 78971 flow. Second operand 16 states and 146 transitions. [2022-12-06 04:05:10,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 1927 transitions, 84064 flow [2022-12-06 04:05:30,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 1927 transitions, 83647 flow, removed 69 selfloop flow, removed 13 redundant places. [2022-12-06 04:05:30,056 INFO L231 Difference]: Finished difference. Result has 643 places, 1814 transitions, 78792 flow [2022-12-06 04:05:30,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=78558, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=78792, PETRI_PLACES=643, PETRI_TRANSITIONS=1814} [2022-12-06 04:05:30,057 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 625 predicate places. [2022-12-06 04:05:30,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:30,058 INFO L89 Accepts]: Start accepts. Operand has 643 places, 1814 transitions, 78792 flow [2022-12-06 04:05:30,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:30,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:30,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 643 places, 1814 transitions, 78792 flow [2022-12-06 04:05:30,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 642 places, 1814 transitions, 78792 flow [2022-12-06 04:05:31,876 INFO L130 PetriNetUnfolder]: 1323/3745 cut-off events. [2022-12-06 04:05:31,876 INFO L131 PetriNetUnfolder]: For 954692/955165 co-relation queries the response was YES. [2022-12-06 04:05:31,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78745 conditions, 3745 events. 1323/3745 cut-off events. For 954692/955165 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 39357 event pairs, 18 based on Foata normal form. 18/3762 useless extension candidates. Maximal degree in co-relation 78530. Up to 2086 conditions per place. [2022-12-06 04:05:31,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 642 places, 1814 transitions, 78792 flow [2022-12-06 04:05:31,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 5302 [2022-12-06 04:05:31,988 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:31,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1930 [2022-12-06 04:05:31,988 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 1814 transitions, 78792 flow [2022-12-06 04:05:31,993 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 04:05:31,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:31,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:32,000 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:05:32,197 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,SelfDestructingSolverStorable55 [2022-12-06 04:05:32,197 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:05:32,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1683661813, now seen corresponding path program 1 times [2022-12-06 04:05:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:32,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201440759] [2022-12-06 04:05:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:32,317 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 04:05:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:32,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201440759] [2022-12-06 04:05:32,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201440759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:32,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061910692] [2022-12-06 04:05:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:32,319 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:05:32,323 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:05:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:32,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 04:05:32,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:32,534 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 04:05:32,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:32,864 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 04:05:32,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061910692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:32,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:32,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:05:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132025376] [2022-12-06 04:05:32,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:32,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:05:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:32,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:05:32,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:05:32,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 04:05:32,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 1814 transitions, 78792 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:05:32,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:32,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 04:05:32,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:47,623 INFO L130 PetriNetUnfolder]: 7009/12449 cut-off events. [2022-12-06 04:05:47,623 INFO L131 PetriNetUnfolder]: For 3756354/3756354 co-relation queries the response was YES. [2022-12-06 04:05:47,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208825 conditions, 12449 events. 7009/12449 cut-off events. For 3756354/3756354 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 104515 event pairs, 885 based on Foata normal form. 142/12589 useless extension candidates. Maximal degree in co-relation 208607. Up to 8054 conditions per place. [2022-12-06 04:05:47,820 INFO L137 encePairwiseOnDemand]: 9/72 looper letters, 1217 selfloop transitions, 965 changer transitions 25/2207 dead transitions. [2022-12-06 04:05:47,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 2207 transitions, 93113 flow [2022-12-06 04:05:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 04:05:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 04:05:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 250 transitions. [2022-12-06 04:05:47,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10212418300653595 [2022-12-06 04:05:47,822 INFO L175 Difference]: Start difference. First operand has 642 places, 1814 transitions, 78792 flow. Second operand 34 states and 250 transitions. [2022-12-06 04:05:47,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 2207 transitions, 93113 flow Received shutdown request... [2022-12-06 04:06:01,610 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 04:06:01,622 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 04:06:01,622 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:06:01,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-06 04:06:01,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-06 04:06:01,815 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 04:06:01,817 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 04:06:01,817 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 04:06:01,817 INFO L458 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:01,819 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:06:01,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:06:01,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:06:01 BasicIcfg [2022-12-06 04:06:01,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:06:01,821 INFO L158 Benchmark]: Toolchain (without parser) took 850439.31ms. Allocated memory was 255.9MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 230.9MB in the beginning and 1.2GB in the end (delta: -919.7MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-06 04:06:01,821 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory was 232.0MB in the beginning and 231.9MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:06:01,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.42ms. Allocated memory is still 255.9MB. Free memory was 230.4MB in the beginning and 209.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 04:06:01,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.38ms. Allocated memory is still 255.9MB. Free memory was 209.9MB in the beginning and 208.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:06:01,821 INFO L158 Benchmark]: Boogie Preprocessor took 19.69ms. Allocated memory is still 255.9MB. Free memory was 207.8MB in the beginning and 206.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:06:01,821 INFO L158 Benchmark]: RCFGBuilder took 416.26ms. Allocated memory is still 255.9MB. Free memory was 206.8MB in the beginning and 191.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 04:06:01,822 INFO L158 Benchmark]: TraceAbstraction took 849610.15ms. Allocated memory was 255.9MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 191.1MB in the beginning and 1.2GB in the end (delta: -959.5MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-06 04:06:01,822 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.11ms. Allocated memory is still 255.9MB. Free memory was 232.0MB in the beginning and 231.9MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 354.42ms. Allocated memory is still 255.9MB. Free memory was 230.4MB in the beginning and 209.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.38ms. Allocated memory is still 255.9MB. Free memory was 209.9MB in the beginning and 208.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.69ms. Allocated memory is still 255.9MB. Free memory was 207.8MB in the beginning and 206.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 416.26ms. Allocated memory is still 255.9MB. Free memory was 206.8MB in the beginning and 191.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 849610.15ms. Allocated memory was 255.9MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 191.1MB in the beginning and 1.2GB in the end (delta: -959.5MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 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: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 0, dependent unconditional: 48, 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, 27 PlacesBefore, 27 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 196 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.0s, 26 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 132 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): 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 37 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 5, independent conditional: 5, 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): 336, Positive cache size: 336, Positive conditional cache size: 336, 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, 37 PlacesBefore, 37 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 232 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): 336, Positive cache size: 336, Positive conditional cache size: 336, 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, 47 PlacesBefore, 47 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 380 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): 336, Positive cache size: 336, Positive conditional cache size: 336, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 284 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): 336, Positive cache size: 336, Positive conditional cache size: 336, 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, 56 PlacesBefore, 56 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 380, Positive cache size: 380, Positive conditional cache size: 380, 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, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 376 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): 429, Positive cache size: 429, Positive conditional cache size: 429, 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, 78 PlacesBefore, 78 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 561, Positive cache size: 561, Positive conditional cache size: 561, 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, 93 PlacesBefore, 93 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 4, independent conditional: 4, 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): 660, Positive cache size: 660, Positive conditional cache size: 660, 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, 109 PlacesBefore, 109 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 718, Positive cache size: 718, Positive conditional cache size: 718, 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, 121 PlacesBefore, 121 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 11, independent: 6, independent conditional: 6, 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): 821, Positive cache size: 821, Positive conditional cache size: 821, 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, 137 PlacesBefore, 137 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 884, Positive cache size: 884, Positive conditional cache size: 884, 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, 152 PlacesBefore, 152 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 1026 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): 884, Positive cache size: 884, Positive conditional cache size: 884, 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, 152 PlacesBefore, 152 PlacesAfterwards, 321 TransitionsBefore, 321 TransitionsAfterwards, 974 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): 884, Positive cache size: 884, Positive conditional cache size: 884, 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, 169 PlacesBefore, 169 PlacesAfterwards, 369 TransitionsBefore, 369 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 993, Positive cache size: 993, Positive conditional cache size: 993, 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, 170 PlacesBefore, 170 PlacesAfterwards, 361 TransitionsBefore, 361 TransitionsAfterwards, 1162 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): 993, Positive cache size: 993, Positive conditional cache size: 993, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 175 PlacesBefore, 175 PlacesAfterwards, 364 TransitionsBefore, 364 TransitionsAfterwards, 1196 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): 993, Positive cache size: 993, Positive conditional cache size: 993, 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, 200 PlacesBefore, 200 PlacesAfterwards, 408 TransitionsBefore, 408 TransitionsAfterwards, 1286 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): 1053, Positive cache size: 1053, Positive conditional cache size: 1053, 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, 221 PlacesBefore, 221 PlacesAfterwards, 457 TransitionsBefore, 457 TransitionsAfterwards, 1400 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: 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, 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, 497 TransitionsBefore, 497 TransitionsAfterwards, 1486 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, 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, 527 TransitionsBefore, 527 TransitionsAfterwards, 1656 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, 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, 282 PlacesBefore, 282 PlacesAfterwards, 681 TransitionsBefore, 681 TransitionsAfterwards, 2084 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, 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, 278 PlacesBefore, 278 PlacesAfterwards, 667 TransitionsBefore, 667 TransitionsAfterwards, 2100 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): 1121, Positive cache size: 1121, Positive conditional cache size: 1121, 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.5s, 321 PlacesBefore, 321 PlacesAfterwards, 819 TransitionsBefore, 819 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 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: 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: 13, independent: 8, independent conditional: 8, 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): 1200, Positive cache size: 1200, Positive conditional cache size: 1200, 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, 315 PlacesBefore, 315 PlacesAfterwards, 815 TransitionsBefore, 815 TransitionsAfterwards, 2556 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): 1200, Positive cache size: 1200, Positive conditional cache size: 1200, 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, 336 PlacesBefore, 336 PlacesAfterwards, 844 TransitionsBefore, 844 TransitionsAfterwards, 2614 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): 1200, Positive cache size: 1200, Positive conditional cache size: 1200, 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, 353 PlacesBefore, 353 PlacesAfterwards, 890 TransitionsBefore, 890 TransitionsAfterwards, 2710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 5, independent: 2, independent conditional: 2, 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): 1396, Positive cache size: 1396, Positive conditional cache size: 1396, 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, 350 PlacesBefore, 350 PlacesAfterwards, 860 TransitionsBefore, 860 TransitionsAfterwards, 2650 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): 1396, Positive cache size: 1396, Positive conditional cache size: 1396, 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, 377 PlacesBefore, 377 PlacesAfterwards, 890 TransitionsBefore, 890 TransitionsAfterwards, 2710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 8, independent: 4, independent conditional: 4, 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): 1579, Positive cache size: 1579, Positive conditional cache size: 1579, 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, 402 PlacesBefore, 402 PlacesAfterwards, 919 TransitionsBefore, 919 TransitionsAfterwards, 2768 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 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: 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: 9, independent: 3, independent conditional: 3, 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): 1765, Positive cache size: 1765, Positive conditional cache size: 1765, 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, 420 PlacesBefore, 419 PlacesAfterwards, 976 TransitionsBefore, 975 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 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): 1932, Positive cache size: 1932, Positive conditional cache size: 1932, 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, 409 PlacesBefore, 409 PlacesAfterwards, 965 TransitionsBefore, 965 TransitionsAfterwards, 2882 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): 1932, Positive cache size: 1932, Positive conditional cache size: 1932, 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, 437 PlacesBefore, 437 PlacesAfterwards, 1012 TransitionsBefore, 1012 TransitionsAfterwards, 2982 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): 1932, Positive cache size: 1932, Positive conditional cache size: 1932, 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, 448 PlacesBefore, 447 PlacesAfterwards, 1036 TransitionsBefore, 1035 TransitionsAfterwards, 3020 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1987, Positive conditional cache size: 1987, 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, 439 PlacesBefore, 439 PlacesAfterwards, 1075 TransitionsBefore, 1075 TransitionsAfterwards, 3346 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): 1987, Positive cache size: 1987, Positive conditional cache size: 1987, 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.3s, 475 PlacesBefore, 474 PlacesAfterwards, 1124 TransitionsBefore, 1123 TransitionsAfterwards, 3472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 7, independent: 4, independent conditional: 4, 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): 2355, Positive cache size: 2355, Positive conditional cache size: 2355, 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, 494 PlacesBefore, 494 PlacesAfterwards, 1179 TransitionsBefore, 1179 TransitionsAfterwards, 3622 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): 2396, Positive cache size: 2396, Positive conditional cache size: 2396, 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, 503 PlacesBefore, 503 PlacesAfterwards, 1343 TransitionsBefore, 1343 TransitionsAfterwards, 4176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 16, independent conditional: 16, 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): 2496, Positive cache size: 2496, Positive conditional cache size: 2496, 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, 528 PlacesBefore, 527 PlacesAfterwards, 1415 TransitionsBefore, 1414 TransitionsAfterwards, 4330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 2497, Positive cache size: 2497, Positive conditional cache size: 2497, 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, 549 PlacesBefore, 549 PlacesAfterwards, 1660 TransitionsBefore, 1660 TransitionsAfterwards, 5032 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 15, independent conditional: 15, 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): 2712, Positive cache size: 2712, Positive conditional cache size: 2712, 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, 560 PlacesBefore, 560 PlacesAfterwards, 1713 TransitionsBefore, 1713 TransitionsAfterwards, 5128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 2713, Positive cache size: 2713, Positive conditional cache size: 2713, 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.5s, 565 PlacesBefore, 566 PlacesAfterwards, 1718 TransitionsBefore, 1718 TransitionsAfterwards, 5128 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 2776, Positive cache size: 2776, Positive conditional cache size: 2776, 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, 574 PlacesBefore, 573 PlacesAfterwards, 1710 TransitionsBefore, 1709 TransitionsAfterwards, 5104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 2777, Positive cache size: 2777, Positive conditional cache size: 2777, 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, 569 PlacesBefore, 569 PlacesAfterwards, 1707 TransitionsBefore, 1707 TransitionsAfterwards, 5100 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): 2777, Positive cache size: 2777, Positive conditional cache size: 2777, 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, 580 PlacesBefore, 580 PlacesAfterwards, 1704 TransitionsBefore, 1704 TransitionsAfterwards, 5096 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): 2777, Positive cache size: 2777, Positive conditional cache size: 2777, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 611 PlacesBefore, 607 PlacesAfterwards, 1772 TransitionsBefore, 1768 TransitionsAfterwards, 5206 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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: 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: 12, independent: 8, independent conditional: 8, 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): 2968, Positive cache size: 2968, Positive conditional cache size: 2968, 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, 625 PlacesBefore, 625 PlacesAfterwards, 1816 TransitionsBefore, 1816 TransitionsAfterwards, 5320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 9, independent: 7, independent conditional: 7, 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): 2973, Positive cache size: 2973, Positive conditional cache size: 2973, 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, 641 PlacesBefore, 640 PlacesAfterwards, 1818 TransitionsBefore, 1817 TransitionsAfterwards, 5308 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: 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): 3036, Positive cache size: 3036, Positive conditional cache size: 3036, 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, 642 PlacesBefore, 642 PlacesAfterwards, 1814 TransitionsBefore, 1814 TransitionsAfterwards, 5302 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): 3036, Positive cache size: 3036, Positive conditional cache size: 3036, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - 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 executing RemoveRedundantFlow. - 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 executing RemoveRedundantFlow. - 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: 849.5s, OverallIterations: 57, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 766.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 60 mSolverCounterUnknown, 6040 SdHoareTripleChecker+Valid, 201.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6040 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 196.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6938 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22409 IncrementalHoareTripleChecker+Invalid, 29407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6938 mSolverCounterUnsat, 0 mSDtfsCounter, 22409 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1734 GetRequests, 584 SyntacticMatches, 2 SemanticMatches, 1148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7538 ImplicationChecksByTransitivity, 143.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79806occurred in iteration=54, InterpolantAutomatonStates: 879, 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.0s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 1181 NumberOfCodeBlocks, 1181 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 1502 ConstructedInterpolants, 303 QuantifiedInterpolants, 38499 SizeOfPredicates, 38 NumberOfNonLiveVariables, 7965 ConjunctsInSsa, 792 ConjunctsInUnsatCore, 151 InterpolantComputations, 14 PerfectInterpolantSequences, 73/408 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