/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:01:09,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:01:09,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:01:09,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:01:09,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:01:09,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:01:09,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:01:09,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:01:09,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:01:09,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:01:09,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:01:09,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:01:09,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:01:09,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:01:09,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:01:09,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:01:09,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:01:09,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:01:09,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:01:09,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:01:09,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:01:09,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:01:09,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:01:09,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:01:09,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:01:09,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:01:09,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:01:09,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:01:09,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:01:09,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:01:09,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:01:09,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:01:09,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:01:09,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:01:09,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:01:09,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:01:09,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:01:09,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:01:09,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:01:09,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:01:09,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:01:09,714 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:01:09,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:01:09,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:01:09,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:01:09,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:01:09,757 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:01:09,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:01:09,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:01:09,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:01:09,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:01:09,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:01:09,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:01:09,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:01:09,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:01:09,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:01:09,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:01:09,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:01:09,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:01:09,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:01:09,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:01:09,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:01:09,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:01:09,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:09,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:01:09,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:01:09,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:01:09,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:01:09,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:01:09,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:01:09,761 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 06:01:10,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:01:10,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:01:10,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:01:10,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:01:10,139 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:01:10,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-10.i [2022-12-06 06:01:11,402 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:01:11,639 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:01:11,640 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-10.i [2022-12-06 06:01:11,658 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7c36114/1a9857dce32846ea9efd2d58d4288b96/FLAGe8e5e0c76 [2022-12-06 06:01:11,679 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7c36114/1a9857dce32846ea9efd2d58d4288b96 [2022-12-06 06:01:11,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:01:11,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:01:11,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:11,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:01:11,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:01:11,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:11" (1/1) ... [2022-12-06 06:01:11,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39bbd777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:11, skipping insertion in model container [2022-12-06 06:01:11,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:11" (1/1) ... [2022-12-06 06:01:11,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:01:11,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:01:12,057 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-10.i[30241,30254] [2022-12-06 06:01:12,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:12,095 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:01:12,144 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-10.i[30241,30254] [2022-12-06 06:01:12,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:12,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:12,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:12,192 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:01:12,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12 WrapperNode [2022-12-06 06:01:12,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:12,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:12,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:01:12,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:01:12,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,246 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-06 06:01:12,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:12,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:01:12,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:01:12,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:01:12,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,283 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:01:12,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:01:12,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:01:12,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:01:12,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:12,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:12,323 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 06:01:12,351 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 06:01:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:01:12,368 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:01:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:01:12,368 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:01:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:01:12,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:01:12,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:01:12,371 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 06:01:12,533 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:01:12,535 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:01:12,755 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:01:12,762 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:01:12,762 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 06:01:12,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:12 BoogieIcfgContainer [2022-12-06 06:01:12,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:01:12,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:01:12,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:01:12,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:01:12,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:01:11" (1/3) ... [2022-12-06 06:01:12,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8f8f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:12, skipping insertion in model container [2022-12-06 06:01:12,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12" (2/3) ... [2022-12-06 06:01:12,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8f8f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:12, skipping insertion in model container [2022-12-06 06:01:12,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:12" (3/3) ... [2022-12-06 06:01:12,779 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-10.i [2022-12-06 06:01:12,797 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:01:12,797 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:01:12,797 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:01:12,860 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:01:12,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 06:01:12,955 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 06:01:12,955 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:12,962 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 06:01:12,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 06:01:12,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:12,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:12,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:13,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:13,036 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 06:01:13,036 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:13,037 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 06:01:13,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:13,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 06:01:16,781 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-06 06:01:16,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:01:16,802 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;@57eb9522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:01:16,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 06:01:16,806 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-06 06:01:16,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:16,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:16,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:01:16,807 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 06:01:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-06 06:01:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:16,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461803287] [2022-12-06 06:01:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:16,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:17,084 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 06:01:17,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:17,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461803287] [2022-12-06 06:01:17,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461803287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:17,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:17,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:01:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733777715] [2022-12-06 06:01:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:17,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:01:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:17,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:01:17,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:01:17,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:17,114 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 06:01:17,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:17,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:17,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:17,189 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 06:01:17,190 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:01:17,190 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 06:01:17,192 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-06 06:01:17,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-06 06:01:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:01:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:01:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:01:17,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:01:17,204 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:01:17,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-06 06:01:17,206 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 06:01:17,207 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:17,209 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 06:01:17,212 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 06:01:17,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:17,213 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:17,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:17,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:17,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:17,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:17,220 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 06:01:17,220 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:17,221 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 06:01:17,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:17,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 06:01:17,221 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:17,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 06:01:17,223 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:17,223 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 06:01:17,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:17,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:17,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:01:17,224 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 06:01:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-06 06:01:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985707562] [2022-12-06 06:01:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:17,293 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 06:01:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:17,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985707562] [2022-12-06 06:01:17,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985707562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:17,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192417465] [2022-12-06 06:01:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:17,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:17,301 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 06:01:17,343 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 06:01:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:17,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:17,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:17,442 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 06:01:17,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:17,455 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 06:01:17,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192417465] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:17,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:17,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:17,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833319289] [2022-12-06 06:01:17,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:17,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:17,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:17,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:17,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:17,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:01:17,459 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 06:01:17,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:17,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:01:17,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:17,585 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:17,585 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:17,586 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 06:01:17,588 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:17,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-06 06:01:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:17,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 06:01:17,597 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:17,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-06 06:01:17,598 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 06:01:17,599 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:17,600 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 06:01:17,600 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:17,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:17,600 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:17,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:17,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:17,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:17,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:17,606 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:17,606 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:17,608 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 06:01:17,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:17,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:17,842 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:17,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 06:01:17,844 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:17,844 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 06:01:17,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:17,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:17,853 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 06:01:18,045 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 06:01:18,045 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 06:01:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-06 06:01:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:18,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365024959] [2022-12-06 06:01:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,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 06:01:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365024959] [2022-12-06 06:01:18,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365024959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416422123] [2022-12-06 06:01:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:18,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:18,122 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 06:01:18,124 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 06:01:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:18,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:18,195 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 06:01:18,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:18,206 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 06:01:18,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416422123] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:18,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:18,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:18,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116843039] [2022-12-06 06:01:18,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:18,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:18,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:18,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:18,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:18,208 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 06:01:18,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:18,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:18,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:18,333 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:18,334 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 06:01:18,334 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 06:01:18,336 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:18,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:18,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:01:18,337 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:18,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:18,339 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 06:01:18,340 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,340 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 06:01:18,341 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:18,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:18,341 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:18,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:18,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,345 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:18,345 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:18,349 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 06:01:18,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:18,574 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:18,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 06:01:18,575 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:18,575 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 06:01:18,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:18,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:18,587 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 06:01:18,776 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 06:01:18,776 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 06:01:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-06 06:01:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:18,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599387746] [2022-12-06 06:01:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,849 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 06:01:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:18,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599387746] [2022-12-06 06:01:18,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599387746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87561473] [2022-12-06 06:01:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:18,855 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 06:01:18,858 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 06:01:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:18,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:18,959 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 06:01:18,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:18,971 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 06:01:18,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87561473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:18,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:18,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167168321] [2022-12-06 06:01:18,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:18,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:18,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:18,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:18,976 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 06:01:18,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:18,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:18,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:19,079 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:19,080 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 06:01:19,083 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 06:01:19,087 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:19,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:19,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:01:19,092 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:19,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,097 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 06:01:19,098 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,098 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 06:01:19,099 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:19,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:19,100 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:19,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:19,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,109 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:19,109 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:19,109 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 06:01:19,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:19,336 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:19,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 06:01:19,337 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:19,337 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 06:01:19,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:19,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:19,346 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 06:01:19,538 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 06:01:19,539 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 06:01:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149165, now seen corresponding path program 1 times [2022-12-06 06:01:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:19,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137082890] [2022-12-06 06:01:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:19,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 06:01:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137082890] [2022-12-06 06:01:19,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137082890] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190975404] [2022-12-06 06:01:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:19,594 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 06:01:19,597 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 06:01:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:19,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:19,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:19,666 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 06:01:19,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:19,679 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 06:01:19,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190975404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:19,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:19,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527276490] [2022-12-06 06:01:19,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:19,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:19,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:19,682 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 06:01:19,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:19,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:19,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:19,747 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:19,749 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 06:01:19,749 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 06:01:19,750 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:19,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:19,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:01:19,752 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:19,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,753 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 06:01:19,754 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,755 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 06:01:19,757 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:19,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:19,757 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:19,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:19,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,763 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:19,763 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:19,763 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 06:01:19,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:19,981 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:19,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 06:01:19,982 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:19,982 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 06:01:19,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:19,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:19,990 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 06:01:20,182 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 06:01:20,183 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 06:01:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149072, now seen corresponding path program 1 times [2022-12-06 06:01:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:20,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950451017] [2022-12-06 06:01:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,250 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 06:01:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:20,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950451017] [2022-12-06 06:01:20,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950451017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:20,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513208] [2022-12-06 06:01:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:20,253 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 06:01:20,256 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 06:01:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:20,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:20,326 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 06:01:20,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:20,339 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 06:01:20,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513208] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:20,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:20,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452282431] [2022-12-06 06:01:20,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:20,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:20,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:20,341 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 06:01:20,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:20,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:20,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:20,403 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:20,403 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-06 06:01:20,404 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 06:01:20,404 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:20,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-06 06:01:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:20,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:20,406 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:20,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-06 06:01:20,408 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 06:01:20,409 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,409 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 06:01:20,411 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:20,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:20,412 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:20,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:20,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,416 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:20,416 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:20,416 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 06:01:20,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:20,566 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:20,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 06:01:20,567 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:20,567 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 06:01:20,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:20,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:20,576 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 06:01:20,768 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 06:01:20,768 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 06:01:20,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149010, now seen corresponding path program 1 times [2022-12-06 06:01:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:20,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146991086] [2022-12-06 06:01:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,829 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 06:01:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146991086] [2022-12-06 06:01:20,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146991086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787548707] [2022-12-06 06:01:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:20,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:20,832 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 06:01:20,834 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 06:01:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:20,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:20,913 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 06:01:20,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:20,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787548707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:20,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:20,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793225391] [2022-12-06 06:01:20,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:20,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:20,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:20,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:20,926 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 06:01:20,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:20,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:20,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:20,972 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:20,972 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:20,973 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 377 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 06:01:20,974 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:20,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:20,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:20,975 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:20,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:20,976 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 06:01:20,976 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,976 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 06:01:20,977 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:20,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:20,977 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:20,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:20,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,980 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:20,980 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:20,980 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 06:01:20,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:20,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:21,127 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:21,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 06:01:21,128 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:21,129 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 06:01:21,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:21,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:21,136 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 06:01:21,331 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 06:01:21,332 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 06:01:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148948, now seen corresponding path program 1 times [2022-12-06 06:01:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:21,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78617771] [2022-12-06 06:01:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,364 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 06:01:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:21,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78617771] [2022-12-06 06:01:21,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78617771] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:21,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826855310] [2022-12-06 06:01:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:21,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:21,366 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 06:01:21,376 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 06:01:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:21,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:21,442 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 06:01:21,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:21,452 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 06:01:21,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826855310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:21,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:21,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716406474] [2022-12-06 06:01:21,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:21,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:21,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:21,454 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 06:01:21,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:21,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:21,511 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:21,511 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:21,512 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 06:01:21,513 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:21,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:21,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:21,514 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:21,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:21,515 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 06:01:21,515 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,515 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 06:01:21,516 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:21,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:21,516 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:21,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:21,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,519 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:21,519 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:21,519 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 06:01:21,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:21,669 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:21,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 06:01:21,670 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:21,670 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 06:01:21,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:21,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:21,680 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 06:01:21,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:21,872 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 06:01:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148886, now seen corresponding path program 1 times [2022-12-06 06:01:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:21,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900604955] [2022-12-06 06:01:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,948 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 06:01:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:21,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900604955] [2022-12-06 06:01:21,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900604955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:21,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512186796] [2022-12-06 06:01:21,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:21,951 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 06:01:21,954 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 06:01:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:22,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:22,023 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 06:01:22,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:22,034 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 06:01:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512186796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:22,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:22,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823026743] [2022-12-06 06:01:22,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:22,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:22,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:22,036 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 06:01:22,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:22,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:22,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:22,088 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:22,089 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:22,089 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 377 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 06:01:22,090 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:22,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:22,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:22,092 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:22,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,092 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 06:01:22,094 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,094 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 06:01:22,095 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:22,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:22,095 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:22,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:22,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,099 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:22,100 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:22,100 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 06:01:22,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:22,250 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:22,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 06:01:22,251 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:22,251 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 06:01:22,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:22,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:22,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:22,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 06:01:22,452 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 06:01:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148824, now seen corresponding path program 1 times [2022-12-06 06:01:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:22,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905832120] [2022-12-06 06:01:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,514 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 06:01:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:22,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905832120] [2022-12-06 06:01:22,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905832120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:22,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387902131] [2022-12-06 06:01:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:22,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:22,517 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 06:01:22,520 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 06:01:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:22,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:22,610 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 06:01:22,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:22,618 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 06:01:22,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387902131] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:22,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:22,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-06 06:01:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234903964] [2022-12-06 06:01:22,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:22,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:01:22,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:22,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:01:22,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:01:22,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:22,621 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 06:01:22,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:22,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:22,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:22,660 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 06:01:22,660 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 06:01:22,660 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 06:01:22,661 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 06:01:22,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-06 06:01:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:01:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:01:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 06:01:22,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:01:22,662 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-06 06:01:22,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-06 06:01:22,663 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 06:01:22,665 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:22,666 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 06:01:22,666 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 06:01:22,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:22,667 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:22,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:22,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:22,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:22,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:22,670 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 06:01:22,670 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:22,670 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 06:01:22,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:22,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:01:22,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:22,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 06:01:22,750 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-06 06:01:22,750 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 06:01:22,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:22,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:22,759 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 06:01:22,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 06:01:22,951 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 06:01:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148793, now seen corresponding path program 1 times [2022-12-06 06:01:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:22,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519201212] [2022-12-06 06:01:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,109 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 06:01:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:23,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519201212] [2022-12-06 06:01:23,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519201212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:23,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926954154] [2022-12-06 06:01:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:23,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:23,111 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 06:01:23,131 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 06:01:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 06:01:23,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:23,237 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 06:01:23,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:23,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926954154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:23,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:23,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-06 06:01:23,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844846964] [2022-12-06 06:01:23,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:23,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:01:23,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:23,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:01:23,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:01:23,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:23,347 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 06:01:23,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:23,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:23,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:23,518 INFO L130 PetriNetUnfolder]: 247/378 cut-off events. [2022-12-06 06:01:23,519 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 06:01:23,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 378 events. 247/378 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1187 event pairs, 31 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 973. Up to 167 conditions per place. [2022-12-06 06:01:23,522 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 45 selfloop transitions, 19 changer transitions 0/64 dead transitions. [2022-12-06 06:01:23,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 64 transitions, 318 flow [2022-12-06 06:01:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:01:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:01:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-06 06:01:23,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:01:23,524 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-06 06:01:23,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 64 transitions, 318 flow [2022-12-06 06:01:23,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 64 transitions, 288 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:23,527 INFO L231 Difference]: Finished difference. Result has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:23,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=28, PETRI_TRANSITIONS=33} [2022-12-06 06:01:23,527 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 10 predicate places. [2022-12-06 06:01:23,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:23,528 INFO L89 Accepts]: Start accepts. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:23,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:23,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:23,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:23,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:23,535 INFO L130 PetriNetUnfolder]: 35/74 cut-off events. [2022-12-06 06:01:23,535 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 06:01:23,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 74 events. 35/74 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 194 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 184. Up to 41 conditions per place. [2022-12-06 06:01:23,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:23,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 06:01:23,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} 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 10) (= 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 06:01:23,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} 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 10)) 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 06:01:23,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} 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 10) (= 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 06:01:23,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} 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 10)) 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 06:01:23,912 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:23,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-06 06:01:23,913 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 32 transitions, 179 flow [2022-12-06 06:01:23,914 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 06:01:23,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:23,914 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:23,919 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 06:01:24,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 06:01:24,114 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 06:01:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 66809856, now seen corresponding path program 1 times [2022-12-06 06:01:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:24,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187854140] [2022-12-06 06:01:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,297 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 06:01:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187854140] [2022-12-06 06:01:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187854140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793721737] [2022-12-06 06:01:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:24,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:24,300 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 06:01:24,302 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 06:01:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:24,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:24,459 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 06:01:24,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:24,588 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 06:01:24,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793721737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:24,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:24,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716617633] [2022-12-06 06:01:24,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:24,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:24,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:24,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:24,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:01:24,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 32 transitions, 179 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 06:01:24,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:24,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:01:24,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:25,066 INFO L130 PetriNetUnfolder]: 623/945 cut-off events. [2022-12-06 06:01:25,066 INFO L131 PetriNetUnfolder]: For 1393/1393 co-relation queries the response was YES. [2022-12-06 06:01:25,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 945 events. 623/945 cut-off events. For 1393/1393 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3808 event pairs, 35 based on Foata normal form. 38/983 useless extension candidates. Maximal degree in co-relation 2900. Up to 370 conditions per place. [2022-12-06 06:01:25,072 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 89 selfloop transitions, 67 changer transitions 1/157 dead transitions. [2022-12-06 06:01:25,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 157 transitions, 968 flow [2022-12-06 06:01:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:01:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:01:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2022-12-06 06:01:25,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.446875 [2022-12-06 06:01:25,074 INFO L175 Difference]: Start difference. First operand has 27 places, 32 transitions, 179 flow. Second operand 16 states and 143 transitions. [2022-12-06 06:01:25,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 157 transitions, 968 flow [2022-12-06 06:01:25,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 157 transitions, 922 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-06 06:01:25,080 INFO L231 Difference]: Finished difference. Result has 46 places, 84 transitions, 612 flow [2022-12-06 06:01:25,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=612, PETRI_PLACES=46, PETRI_TRANSITIONS=84} [2022-12-06 06:01:25,081 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 28 predicate places. [2022-12-06 06:01:25,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:25,081 INFO L89 Accepts]: Start accepts. Operand has 46 places, 84 transitions, 612 flow [2022-12-06 06:01:25,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:25,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:25,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 84 transitions, 612 flow [2022-12-06 06:01:25,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 84 transitions, 612 flow [2022-12-06 06:01:25,097 INFO L130 PetriNetUnfolder]: 89/180 cut-off events. [2022-12-06 06:01:25,097 INFO L131 PetriNetUnfolder]: For 368/371 co-relation queries the response was YES. [2022-12-06 06:01:25,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 180 events. 89/180 cut-off events. For 368/371 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 707 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 617. Up to 119 conditions per place. [2022-12-06 06:01:25,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 84 transitions, 612 flow [2022-12-06 06:01:25,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 06:01:25,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= (+ 23 v_~x~0_218) v_~x~0_216) (< v_~x~0_218 0) (= (+ (* 10946 v_~prev~0_226) (* 17711 v_~cur~0_197) v_~prev~0_224) v_~next~0_126) (= (+ (* 46368 v_~cur~0_197) (* 28657 v_~prev~0_226)) v_~next~0_126) (= v_~next~0_126 v_~cur~0_195)) InVars {~prev~0=v_~prev~0_226, ~cur~0=v_~cur~0_197, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_135|, ~next~0=v_~next~0_126, ~prev~0=v_~prev~0_224, ~cur~0=v_~cur~0_195, ~x~0=v_~x~0_216} 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 10) (= 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 06:01:25,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L705-6-->L705-6: Formula: (and (= (+ 23 v_~x~0_218) v_~x~0_216) (< v_~x~0_218 0) (= (+ (* 10946 v_~prev~0_226) (* 17711 v_~cur~0_197) v_~prev~0_224) v_~next~0_126) (= (+ (* 46368 v_~cur~0_197) (* 28657 v_~prev~0_226)) v_~next~0_126) (= v_~next~0_126 v_~cur~0_195)) InVars {~prev~0=v_~prev~0_226, ~cur~0=v_~cur~0_197, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_135|, ~next~0=v_~next~0_126, ~prev~0=v_~prev~0_224, ~cur~0=v_~cur~0_195, ~x~0=v_~x~0_216} 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 10)) 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 06:01:25,314 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 10)) 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 [353] L705-6-->L687-5: Formula: (and (< v_~x~0_198 23) (= (+ v_~j~0_119 v_~i~0_104) v_~i~0_103) (= v_~next~0_116 (+ (* 28657 v_~cur~0_178) (* v_~prev~0_207 17711))) (< v_~p~0_40 10) (= v_~p~0_39 (+ v_~p~0_40 1)) (= v_~prev~0_206 (+ (* 17711 v_~cur~0_178) (* 10946 v_~prev~0_207))) (= (+ 22 v_~x~0_199) v_~x~0_198) (= v_~next~0_116 v_~cur~0_177)) InVars {~j~0=v_~j~0_119, ~prev~0=v_~prev~0_207, ~i~0=v_~i~0_104, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_178, ~x~0=v_~x~0_199} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_125|, ~j~0=v_~j~0_119, ~next~0=v_~next~0_116, ~prev~0=v_~prev~0_206, ~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_177, ~x~0=v_~x~0_198} 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 06:01:25,478 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:25,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-06 06:01:25,479 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 84 transitions, 630 flow [2022-12-06 06:01:25,479 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 06:01:25,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:25,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:25,487 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 06:01:25,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 06:01:25,686 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 06:01:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1106190828, now seen corresponding path program 1 times [2022-12-06 06:01:25,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:25,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790100222] [2022-12-06 06:01:25,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:25,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790100222] [2022-12-06 06:01:25,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790100222] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:25,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476058986] [2022-12-06 06:01:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:25,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:25,727 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 06:01:25,730 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 06:01:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:25,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:25,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:25,805 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 06:01:25,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:01:25,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476058986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:25,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:01:25,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 06:01:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520512958] [2022-12-06 06:01:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:25,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:01:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:01:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:01:25,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 06:01:25,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 84 transitions, 630 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 06:01:25,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:25,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 06:01:25,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:25,894 INFO L130 PetriNetUnfolder]: 344/561 cut-off events. [2022-12-06 06:01:25,894 INFO L131 PetriNetUnfolder]: For 1663/1663 co-relation queries the response was YES. [2022-12-06 06:01:25,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 561 events. 344/561 cut-off events. For 1663/1663 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2239 event pairs, 153 based on Foata normal form. 81/626 useless extension candidates. Maximal degree in co-relation 1855. Up to 337 conditions per place. [2022-12-06 06:01:25,898 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2022-12-06 06:01:25,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 490 flow [2022-12-06 06:01:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:01:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:01:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 06:01:25,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 06:01:25,899 INFO L175 Difference]: Start difference. First operand has 45 places, 84 transitions, 630 flow. Second operand 4 states and 32 transitions. [2022-12-06 06:01:25,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 490 flow [2022-12-06 06:01:25,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 431 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:25,904 INFO L231 Difference]: Finished difference. Result has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:25,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=39, PETRI_TRANSITIONS=47} [2022-12-06 06:01:25,905 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 21 predicate places. [2022-12-06 06:01:25,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:25,905 INFO L89 Accepts]: Start accepts. Operand has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:25,906 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:25,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:25,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:25,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 47 transitions, 309 flow [2022-12-06 06:01:25,915 INFO L130 PetriNetUnfolder]: 48/121 cut-off events. [2022-12-06 06:01:25,915 INFO L131 PetriNetUnfolder]: For 232/246 co-relation queries the response was YES. [2022-12-06 06:01:25,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 121 events. 48/121 cut-off events. For 232/246 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 0 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 318. Up to 34 conditions per place. [2022-12-06 06:01:25,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 309 flow [2022-12-06 06:01:25,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:01:26,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:26,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 06:01:26,014 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 315 flow [2022-12-06 06:01:26,014 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 06:01:26,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:26,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:26,023 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 06:01:26,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 06:01:26,215 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 06:01:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1429423767, now seen corresponding path program 1 times [2022-12-06 06:01:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:26,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834321605] [2022-12-06 06:01:26,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:26,369 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 06:01:26,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:26,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834321605] [2022-12-06 06:01:26,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834321605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:26,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419307821] [2022-12-06 06:01:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:26,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:26,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:26,371 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 06:01:26,395 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 06:01:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:26,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:26,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:26,508 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 06:01:26,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:26,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 06:01:26,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419307821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:26,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:26,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 06:01:26,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470946043] [2022-12-06 06:01:26,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:26,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:01:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:26,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:01:26,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:01:26,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:01:26,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 315 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:26,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:26,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:01:26,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:31,306 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 [] [2022-12-06 06:01:31,400 INFO L130 PetriNetUnfolder]: 402/671 cut-off events. [2022-12-06 06:01:31,400 INFO L131 PetriNetUnfolder]: For 1203/1203 co-relation queries the response was YES. [2022-12-06 06:01:31,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 671 events. 402/671 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2923 event pairs, 40 based on Foata normal form. 26/681 useless extension candidates. Maximal degree in co-relation 2027. Up to 383 conditions per place. [2022-12-06 06:01:31,405 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-06 06:01:31,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 101 transitions, 700 flow [2022-12-06 06:01:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:01:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:01:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 06:01:31,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 06:01:31,407 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 315 flow. Second operand 10 states and 74 transitions. [2022-12-06 06:01:31,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 101 transitions, 700 flow [2022-12-06 06:01:31,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 101 transitions, 683 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:31,415 INFO L231 Difference]: Finished difference. Result has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=581, PETRI_PLACES=51, PETRI_TRANSITIONS=68} [2022-12-06 06:01:31,416 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 33 predicate places. [2022-12-06 06:01:31,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:31,416 INFO L89 Accepts]: Start accepts. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:31,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:31,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,430 INFO L130 PetriNetUnfolder]: 63/155 cut-off events. [2022-12-06 06:01:31,431 INFO L131 PetriNetUnfolder]: For 395/425 co-relation queries the response was YES. [2022-12-06 06:01:31,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 155 events. 63/155 cut-off events. For 395/425 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 669 event pairs, 1 based on Foata normal form. 5/157 useless extension candidates. Maximal degree in co-relation 548. Up to 48 conditions per place. [2022-12-06 06:01:31,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:01:31,609 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:31,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 06:01:31,610 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 68 transitions, 598 flow [2022-12-06 06:01:31,610 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 06:01:31,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:31,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:31,619 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 06:01:31,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 06:01:31,823 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 06:01:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash 68088978, now seen corresponding path program 1 times [2022-12-06 06:01:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:31,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037056398] [2022-12-06 06:01:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:32,017 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 06:01:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:32,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037056398] [2022-12-06 06:01:32,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037056398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:32,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471857195] [2022-12-06 06:01:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:32,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:32,020 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 06:01:32,023 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 06:01:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:32,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:32,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:32,185 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 06:01:32,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:32,326 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 06:01:32,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471857195] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:32,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:32,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:32,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681396572] [2022-12-06 06:01:32,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:32,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:32,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:32,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:32,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:01:32,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 68 transitions, 598 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:32,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:32,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:01:32,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:32,804 INFO L130 PetriNetUnfolder]: 548/935 cut-off events. [2022-12-06 06:01:32,804 INFO L131 PetriNetUnfolder]: For 3108/3108 co-relation queries the response was YES. [2022-12-06 06:01:32,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 935 events. 548/935 cut-off events. For 3108/3108 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4515 event pairs, 31 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 3268. Up to 295 conditions per place. [2022-12-06 06:01:32,810 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 73 selfloop transitions, 97 changer transitions 0/170 dead transitions. [2022-12-06 06:01:32,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 170 transitions, 1411 flow [2022-12-06 06:01:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:01:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:01:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 06:01:32,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33229813664596275 [2022-12-06 06:01:32,812 INFO L175 Difference]: Start difference. First operand has 51 places, 68 transitions, 598 flow. Second operand 14 states and 107 transitions. [2022-12-06 06:01:32,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 170 transitions, 1411 flow [2022-12-06 06:01:32,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 170 transitions, 1374 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:32,828 INFO L231 Difference]: Finished difference. Result has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1241, PETRI_PLACES=69, PETRI_TRANSITIONS=120} [2022-12-06 06:01:32,829 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 51 predicate places. [2022-12-06 06:01:32,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:32,829 INFO L89 Accepts]: Start accepts. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:32,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:32,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,849 INFO L130 PetriNetUnfolder]: 81/205 cut-off events. [2022-12-06 06:01:32,850 INFO L131 PetriNetUnfolder]: For 764/796 co-relation queries the response was YES. [2022-12-06 06:01:32,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 205 events. 81/205 cut-off events. For 764/796 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 999 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 895. Up to 86 conditions per place. [2022-12-06 06:01:32,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 06:01:32,853 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:32,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 06:01:32,854 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,854 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 06:01:32,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:32,854 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:32,866 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 06:01:33,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:33,061 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 06:01:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:33,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1362106802, now seen corresponding path program 1 times [2022-12-06 06:01:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:33,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693976008] [2022-12-06 06:01:33,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:33,200 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 06:01:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:33,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693976008] [2022-12-06 06:01:33,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693976008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:33,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527287] [2022-12-06 06:01:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:33,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:33,202 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 06:01:33,212 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 06:01:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:33,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:33,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:33,359 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 06:01:33,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:33,500 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 06:01:33,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527287] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:33,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:33,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008327550] [2022-12-06 06:01:33,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:33,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:33,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:33,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:33,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:01:33,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 120 transitions, 1241 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:33,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:33,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:01:33,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:39,218 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 [] [2022-12-06 06:01:39,425 INFO L130 PetriNetUnfolder]: 592/1023 cut-off events. [2022-12-06 06:01:39,425 INFO L131 PetriNetUnfolder]: For 5408/5408 co-relation queries the response was YES. [2022-12-06 06:01:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1023 events. 592/1023 cut-off events. For 5408/5408 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5184 event pairs, 67 based on Foata normal form. 24/1028 useless extension candidates. Maximal degree in co-relation 4181. Up to 656 conditions per place. [2022-12-06 06:01:39,434 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 113 selfloop transitions, 61 changer transitions 0/174 dead transitions. [2022-12-06 06:01:39,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1819 flow [2022-12-06 06:01:39,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:01:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:01:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 06:01:39,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-06 06:01:39,436 INFO L175 Difference]: Start difference. First operand has 69 places, 120 transitions, 1241 flow. Second operand 11 states and 82 transitions. [2022-12-06 06:01:39,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1819 flow [2022-12-06 06:01:39,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1737 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:39,456 INFO L231 Difference]: Finished difference. Result has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:39,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1515, PETRI_PLACES=80, PETRI_TRANSITIONS=138} [2022-12-06 06:01:39,457 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 62 predicate places. [2022-12-06 06:01:39,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:39,457 INFO L89 Accepts]: Start accepts. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:39,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:39,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:39,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:39,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:39,480 INFO L130 PetriNetUnfolder]: 92/237 cut-off events. [2022-12-06 06:01:39,480 INFO L131 PetriNetUnfolder]: For 1002/1038 co-relation queries the response was YES. [2022-12-06 06:01:39,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 237 events. 92/237 cut-off events. For 1002/1038 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1233 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 1104. Up to 106 conditions per place. [2022-12-06 06:01:39,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:39,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 06:01:39,602 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:39,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 06:01:39,603 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 138 transitions, 1526 flow [2022-12-06 06:01:39,604 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 06:01:39,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:39,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:39,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:39,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 06:01:39,804 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 06:01:39,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash 548607732, now seen corresponding path program 1 times [2022-12-06 06:01:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:39,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873672389] [2022-12-06 06:01:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:39,936 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 06:01:39,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:39,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873672389] [2022-12-06 06:01:39,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873672389] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:39,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22158299] [2022-12-06 06:01:39,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:39,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:39,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:39,952 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 06:01:39,955 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 06:01:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:40,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:40,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:40,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:40,241 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 06:01:40,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22158299] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:40,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:40,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544680775] [2022-12-06 06:01:40,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:40,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:40,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:01:40,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 138 transitions, 1526 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:40,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:40,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:01:40,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:47,225 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 [] [2022-12-06 06:01:47,421 INFO L130 PetriNetUnfolder]: 706/1215 cut-off events. [2022-12-06 06:01:47,421 INFO L131 PetriNetUnfolder]: For 6299/6299 co-relation queries the response was YES. [2022-12-06 06:01:47,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5231 conditions, 1215 events. 706/1215 cut-off events. For 6299/6299 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6398 event pairs, 43 based on Foata normal form. 14/1210 useless extension candidates. Maximal degree in co-relation 5194. Up to 676 conditions per place. [2022-12-06 06:01:47,430 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 128 selfloop transitions, 96 changer transitions 2/226 dead transitions. [2022-12-06 06:01:47,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 226 transitions, 2420 flow [2022-12-06 06:01:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:01:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:01:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-12-06 06:01:47,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26 [2022-12-06 06:01:47,433 INFO L175 Difference]: Start difference. First operand has 80 places, 138 transitions, 1526 flow. Second operand 18 states and 117 transitions. [2022-12-06 06:01:47,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 226 transitions, 2420 flow [2022-12-06 06:01:47,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 2358 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:47,463 INFO L231 Difference]: Finished difference. Result has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:47,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2118, PETRI_PLACES=99, PETRI_TRANSITIONS=170} [2022-12-06 06:01:47,463 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 81 predicate places. [2022-12-06 06:01:47,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:47,463 INFO L89 Accepts]: Start accepts. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:47,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:47,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:47,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:47,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:47,491 INFO L130 PetriNetUnfolder]: 109/282 cut-off events. [2022-12-06 06:01:47,491 INFO L131 PetriNetUnfolder]: For 1393/1429 co-relation queries the response was YES. [2022-12-06 06:01:47,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 282 events. 109/282 cut-off events. For 1393/1429 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1584 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 1480. Up to 125 conditions per place. [2022-12-06 06:01:47,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:47,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 06:01:47,876 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 10) (= 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 [374] L705-6-->L695-5: Formula: (and (= v_~j~0_205 (+ v_~j~0_207 (* 2 v_~i~0_175))) (< v_~x~0_276 23) (= (+ (* 28657 v_~cur~0_249) (* v_~prev~0_283 17711)) v_~next~0_157) (= v_~next~0_157 v_~cur~0_248) (< v_~q~0_127 9) (= (+ 2 v_~q~0_127) v_~q~0_125) (= (+ 22 v_~x~0_277) v_~x~0_276) (= v_~prev~0_282 (+ (* 17711 v_~cur~0_249) (* 10946 v_~prev~0_283)))) InVars {~j~0=v_~j~0_207, ~prev~0=v_~prev~0_283, ~i~0=v_~i~0_175, ~q~0=v_~q~0_127, ~cur~0=v_~cur~0_249, ~x~0=v_~x~0_277} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_171|, ~j~0=v_~j~0_205, ~next~0=v_~next~0_157, ~prev~0=v_~prev~0_282, ~i~0=v_~i~0_175, ~q~0=v_~q~0_125, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_88|, ~cur~0=v_~cur~0_248, ~x~0=v_~x~0_276} 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 06:01:47,955 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 10) (= 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 [352] L705-6-->L695-5: Formula: (and (= (+ (* 10946 v_~prev~0_203) (* 17711 v_~cur~0_174)) v_~prev~0_202) (= (+ (* 28657 v_~cur~0_174) (* v_~prev~0_203 17711)) v_~next~0_114) (= v_~next~0_114 v_~cur~0_173) (< v_~x~0_194 23) (= v_~j~0_115 (+ v_~j~0_116 v_~i~0_101)) (= v_~q~0_55 (+ v_~q~0_56 1)) (< v_~q~0_56 10) (= (+ 22 v_~x~0_195) v_~x~0_194)) InVars {~j~0=v_~j~0_116, ~prev~0=v_~prev~0_203, ~i~0=v_~i~0_101, ~q~0=v_~q~0_56, ~cur~0=v_~cur~0_174, ~x~0=v_~x~0_195} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_123|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_114, ~prev~0=v_~prev~0_202, ~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_173, ~x~0=v_~x~0_194} 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 06:01:48,116 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:01:48,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 654 [2022-12-06 06:01:48,117 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 170 transitions, 2154 flow [2022-12-06 06:01:48,117 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 06:01:48,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:48,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:48,126 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 06:01:48,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 06:01:48,327 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 06:01:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1361866986, now seen corresponding path program 1 times [2022-12-06 06:01:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164494725] [2022-12-06 06:01:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:48,470 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 06:01:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:48,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164494725] [2022-12-06 06:01:48,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164494725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:48,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589712292] [2022-12-06 06:01:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:48,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:48,474 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 06:01:48,477 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 06:01:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:48,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:48,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:48,630 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 06:01:48,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:48,747 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 06:01:48,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589712292] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:48,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:48,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:48,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357838776] [2022-12-06 06:01:48,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:48,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:48,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:01:48,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 170 transitions, 2154 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:48,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:48,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:01:48,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:49,280 INFO L130 PetriNetUnfolder]: 874/1499 cut-off events. [2022-12-06 06:01:49,280 INFO L131 PetriNetUnfolder]: For 12631/12631 co-relation queries the response was YES. [2022-12-06 06:01:49,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1499 events. 874/1499 cut-off events. For 12631/12631 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8359 event pairs, 45 based on Foata normal form. 22/1502 useless extension candidates. Maximal degree in co-relation 7150. Up to 501 conditions per place. [2022-12-06 06:01:49,294 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 103 selfloop transitions, 152 changer transitions 0/255 dead transitions. [2022-12-06 06:01:49,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 255 transitions, 3262 flow [2022-12-06 06:01:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:01:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:01:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-12-06 06:01:49,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-06 06:01:49,295 INFO L175 Difference]: Start difference. First operand has 99 places, 170 transitions, 2154 flow. Second operand 12 states and 107 transitions. [2022-12-06 06:01:49,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 255 transitions, 3262 flow [2022-12-06 06:01:49,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 255 transitions, 3132 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-12-06 06:01:49,345 INFO L231 Difference]: Finished difference. Result has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:49,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2974, PETRI_PLACES=107, PETRI_TRANSITIONS=206} [2022-12-06 06:01:49,346 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 89 predicate places. [2022-12-06 06:01:49,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:49,346 INFO L89 Accepts]: Start accepts. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:49,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:49,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:49,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:49,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:49,383 INFO L130 PetriNetUnfolder]: 137/352 cut-off events. [2022-12-06 06:01:49,383 INFO L131 PetriNetUnfolder]: For 2688/2758 co-relation queries the response was YES. [2022-12-06 06:01:49,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 352 events. 137/352 cut-off events. For 2688/2758 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2144 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 2176. Up to 169 conditions per place. [2022-12-06 06:01:49,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:49,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 06:01:49,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:49,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 06:01:49,435 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 206 transitions, 2978 flow [2022-12-06 06:01:49,436 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 06:01:49,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:49,436 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:49,443 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 06:01:49,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 06:01:49,641 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 06:01:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1361838683, now seen corresponding path program 1 times [2022-12-06 06:01:49,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:49,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185516820] [2022-12-06 06:01:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:49,775 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 06:01:49,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:49,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185516820] [2022-12-06 06:01:49,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185516820] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:49,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581573313] [2022-12-06 06:01:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:49,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:49,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:49,777 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 06:01:49,780 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 06:01:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:49,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:49,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:49,951 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 06:01:49,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:50,060 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 06:01:50,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581573313] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:50,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:50,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776800869] [2022-12-06 06:01:50,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:50,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:50,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:50,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:01:50,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 206 transitions, 2978 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:50,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:50,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:01:50,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:58,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:01:59,121 INFO L130 PetriNetUnfolder]: 914/1579 cut-off events. [2022-12-06 06:01:59,121 INFO L131 PetriNetUnfolder]: For 20208/20208 co-relation queries the response was YES. [2022-12-06 06:01:59,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 1579 events. 914/1579 cut-off events. For 20208/20208 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 8917 event pairs, 103 based on Foata normal form. 32/1586 useless extension candidates. Maximal degree in co-relation 8328. Up to 1020 conditions per place. [2022-12-06 06:01:59,141 INFO L137 encePairwiseOnDemand]: 8/31 looper letters, 155 selfloop transitions, 108 changer transitions 2/265 dead transitions. [2022-12-06 06:01:59,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 265 transitions, 3844 flow [2022-12-06 06:01:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:01:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:01:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-06 06:01:59,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2456575682382134 [2022-12-06 06:01:59,142 INFO L175 Difference]: Start difference. First operand has 107 places, 206 transitions, 2978 flow. Second operand 13 states and 99 transitions. [2022-12-06 06:01:59,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 265 transitions, 3844 flow [2022-12-06 06:01:59,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 265 transitions, 3743 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:59,221 INFO L231 Difference]: Finished difference. Result has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:59,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3473, PETRI_PLACES=118, PETRI_TRANSITIONS=222} [2022-12-06 06:01:59,222 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 100 predicate places. [2022-12-06 06:01:59,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:59,222 INFO L89 Accepts]: Start accepts. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:59,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:59,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:59,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:59,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:59,266 INFO L130 PetriNetUnfolder]: 147/382 cut-off events. [2022-12-06 06:01:59,266 INFO L131 PetriNetUnfolder]: For 3305/3405 co-relation queries the response was YES. [2022-12-06 06:01:59,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 382 events. 147/382 cut-off events. For 3305/3405 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2344 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 2522. Up to 183 conditions per place. [2022-12-06 06:01:59,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:59,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-06 06:01:59,357 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:59,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 06:01:59,359 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 222 transitions, 3485 flow [2022-12-06 06:01:59,359 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 06:01:59,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:59,360 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:59,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 06:01:59,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:59,560 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 06:01:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash 549168956, now seen corresponding path program 1 times [2022-12-06 06:01:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:59,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524115265] [2022-12-06 06:01:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:59,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:59,699 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 06:01:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524115265] [2022-12-06 06:01:59,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524115265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593699243] [2022-12-06 06:01:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:59,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:59,704 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 06:01:59,707 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 06:01:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:59,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:59,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:59,880 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 06:01:59,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:59,995 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 06:01:59,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593699243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:59,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:59,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068364958] [2022-12-06 06:01:59,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:59,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:59,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:01:59,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 222 transitions, 3485 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:59,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:59,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:01:59,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:06,263 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 37 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:02:17,795 WARN L233 SmtUtils]: Spent 11.51s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:02:19,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:02:21,474 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 [] [2022-12-06 06:02:23,494 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 [] [2022-12-06 06:02:32,071 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 [] [2022-12-06 06:02:34,632 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 [] [2022-12-06 06:02:34,781 INFO L130 PetriNetUnfolder]: 1032/1791 cut-off events. [2022-12-06 06:02:34,781 INFO L131 PetriNetUnfolder]: For 20852/20852 co-relation queries the response was YES. [2022-12-06 06:02:34,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 1791 events. 1032/1791 cut-off events. For 20852/20852 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 10488 event pairs, 89 based on Foata normal form. 20/1786 useless extension candidates. Maximal degree in co-relation 9859. Up to 1048 conditions per place. [2022-12-06 06:02:34,794 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 167 selfloop transitions, 150 changer transitions 3/320 dead transitions. [2022-12-06 06:02:34,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 320 transitions, 4900 flow [2022-12-06 06:02:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:02:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:02:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-06 06:02:34,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22348484848484848 [2022-12-06 06:02:34,795 INFO L175 Difference]: Start difference. First operand has 118 places, 222 transitions, 3485 flow. Second operand 16 states and 118 transitions. [2022-12-06 06:02:34,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 320 transitions, 4900 flow [2022-12-06 06:02:34,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 320 transitions, 4802 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:34,889 INFO L231 Difference]: Finished difference. Result has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:34,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4573, PETRI_PLACES=133, PETRI_TRANSITIONS=265} [2022-12-06 06:02:34,890 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 115 predicate places. [2022-12-06 06:02:34,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:34,890 INFO L89 Accepts]: Start accepts. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:34,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:34,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:34,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:34,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:34,940 INFO L130 PetriNetUnfolder]: 168/439 cut-off events. [2022-12-06 06:02:34,940 INFO L131 PetriNetUnfolder]: For 3938/4010 co-relation queries the response was YES. [2022-12-06 06:02:34,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3177 conditions, 439 events. 168/439 cut-off events. For 3938/4010 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2875 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 3126. Up to 210 conditions per place. [2022-12-06 06:02:34,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:34,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-06 06:02:34,949 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:34,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 06:02:34,949 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:34,950 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 06:02:34,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:34,950 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:34,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:35,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:35,155 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 06:02:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:35,156 INFO L85 PathProgramCache]: Analyzing trace with hash 550633520, now seen corresponding path program 1 times [2022-12-06 06:02:35,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:35,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098776492] [2022-12-06 06:02:35,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:35,305 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 06:02:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:35,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098776492] [2022-12-06 06:02:35,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098776492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:35,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768460835] [2022-12-06 06:02:35,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:35,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:35,308 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 06:02:35,311 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 06:02:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:35,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:02:35,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:35,491 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 06:02:35,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:35,619 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 06:02:35,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768460835] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:35,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:35,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:02:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195641935] [2022-12-06 06:02:35,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:35,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:02:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:02:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:02:35,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:02:35,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 265 transitions, 4573 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 06:02:35,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:35,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:02:35,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:37,550 INFO L130 PetriNetUnfolder]: 1086/1899 cut-off events. [2022-12-06 06:02:37,550 INFO L131 PetriNetUnfolder]: For 24868/24868 co-relation queries the response was YES. [2022-12-06 06:02:37,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11345 conditions, 1899 events. 1086/1899 cut-off events. For 24868/24868 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 11351 event pairs, 112 based on Foata normal form. 20/1902 useless extension candidates. Maximal degree in co-relation 11291. Up to 1140 conditions per place. [2022-12-06 06:02:37,562 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 172 selfloop transitions, 158 changer transitions 1/331 dead transitions. [2022-12-06 06:02:37,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 331 transitions, 5803 flow [2022-12-06 06:02:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:02:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:02:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-06 06:02:37,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-06 06:02:37,564 INFO L175 Difference]: Start difference. First operand has 133 places, 265 transitions, 4573 flow. Second operand 13 states and 99 transitions. [2022-12-06 06:02:37,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 331 transitions, 5803 flow [2022-12-06 06:02:37,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 331 transitions, 5654 flow, removed 59 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:37,659 INFO L231 Difference]: Finished difference. Result has 144 places, 291 transitions, 5430 flow [2022-12-06 06:02:37,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4432, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5430, PETRI_PLACES=144, PETRI_TRANSITIONS=291} [2022-12-06 06:02:37,659 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 126 predicate places. [2022-12-06 06:02:37,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:37,659 INFO L89 Accepts]: Start accepts. Operand has 144 places, 291 transitions, 5430 flow [2022-12-06 06:02:37,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:37,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:37,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 291 transitions, 5430 flow [2022-12-06 06:02:37,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 291 transitions, 5430 flow [2022-12-06 06:02:37,714 INFO L130 PetriNetUnfolder]: 184/483 cut-off events. [2022-12-06 06:02:37,714 INFO L131 PetriNetUnfolder]: For 5180/5282 co-relation queries the response was YES. [2022-12-06 06:02:37,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 483 events. 184/483 cut-off events. For 5180/5282 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3210 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 3672. Up to 234 conditions per place. [2022-12-06 06:02:37,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 291 transitions, 5430 flow [2022-12-06 06:02:37,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-06 06:02:37,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:02:37,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 06:02:37,758 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 291 transitions, 5437 flow [2022-12-06 06:02:37,758 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 06:02:37,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:37,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:37,770 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 06:02:37,963 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,SelfDestructingSolverStorable20 [2022-12-06 06:02:37,964 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 06:02:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:37,964 INFO L85 PathProgramCache]: Analyzing trace with hash 734060033, now seen corresponding path program 1 times [2022-12-06 06:02:37,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:37,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545645331] [2022-12-06 06:02:37,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:37,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:38,110 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 06:02:38,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:38,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545645331] [2022-12-06 06:02:38,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545645331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:38,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360111582] [2022-12-06 06:02:38,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:38,112 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 06:02:38,115 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 06:02:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:38,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:02:38,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:38,337 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 06:02:38,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:38,496 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 06:02:38,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360111582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:38,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:38,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:38,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523978841] [2022-12-06 06:02:38,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:38,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:38,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 06:02:38,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 291 transitions, 5437 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 06:02:38,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:38,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 06:02:38,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:42,975 INFO L130 PetriNetUnfolder]: 1356/2365 cut-off events. [2022-12-06 06:02:42,975 INFO L131 PetriNetUnfolder]: For 55207/55207 co-relation queries the response was YES. [2022-12-06 06:02:42,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14814 conditions, 2365 events. 1356/2365 cut-off events. For 55207/55207 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 14526 event pairs, 98 based on Foata normal form. 60/2408 useless extension candidates. Maximal degree in co-relation 14756. Up to 1026 conditions per place. [2022-12-06 06:02:42,994 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 184 selfloop transitions, 245 changer transitions 0/429 dead transitions. [2022-12-06 06:02:42,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 429 transitions, 7854 flow [2022-12-06 06:02:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:02:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:02:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 142 transitions. [2022-12-06 06:02:42,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23202614379084968 [2022-12-06 06:02:42,996 INFO L175 Difference]: Start difference. First operand has 144 places, 291 transitions, 5437 flow. Second operand 18 states and 142 transitions. [2022-12-06 06:02:42,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 429 transitions, 7854 flow [2022-12-06 06:02:43,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 429 transitions, 7665 flow, removed 63 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:43,111 INFO L231 Difference]: Finished difference. Result has 165 places, 365 transitions, 7382 flow [2022-12-06 06:02:43,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5260, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7382, PETRI_PLACES=165, PETRI_TRANSITIONS=365} [2022-12-06 06:02:43,111 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 147 predicate places. [2022-12-06 06:02:43,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:43,111 INFO L89 Accepts]: Start accepts. Operand has 165 places, 365 transitions, 7382 flow [2022-12-06 06:02:43,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:43,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:43,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 365 transitions, 7382 flow [2022-12-06 06:02:43,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 365 transitions, 7382 flow [2022-12-06 06:02:43,187 INFO L130 PetriNetUnfolder]: 224/584 cut-off events. [2022-12-06 06:02:43,188 INFO L131 PetriNetUnfolder]: For 8820/8910 co-relation queries the response was YES. [2022-12-06 06:02:43,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 584 events. 224/584 cut-off events. For 8820/8910 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3948 event pairs, 0 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 4912. Up to 305 conditions per place. [2022-12-06 06:02:43,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 365 transitions, 7382 flow [2022-12-06 06:02:43,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-06 06:02:43,194 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:43,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 06:02:43,195 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 365 transitions, 7382 flow [2022-12-06 06:02:43,195 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 06:02:43,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:43,196 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:43,200 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 06:02:43,397 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,SelfDestructingSolverStorable21 [2022-12-06 06:02:43,398 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 06:02:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2113528962, now seen corresponding path program 1 times [2022-12-06 06:02:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:43,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479175593] [2022-12-06 06:02:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:43,543 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 06:02:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:43,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479175593] [2022-12-06 06:02:43,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479175593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:43,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774932993] [2022-12-06 06:02:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:43,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:43,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:43,548 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 06:02:43,550 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 06:02:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:43,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:02:43,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:43,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 06:02:43,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:43,894 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 06:02:43,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774932993] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:43,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:43,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179811560] [2022-12-06 06:02:43,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:43,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:43,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 06:02:43,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 365 transitions, 7382 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 06:02:43,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:43,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 06:02:43,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:45,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:02:46,302 INFO L130 PetriNetUnfolder]: 1410/2473 cut-off events. [2022-12-06 06:02:46,303 INFO L131 PetriNetUnfolder]: For 58009/58009 co-relation queries the response was YES. [2022-12-06 06:02:46,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16668 conditions, 2473 events. 1410/2473 cut-off events. For 58009/58009 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 15492 event pairs, 195 based on Foata normal form. 30/2486 useless extension candidates. Maximal degree in co-relation 16600. Up to 1782 conditions per place. [2022-12-06 06:02:46,323 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 286 selfloop transitions, 143 changer transitions 0/429 dead transitions. [2022-12-06 06:02:46,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 429 transitions, 8714 flow [2022-12-06 06:02:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:02:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:02:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2022-12-06 06:02:46,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 06:02:46,326 INFO L175 Difference]: Start difference. First operand has 165 places, 365 transitions, 7382 flow. Second operand 13 states and 104 transitions. [2022-12-06 06:02:46,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 429 transitions, 8714 flow [2022-12-06 06:02:46,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 429 transitions, 8404 flow, removed 138 selfloop flow, removed 3 redundant places. [2022-12-06 06:02:46,601 INFO L231 Difference]: Finished difference. Result has 179 places, 387 transitions, 7931 flow [2022-12-06 06:02:46,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=7072, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7931, PETRI_PLACES=179, PETRI_TRANSITIONS=387} [2022-12-06 06:02:46,602 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 161 predicate places. [2022-12-06 06:02:46,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:46,602 INFO L89 Accepts]: Start accepts. Operand has 179 places, 387 transitions, 7931 flow [2022-12-06 06:02:46,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:46,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:46,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 387 transitions, 7931 flow [2022-12-06 06:02:46,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 387 transitions, 7931 flow [2022-12-06 06:02:46,693 INFO L130 PetriNetUnfolder]: 238/625 cut-off events. [2022-12-06 06:02:46,694 INFO L131 PetriNetUnfolder]: For 11297/11431 co-relation queries the response was YES. [2022-12-06 06:02:46,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 625 events. 238/625 cut-off events. For 11297/11431 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4300 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 5336. Up to 316 conditions per place. [2022-12-06 06:02:46,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 387 transitions, 7931 flow [2022-12-06 06:02:46,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-06 06:02:46,813 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:02:46,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 06:02:46,815 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 387 transitions, 7948 flow [2022-12-06 06:02:46,815 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 06:02:46,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:46,815 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:46,821 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 06:02:47,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:47,021 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 06:02:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:47,021 INFO L85 PathProgramCache]: Analyzing trace with hash 728979226, now seen corresponding path program 1 times [2022-12-06 06:02:47,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:47,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636645674] [2022-12-06 06:02:47,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:47,159 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 06:02:47,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:47,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636645674] [2022-12-06 06:02:47,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636645674] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:47,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954881384] [2022-12-06 06:02:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:47,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:47,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:47,164 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 06:02:47,188 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 06:02:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:47,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:02:47,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:47,337 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 06:02:47,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:47,485 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 06:02:47,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954881384] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:47,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:47,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214026497] [2022-12-06 06:02:47,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:47,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:47,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 06:02:47,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 387 transitions, 7948 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 06:02:47,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:47,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 06:02:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:50,104 INFO L130 PetriNetUnfolder]: 1480/2613 cut-off events. [2022-12-06 06:02:50,104 INFO L131 PetriNetUnfolder]: For 71454/71454 co-relation queries the response was YES. [2022-12-06 06:02:50,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17928 conditions, 2613 events. 1480/2613 cut-off events. For 71454/71454 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 16723 event pairs, 197 based on Foata normal form. 30/2626 useless extension candidates. Maximal degree in co-relation 17854. Up to 1773 conditions per place. [2022-12-06 06:02:50,122 INFO L137 encePairwiseOnDemand]: 10/36 looper letters, 277 selfloop transitions, 182 changer transitions 0/459 dead transitions. [2022-12-06 06:02:50,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 459 transitions, 9639 flow [2022-12-06 06:02:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:02:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:02:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-12-06 06:02:50,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2264957264957265 [2022-12-06 06:02:50,124 INFO L175 Difference]: Start difference. First operand has 179 places, 387 transitions, 7948 flow. Second operand 13 states and 106 transitions. [2022-12-06 06:02:50,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 459 transitions, 9639 flow [2022-12-06 06:02:50,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 459 transitions, 9486 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:50,399 INFO L231 Difference]: Finished difference. Result has 191 places, 417 transitions, 9104 flow [2022-12-06 06:02:50,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7795, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9104, PETRI_PLACES=191, PETRI_TRANSITIONS=417} [2022-12-06 06:02:50,400 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 173 predicate places. [2022-12-06 06:02:50,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:50,400 INFO L89 Accepts]: Start accepts. Operand has 191 places, 417 transitions, 9104 flow [2022-12-06 06:02:50,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:50,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:50,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 417 transitions, 9104 flow [2022-12-06 06:02:50,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 417 transitions, 9104 flow [2022-12-06 06:02:50,492 INFO L130 PetriNetUnfolder]: 255/676 cut-off events. [2022-12-06 06:02:50,492 INFO L131 PetriNetUnfolder]: For 13402/13512 co-relation queries the response was YES. [2022-12-06 06:02:50,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6147 conditions, 676 events. 255/676 cut-off events. For 13402/13512 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4770 event pairs, 0 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 6071. Up to 349 conditions per place. [2022-12-06 06:02:50,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 417 transitions, 9104 flow [2022-12-06 06:02:50,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-06 06:02:50,500 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:50,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 06:02:50,500 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 417 transitions, 9104 flow [2022-12-06 06:02:50,501 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 06:02:50,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:50,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:50,510 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 06:02:50,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:50,706 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 06:02:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash -118513400, now seen corresponding path program 1 times [2022-12-06 06:02:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:50,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95388647] [2022-12-06 06:02:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:50,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:50,855 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 06:02:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:50,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95388647] [2022-12-06 06:02:50,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95388647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:50,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317372842] [2022-12-06 06:02:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:50,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:50,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:50,860 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 06:02:50,886 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 06:02:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:50,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:02:50,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:51,060 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 06:02:51,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:51,208 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 06:02:51,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317372842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:51,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:51,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043900198] [2022-12-06 06:02:51,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:51,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:51,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 06:02:51,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 417 transitions, 9104 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 06:02:51,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:51,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 06:02:51,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:52,910 INFO L130 PetriNetUnfolder]: 1732/3061 cut-off events. [2022-12-06 06:02:52,910 INFO L131 PetriNetUnfolder]: For 102975/102975 co-relation queries the response was YES. [2022-12-06 06:02:52,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21768 conditions, 3061 events. 1732/3061 cut-off events. For 102975/102975 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 20201 event pairs, 173 based on Foata normal form. 34/3078 useless extension candidates. Maximal degree in co-relation 21689. Up to 1606 conditions per place. [2022-12-06 06:02:52,928 INFO L137 encePairwiseOnDemand]: 8/36 looper letters, 287 selfloop transitions, 280 changer transitions 1/568 dead transitions. [2022-12-06 06:02:52,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 568 transitions, 11981 flow [2022-12-06 06:02:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:02:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:02:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 162 transitions. [2022-12-06 06:02:52,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-06 06:02:52,929 INFO L175 Difference]: Start difference. First operand has 191 places, 417 transitions, 9104 flow. Second operand 21 states and 162 transitions. [2022-12-06 06:02:52,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 568 transitions, 11981 flow [2022-12-06 06:02:53,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 568 transitions, 11838 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-06 06:02:53,194 INFO L231 Difference]: Finished difference. Result has 216 places, 490 transitions, 11313 flow [2022-12-06 06:02:53,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=8961, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=11313, PETRI_PLACES=216, PETRI_TRANSITIONS=490} [2022-12-06 06:02:53,195 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 198 predicate places. [2022-12-06 06:02:53,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:53,195 INFO L89 Accepts]: Start accepts. Operand has 216 places, 490 transitions, 11313 flow [2022-12-06 06:02:53,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:53,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:53,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 490 transitions, 11313 flow [2022-12-06 06:02:53,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 490 transitions, 11313 flow [2022-12-06 06:02:53,329 INFO L130 PetriNetUnfolder]: 296/782 cut-off events. [2022-12-06 06:02:53,329 INFO L131 PetriNetUnfolder]: For 19247/19386 co-relation queries the response was YES. [2022-12-06 06:02:53,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7569 conditions, 782 events. 296/782 cut-off events. For 19247/19386 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 5789 event pairs, 0 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 7483. Up to 412 conditions per place. [2022-12-06 06:02:53,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 490 transitions, 11313 flow [2022-12-06 06:02:53,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 1454 [2022-12-06 06:02:53,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:02:53,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 06:02:53,386 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 490 transitions, 11328 flow [2022-12-06 06:02:53,386 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 06:02:53,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:53,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:53,398 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 06:02:53,591 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,SelfDestructingSolverStorable24 [2022-12-06 06:02:53,592 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 06:02:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2111802014, now seen corresponding path program 1 times [2022-12-06 06:02:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:53,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547713022] [2022-12-06 06:02:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:53,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:53,735 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 06:02:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547713022] [2022-12-06 06:02:53,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547713022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483000995] [2022-12-06 06:02:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:53,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:53,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:53,738 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 06:02:53,740 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 06:02:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:53,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:02:53,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:53,937 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 06:02:53,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:54,085 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 06:02:54,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483000995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:54,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:54,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141536423] [2022-12-06 06:02:54,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:54,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:54,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 06:02:54,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 490 transitions, 11328 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 06:02:54,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:54,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 06:02:54,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:55,169 INFO L130 PetriNetUnfolder]: 1988/3485 cut-off events. [2022-12-06 06:02:55,170 INFO L131 PetriNetUnfolder]: For 134362/134362 co-relation queries the response was YES. [2022-12-06 06:02:55,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26880 conditions, 3485 events. 1988/3485 cut-off events. For 134362/134362 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 23346 event pairs, 150 based on Foata normal form. 24/3492 useless extension candidates. Maximal degree in co-relation 26791. Up to 1378 conditions per place. [2022-12-06 06:02:55,197 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 252 selfloop transitions, 359 changer transitions 0/611 dead transitions. [2022-12-06 06:02:55,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 611 transitions, 14215 flow [2022-12-06 06:02:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 06:02:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 06:02:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2022-12-06 06:02:55,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2594594594594595 [2022-12-06 06:02:55,199 INFO L175 Difference]: Start difference. First operand has 216 places, 490 transitions, 11328 flow. Second operand 15 states and 144 transitions. [2022-12-06 06:02:55,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 611 transitions, 14215 flow [2022-12-06 06:02:55,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 611 transitions, 13922 flow, removed 125 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:55,659 INFO L231 Difference]: Finished difference. Result has 231 places, 540 transitions, 13507 flow [2022-12-06 06:02:55,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11093, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13507, PETRI_PLACES=231, PETRI_TRANSITIONS=540} [2022-12-06 06:02:55,660 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 213 predicate places. [2022-12-06 06:02:55,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:55,660 INFO L89 Accepts]: Start accepts. Operand has 231 places, 540 transitions, 13507 flow [2022-12-06 06:02:55,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:55,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:55,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 540 transitions, 13507 flow [2022-12-06 06:02:55,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 540 transitions, 13507 flow [2022-12-06 06:02:55,776 INFO L130 PetriNetUnfolder]: 330/868 cut-off events. [2022-12-06 06:02:55,776 INFO L131 PetriNetUnfolder]: For 25327/25469 co-relation queries the response was YES. [2022-12-06 06:02:55,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9099 conditions, 868 events. 330/868 cut-off events. For 25327/25469 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 6554 event pairs, 0 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 9007. Up to 473 conditions per place. [2022-12-06 06:02:55,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 540 transitions, 13507 flow [2022-12-06 06:02:55,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 1644 [2022-12-06 06:02:55,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:02:55,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 06:02:55,823 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 540 transitions, 13509 flow [2022-12-06 06:02:55,823 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 06:02:55,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:55,823 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:55,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:56,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 06:02:56,028 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 06:02:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash -107430590, now seen corresponding path program 1 times [2022-12-06 06:02:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:56,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294303825] [2022-12-06 06:02:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:56,192 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 06:02:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:56,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294303825] [2022-12-06 06:02:56,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294303825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:56,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230016482] [2022-12-06 06:02:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:56,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:56,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:56,196 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 06:02:56,207 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 06:02:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:56,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:02:56,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:56,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 06:02:56,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:56,560 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 06:02:56,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230016482] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:56,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:56,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875673501] [2022-12-06 06:02:56,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:56,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:56,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 06:02:56,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 540 transitions, 13509 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 06:02:56,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:56,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 06:02:56,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:00,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:03:04,024 INFO L130 PetriNetUnfolder]: 2282/4001 cut-off events. [2022-12-06 06:03:04,025 INFO L131 PetriNetUnfolder]: For 184052/184052 co-relation queries the response was YES. [2022-12-06 06:03:04,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32833 conditions, 4001 events. 2282/4001 cut-off events. For 184052/184052 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 27501 event pairs, 209 based on Foata normal form. 32/4016 useless extension candidates. Maximal degree in co-relation 32738. Up to 2187 conditions per place. [2022-12-06 06:03:04,053 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 372 selfloop transitions, 347 changer transitions 2/721 dead transitions. [2022-12-06 06:03:04,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 721 transitions, 17492 flow [2022-12-06 06:03:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:03:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:03:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 185 transitions. [2022-12-06 06:03:04,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18724696356275303 [2022-12-06 06:03:04,055 INFO L175 Difference]: Start difference. First operand has 231 places, 540 transitions, 13509 flow. Second operand 26 states and 185 transitions. [2022-12-06 06:03:04,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 721 transitions, 17492 flow [2022-12-06 06:03:04,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 721 transitions, 17216 flow, removed 86 selfloop flow, removed 7 redundant places. [2022-12-06 06:03:04,814 INFO L231 Difference]: Finished difference. Result has 259 places, 632 transitions, 16612 flow [2022-12-06 06:03:04,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=13279, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=16612, PETRI_PLACES=259, PETRI_TRANSITIONS=632} [2022-12-06 06:03:04,814 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 241 predicate places. [2022-12-06 06:03:04,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:04,814 INFO L89 Accepts]: Start accepts. Operand has 259 places, 632 transitions, 16612 flow [2022-12-06 06:03:04,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:04,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:04,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 632 transitions, 16612 flow [2022-12-06 06:03:04,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 632 transitions, 16612 flow [2022-12-06 06:03:05,001 INFO L130 PetriNetUnfolder]: 384/1004 cut-off events. [2022-12-06 06:03:05,001 INFO L131 PetriNetUnfolder]: For 32565/32685 co-relation queries the response was YES. [2022-12-06 06:03:05,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11066 conditions, 1004 events. 384/1004 cut-off events. For 32565/32685 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 7846 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 10966. Up to 567 conditions per place. [2022-12-06 06:03:05,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 632 transitions, 16612 flow [2022-12-06 06:03:05,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 1888 [2022-12-06 06:03:05,125 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:03:05,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-06 06:03:05,126 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 632 transitions, 16648 flow [2022-12-06 06:03:05,126 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 06:03:05,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:05,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:05,134 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 06:03:05,331 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,SelfDestructingSolverStorable26 [2022-12-06 06:03:05,331 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 06:03:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1043319281, now seen corresponding path program 1 times [2022-12-06 06:03:05,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:05,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718669175] [2022-12-06 06:03:05,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:05,484 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 06:03:05,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:05,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718669175] [2022-12-06 06:03:05,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718669175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:05,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517349360] [2022-12-06 06:03:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:05,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:05,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:05,491 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 06:03:05,492 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 06:03:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:05,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:03:05,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:05,682 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 06:03:05,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:05,884 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 06:03:05,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517349360] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:05,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:05,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:03:05,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435704474] [2022-12-06 06:03:05,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:03:05,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:03:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:03:05,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 06:03:05,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 632 transitions, 16648 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 06:03:05,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:05,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 06:03:05,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:08,559 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 [] [2022-12-06 06:03:09,662 INFO L130 PetriNetUnfolder]: 2568/4499 cut-off events. [2022-12-06 06:03:09,662 INFO L131 PetriNetUnfolder]: For 275936/275936 co-relation queries the response was YES. [2022-12-06 06:03:09,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39229 conditions, 4499 events. 2568/4499 cut-off events. For 275936/275936 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 31246 event pairs, 283 based on Foata normal form. 62/4544 useless extension candidates. Maximal degree in co-relation 39126. Up to 2249 conditions per place. [2022-12-06 06:03:09,696 INFO L137 encePairwiseOnDemand]: 8/39 looper letters, 394 selfloop transitions, 402 changer transitions 0/796 dead transitions. [2022-12-06 06:03:09,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 796 transitions, 21048 flow [2022-12-06 06:03:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:03:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:03:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 176 transitions. [2022-12-06 06:03:09,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2148962148962149 [2022-12-06 06:03:09,698 INFO L175 Difference]: Start difference. First operand has 259 places, 632 transitions, 16648 flow. Second operand 21 states and 176 transitions. [2022-12-06 06:03:09,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 796 transitions, 21048 flow [2022-12-06 06:03:10,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 796 transitions, 20466 flow, removed 241 selfloop flow, removed 10 redundant places. [2022-12-06 06:03:10,693 INFO L231 Difference]: Finished difference. Result has 278 places, 710 transitions, 19599 flow [2022-12-06 06:03:10,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=16078, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=334, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=19599, PETRI_PLACES=278, PETRI_TRANSITIONS=710} [2022-12-06 06:03:10,694 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 260 predicate places. [2022-12-06 06:03:10,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:10,694 INFO L89 Accepts]: Start accepts. Operand has 278 places, 710 transitions, 19599 flow [2022-12-06 06:03:10,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:10,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:10,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 710 transitions, 19599 flow [2022-12-06 06:03:10,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 710 transitions, 19599 flow [2022-12-06 06:03:10,947 INFO L130 PetriNetUnfolder]: 427/1117 cut-off events. [2022-12-06 06:03:10,947 INFO L131 PetriNetUnfolder]: For 47496/47610 co-relation queries the response was YES. [2022-12-06 06:03:10,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13066 conditions, 1117 events. 427/1117 cut-off events. For 47496/47610 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 8890 event pairs, 0 based on Foata normal form. 0/1113 useless extension candidates. Maximal degree in co-relation 12958. Up to 639 conditions per place. [2022-12-06 06:03:10,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 710 transitions, 19599 flow [2022-12-06 06:03:10,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 2122 [2022-12-06 06:03:10,963 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:03:10,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 06:03:10,963 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 710 transitions, 19599 flow [2022-12-06 06:03:10,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 06:03:10,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:10,964 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:11,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 06:03:11,166 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 06:03:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 679696444, now seen corresponding path program 1 times [2022-12-06 06:03:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:11,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547719364] [2022-12-06 06:03:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:11,299 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 06:03:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:11,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547719364] [2022-12-06 06:03:11,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547719364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:11,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986466347] [2022-12-06 06:03:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:11,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:11,302 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 06:03:11,303 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 06:03:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:11,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:03:11,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:11,495 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 06:03:11,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:11,648 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 06:03:11,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986466347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:11,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:11,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:03:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143095384] [2022-12-06 06:03:11,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:11,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:03:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:11,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:03:11,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:03:11,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 06:03:11,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 710 transitions, 19599 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 06:03:11,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:11,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 06:03:11,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:18,491 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 [] [2022-12-06 06:03:20,505 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 [] [2022-12-06 06:03:24,687 INFO L130 PetriNetUnfolder]: 2994/5243 cut-off events. [2022-12-06 06:03:24,687 INFO L131 PetriNetUnfolder]: For 341742/341742 co-relation queries the response was YES. [2022-12-06 06:03:24,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48787 conditions, 5243 events. 2994/5243 cut-off events. For 341742/341742 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 37243 event pairs, 224 based on Foata normal form. 36/5254 useless extension candidates. Maximal degree in co-relation 48676. Up to 2243 conditions per place. [2022-12-06 06:03:24,732 INFO L137 encePairwiseOnDemand]: 8/39 looper letters, 370 selfloop transitions, 561 changer transitions 0/931 dead transitions. [2022-12-06 06:03:24,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 931 transitions, 25603 flow [2022-12-06 06:03:24,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 06:03:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 06:03:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 209 transitions. [2022-12-06 06:03:24,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1847922192749779 [2022-12-06 06:03:24,734 INFO L175 Difference]: Start difference. First operand has 278 places, 710 transitions, 19599 flow. Second operand 29 states and 209 transitions. [2022-12-06 06:03:24,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 931 transitions, 25603 flow [2022-12-06 06:03:26,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 931 transitions, 24111 flow, removed 652 selfloop flow, removed 10 redundant places. [2022-12-06 06:03:26,198 INFO L231 Difference]: Finished difference. Result has 308 places, 830 transitions, 23664 flow [2022-12-06 06:03:26,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=18343, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=457, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=23664, PETRI_PLACES=308, PETRI_TRANSITIONS=830} [2022-12-06 06:03:26,199 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 290 predicate places. [2022-12-06 06:03:26,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:26,199 INFO L89 Accepts]: Start accepts. Operand has 308 places, 830 transitions, 23664 flow [2022-12-06 06:03:26,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:26,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:26,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 830 transitions, 23664 flow [2022-12-06 06:03:26,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 830 transitions, 23664 flow [2022-12-06 06:03:26,493 INFO L130 PetriNetUnfolder]: 504/1315 cut-off events. [2022-12-06 06:03:26,493 INFO L131 PetriNetUnfolder]: For 67873/67971 co-relation queries the response was YES. [2022-12-06 06:03:26,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15933 conditions, 1315 events. 504/1315 cut-off events. For 67873/67971 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 10850 event pairs, 0 based on Foata normal form. 0/1311 useless extension candidates. Maximal degree in co-relation 15817. Up to 716 conditions per place. [2022-12-06 06:03:26,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 830 transitions, 23664 flow [2022-12-06 06:03:26,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 2448 [2022-12-06 06:03:26,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} 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 10) (= 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 06:03:26,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} 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 10)) 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 06:03:26,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L695-5-->L695-5: Formula: (and (= (+ 2 v_~q~0_133) v_~q~0_131) (< v_~q~0_133 9) (= v_~j~0_211 (+ v_~j~0_213 (* 2 v_~i~0_177)))) InVars {~j~0=v_~j~0_213, ~i~0=v_~i~0_177, ~q~0=v_~q~0_133} OutVars{~j~0=v_~j~0_211, ~i~0=v_~i~0_177, ~q~0=v_~q~0_131, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_92|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [394] L705-6-->L695-5: Formula: (and (= (+ (* v_~prev~0_323 17711) (* 28657 v_~cur~0_277)) v_~next~0_177) (= v_~j~0_325 (+ v_~j~0_326 v_~i~0_293)) (= (+ v_~q~0_219 1) v_~q~0_218) (< v_~q~0_219 10) (< v_~x~0_316 23) (= v_~next~0_177 v_~cur~0_276) (= v_~prev~0_322 (+ (* 10946 v_~prev~0_323) (* 17711 v_~cur~0_277))) (= (+ 22 v_~x~0_317) v_~x~0_316)) InVars {~j~0=v_~j~0_326, ~prev~0=v_~prev~0_323, ~i~0=v_~i~0_293, ~q~0=v_~q~0_219, ~cur~0=v_~cur~0_277, ~x~0=v_~x~0_317} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_203|, ~j~0=v_~j~0_325, ~next~0=v_~next~0_177, ~prev~0=v_~prev~0_322, ~i~0=v_~i~0_293, ~q~0=v_~q~0_218, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_162|, ~cur~0=v_~cur~0_276, ~x~0=v_~x~0_316} 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 06:03:26,808 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:03:26,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 610 [2022-12-06 06:03:26,809 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 830 transitions, 23693 flow [2022-12-06 06:03:26,809 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 06:03:26,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:26,809 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:26,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-06 06:03:27,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 06:03:27,016 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 06:03:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 603016859, now seen corresponding path program 2 times [2022-12-06 06:03:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66518307] [2022-12-06 06:03:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:27,164 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 06:03:27,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:27,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66518307] [2022-12-06 06:03:27,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66518307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:27,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613703301] [2022-12-06 06:03:27,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:03:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:27,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:27,168 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 06:03:27,174 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 06:03:27,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:03:27,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:03:27,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:03:27,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:27,405 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 06:03:27,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:27,594 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 06:03:27,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613703301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:27,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:27,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:03:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678784575] [2022-12-06 06:03:27,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:27,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:03:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:03:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:03:27,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 06:03:27,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 830 transitions, 23693 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 06:03:27,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:27,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 06:03:27,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:30,228 INFO L130 PetriNetUnfolder]: 3520/6165 cut-off events. [2022-12-06 06:03:30,229 INFO L131 PetriNetUnfolder]: For 452513/452513 co-relation queries the response was YES. [2022-12-06 06:03:30,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59566 conditions, 6165 events. 3520/6165 cut-off events. For 452513/452513 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 44940 event pairs, 123 based on Foata normal form. 44/6178 useless extension candidates. Maximal degree in co-relation 59447. Up to 2216 conditions per place. [2022-12-06 06:03:30,289 INFO L137 encePairwiseOnDemand]: 8/43 looper letters, 233 selfloop transitions, 879 changer transitions 2/1114 dead transitions. [2022-12-06 06:03:30,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1114 transitions, 32044 flow [2022-12-06 06:03:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:03:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:03:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 219 transitions. [2022-12-06 06:03:30,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19588550983899822 [2022-12-06 06:03:30,291 INFO L175 Difference]: Start difference. First operand has 308 places, 830 transitions, 23693 flow. Second operand 26 states and 219 transitions. [2022-12-06 06:03:30,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 1114 transitions, 32044 flow [2022-12-06 06:03:32,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 1114 transitions, 30016 flow, removed 934 selfloop flow, removed 9 redundant places. [2022-12-06 06:03:32,330 INFO L231 Difference]: Finished difference. Result has 332 places, 1002 transitions, 30156 flow [2022-12-06 06:03:32,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=22337, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=739, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=30156, PETRI_PLACES=332, PETRI_TRANSITIONS=1002} [2022-12-06 06:03:32,331 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 314 predicate places. [2022-12-06 06:03:32,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:32,331 INFO L89 Accepts]: Start accepts. Operand has 332 places, 1002 transitions, 30156 flow [2022-12-06 06:03:32,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:32,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:32,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 1002 transitions, 30156 flow [2022-12-06 06:03:32,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 1002 transitions, 30156 flow [2022-12-06 06:03:32,724 INFO L130 PetriNetUnfolder]: 597/1564 cut-off events. [2022-12-06 06:03:32,724 INFO L131 PetriNetUnfolder]: For 89877/89983 co-relation queries the response was YES. [2022-12-06 06:03:32,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19949 conditions, 1564 events. 597/1564 cut-off events. For 89877/89983 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 13404 event pairs, 0 based on Foata normal form. 0/1559 useless extension candidates. Maximal degree in co-relation 19825. Up to 781 conditions per place. [2022-12-06 06:03:32,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 1002 transitions, 30156 flow [2022-12-06 06:03:32,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 2902 [2022-12-06 06:03:32,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:03:32,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 495 [2022-12-06 06:03:32,826 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 1002 transitions, 30176 flow [2022-12-06 06:03:32,826 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 06:03:32,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:32,826 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:32,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:33,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:33,027 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 06:03:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash -155564197, now seen corresponding path program 1 times [2022-12-06 06:03:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:33,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468432207] [2022-12-06 06:03:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:33,157 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 06:03:33,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:33,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468432207] [2022-12-06 06:03:33,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468432207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:33,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631940019] [2022-12-06 06:03:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:33,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:33,160 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 06:03:33,186 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 06:03:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:33,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:03:33,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:33,366 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 06:03:33,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:33,515 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 06:03:33,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631940019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:33,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:33,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:33,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905469810] [2022-12-06 06:03:33,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:33,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:33,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:33,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 06:03:33,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1002 transitions, 30176 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 06:03:33,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:33,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 06:03:33,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:45,258 WARN L233 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 44 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:03:50,964 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 38 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:03:54,336 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 [] [2022-12-06 06:03:57,275 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 [] [2022-12-06 06:03:59,342 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 [] [2022-12-06 06:04:01,347 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 [] [2022-12-06 06:04:03,474 INFO L130 PetriNetUnfolder]: 3645/6416 cut-off events. [2022-12-06 06:04:03,474 INFO L131 PetriNetUnfolder]: For 543937/543937 co-relation queries the response was YES. [2022-12-06 06:04:03,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63977 conditions, 6416 events. 3645/6416 cut-off events. For 543937/543937 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 48015 event pairs, 728 based on Foata normal form. 56/6441 useless extension candidates. Maximal degree in co-relation 63850. Up to 4939 conditions per place. [2022-12-06 06:04:03,541 INFO L137 encePairwiseOnDemand]: 8/44 looper letters, 778 selfloop transitions, 352 changer transitions 2/1132 dead transitions. [2022-12-06 06:04:03,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1132 transitions, 34634 flow [2022-12-06 06:04:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 06:04:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 06:04:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 150 transitions. [2022-12-06 06:04:03,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17045454545454544 [2022-12-06 06:04:03,542 INFO L175 Difference]: Start difference. First operand has 331 places, 1002 transitions, 30176 flow. Second operand 20 states and 150 transitions. [2022-12-06 06:04:03,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1132 transitions, 34634 flow [2022-12-06 06:04:06,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 1132 transitions, 32276 flow, removed 1055 selfloop flow, removed 14 redundant places. [2022-12-06 06:04:06,329 INFO L231 Difference]: Finished difference. Result has 340 places, 1066 transitions, 31053 flow [2022-12-06 06:04:06,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=28102, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=31053, PETRI_PLACES=340, PETRI_TRANSITIONS=1066} [2022-12-06 06:04:06,330 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 322 predicate places. [2022-12-06 06:04:06,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:06,330 INFO L89 Accepts]: Start accepts. Operand has 340 places, 1066 transitions, 31053 flow [2022-12-06 06:04:06,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:06,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:06,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 1066 transitions, 31053 flow [2022-12-06 06:04:06,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 1066 transitions, 31053 flow [2022-12-06 06:04:06,687 INFO L130 PetriNetUnfolder]: 635/1667 cut-off events. [2022-12-06 06:04:06,687 INFO L131 PetriNetUnfolder]: For 92893/92985 co-relation queries the response was YES. [2022-12-06 06:04:06,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20576 conditions, 1667 events. 635/1667 cut-off events. For 92893/92985 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 14507 event pairs, 0 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 20453. Up to 790 conditions per place. [2022-12-06 06:04:06,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 1066 transitions, 31053 flow [2022-12-06 06:04:06,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 3022 [2022-12-06 06:04:06,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:04:06,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 547 [2022-12-06 06:04:06,877 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 1066 transitions, 31075 flow [2022-12-06 06:04:06,878 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 06:04:06,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:06,878 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:06,884 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 06:04:07,082 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,SelfDestructingSolverStorable30 [2022-12-06 06:04:07,082 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 06:04:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1697532037, now seen corresponding path program 1 times [2022-12-06 06:04:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:07,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428261239] [2022-12-06 06:04:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:07,224 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 06:04:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:07,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428261239] [2022-12-06 06:04:07,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428261239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:07,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562174673] [2022-12-06 06:04:07,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:07,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:07,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:07,226 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 06:04:07,229 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 06:04:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:07,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:04:07,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:07,448 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 06:04:07,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:04:07,621 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 06:04:07,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562174673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:04:07,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:04:07,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:04:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344752911] [2022-12-06 06:04:07,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:04:07,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:04:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:04:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:04:07,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 06:04:07,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 1066 transitions, 31075 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 06:04:07,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:07,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 06:04:07,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:13,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:15,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:17,078 INFO L130 PetriNetUnfolder]: 3813/6726 cut-off events. [2022-12-06 06:04:17,078 INFO L131 PetriNetUnfolder]: For 538493/538493 co-relation queries the response was YES. [2022-12-06 06:04:17,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64784 conditions, 6726 events. 3813/6726 cut-off events. For 538493/538493 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 50947 event pairs, 705 based on Foata normal form. 60/6755 useless extension candidates. Maximal degree in co-relation 64658. Up to 4550 conditions per place. [2022-12-06 06:04:17,138 INFO L137 encePairwiseOnDemand]: 8/45 looper letters, 735 selfloop transitions, 474 changer transitions 0/1209 dead transitions. [2022-12-06 06:04:17,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1209 transitions, 35761 flow [2022-12-06 06:04:17,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 06:04:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 06:04:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 184 transitions. [2022-12-06 06:04:17,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16355555555555557 [2022-12-06 06:04:17,139 INFO L175 Difference]: Start difference. First operand has 340 places, 1066 transitions, 31075 flow. Second operand 25 states and 184 transitions. [2022-12-06 06:04:17,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1209 transitions, 35761 flow [2022-12-06 06:04:19,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1209 transitions, 35577 flow, removed 50 selfloop flow, removed 7 redundant places. [2022-12-06 06:04:19,850 INFO L231 Difference]: Finished difference. Result has 369 places, 1129 transitions, 34603 flow [2022-12-06 06:04:19,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=30891, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1066, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=419, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=34603, PETRI_PLACES=369, PETRI_TRANSITIONS=1129} [2022-12-06 06:04:19,851 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 351 predicate places. [2022-12-06 06:04:19,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:19,851 INFO L89 Accepts]: Start accepts. Operand has 369 places, 1129 transitions, 34603 flow [2022-12-06 06:04:19,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:19,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:19,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 1129 transitions, 34603 flow [2022-12-06 06:04:19,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 1129 transitions, 34603 flow [2022-12-06 06:04:20,250 INFO L130 PetriNetUnfolder]: 671/1761 cut-off events. [2022-12-06 06:04:20,250 INFO L131 PetriNetUnfolder]: For 101023/101177 co-relation queries the response was YES. [2022-12-06 06:04:20,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22601 conditions, 1761 events. 671/1761 cut-off events. For 101023/101177 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 15447 event pairs, 0 based on Foata normal form. 0/1756 useless extension candidates. Maximal degree in co-relation 22466. Up to 856 conditions per place. [2022-12-06 06:04:20,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 369 places, 1129 transitions, 34603 flow [2022-12-06 06:04:20,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 3186 [2022-12-06 06:04:20,445 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:04:20,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 595 [2022-12-06 06:04:20,446 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 1129 transitions, 34731 flow [2022-12-06 06:04:20,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 06:04:20,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:20,446 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:20,454 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 06:04:20,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:20,654 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 06:04:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -155006414, now seen corresponding path program 1 times [2022-12-06 06:04:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:20,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395655283] [2022-12-06 06:04:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:20,768 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 06:04:20,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:20,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395655283] [2022-12-06 06:04:20,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395655283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:20,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921900541] [2022-12-06 06:04:20,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:20,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:20,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:20,770 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 06:04:20,771 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 06:04:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:20,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:04:20,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:20,925 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 06:04:20,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:04:21,035 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 06:04:21,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921900541] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:04:21,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:04:21,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:04:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385262412] [2022-12-06 06:04:21,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:04:21,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:04:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:04:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:04:21,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 06:04:21,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 1129 transitions, 34731 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 06:04:21,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:21,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 06:04:21,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:28,770 WARN L233 SmtUtils]: Spent 7.61s on a formula simplification. DAG size of input: 42 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:04:35,098 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 38 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:04:37,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 [] [2022-12-06 06:04:40,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:42,319 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 [] [2022-12-06 06:04:45,026 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 [] [2022-12-06 06:04:47,034 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 [] [2022-12-06 06:04:48,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:58,645 WARN L233 SmtUtils]: Spent 7.40s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:05:04,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:05:09,560 INFO L130 PetriNetUnfolder]: 3959/7018 cut-off events. [2022-12-06 06:05:09,560 INFO L131 PetriNetUnfolder]: For 600714/600714 co-relation queries the response was YES. [2022-12-06 06:05:09,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70799 conditions, 7018 events. 3959/7018 cut-off events. For 600714/600714 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 53683 event pairs, 750 based on Foata normal form. 44/7031 useless extension candidates. Maximal degree in co-relation 70661. Up to 5313 conditions per place. [2022-12-06 06:05:09,633 INFO L137 encePairwiseOnDemand]: 8/49 looper letters, 859 selfloop transitions, 413 changer transitions 5/1277 dead transitions. [2022-12-06 06:05:09,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1277 transitions, 39859 flow [2022-12-06 06:05:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 06:05:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 06:05:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 170 transitions. [2022-12-06 06:05:09,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1445578231292517 [2022-12-06 06:05:09,635 INFO L175 Difference]: Start difference. First operand has 369 places, 1129 transitions, 34731 flow. Second operand 24 states and 170 transitions. [2022-12-06 06:05:09,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1277 transitions, 39859 flow [2022-12-06 06:05:13,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 1277 transitions, 38886 flow, removed 456 selfloop flow, removed 3 redundant places. [2022-12-06 06:05:13,215 INFO L231 Difference]: Finished difference. Result has 393 places, 1201 transitions, 37567 flow [2022-12-06 06:05:13,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=33814, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=37567, PETRI_PLACES=393, PETRI_TRANSITIONS=1201} [2022-12-06 06:05:13,216 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 375 predicate places. [2022-12-06 06:05:13,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:13,216 INFO L89 Accepts]: Start accepts. Operand has 393 places, 1201 transitions, 37567 flow [2022-12-06 06:05:13,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:13,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:13,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 393 places, 1201 transitions, 37567 flow [2022-12-06 06:05:13,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 393 places, 1201 transitions, 37567 flow [2022-12-06 06:05:13,720 INFO L130 PetriNetUnfolder]: 712/1874 cut-off events. [2022-12-06 06:05:13,720 INFO L131 PetriNetUnfolder]: For 110676/110846 co-relation queries the response was YES. [2022-12-06 06:05:13,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24342 conditions, 1874 events. 712/1874 cut-off events. For 110676/110846 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 16696 event pairs, 0 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 24202. Up to 882 conditions per place. [2022-12-06 06:05:13,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 393 places, 1201 transitions, 37567 flow [2022-12-06 06:05:13,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 3320 [2022-12-06 06:05:13,911 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:05:13,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 696 [2022-12-06 06:05:13,912 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 1201 transitions, 37620 flow [2022-12-06 06:05:13,912 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 06:05:13,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:13,912 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:13,919 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 06:05:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:14,117 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 06:05:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash 735711992, now seen corresponding path program 1 times [2022-12-06 06:05:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668533090] [2022-12-06 06:05:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:14,168 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 06:05:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668533090] [2022-12-06 06:05:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668533090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204673417] [2022-12-06 06:05:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:14,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:14,171 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 06:05:14,174 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 06:05:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:14,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 06:05:14,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:14,270 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 06:05:14,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:05:14,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204673417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:05:14,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:05:14,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 06:05:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845106775] [2022-12-06 06:05:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:05:14,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:05:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:05:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:05:14,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 06:05:14,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 1201 transitions, 37620 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:14,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:14,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 06:05:14,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:17,517 INFO L130 PetriNetUnfolder]: 4158/7301 cut-off events. [2022-12-06 06:05:17,517 INFO L131 PetriNetUnfolder]: For 553985/553985 co-relation queries the response was YES. [2022-12-06 06:05:17,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74939 conditions, 7301 events. 4158/7301 cut-off events. For 553985/553985 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 56112 event pairs, 714 based on Foata normal form. 9/7279 useless extension candidates. Maximal degree in co-relation 74796. Up to 3379 conditions per place. [2022-12-06 06:05:17,595 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 1876 selfloop transitions, 20 changer transitions 8/1904 dead transitions. [2022-12-06 06:05:17,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1904 transitions, 63432 flow [2022-12-06 06:05:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:05:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:05:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-06 06:05:17,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28846153846153844 [2022-12-06 06:05:17,596 INFO L175 Difference]: Start difference. First operand has 393 places, 1201 transitions, 37620 flow. Second operand 6 states and 90 transitions. [2022-12-06 06:05:17,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 1904 transitions, 63432 flow [2022-12-06 06:05:21,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 1904 transitions, 62618 flow, removed 265 selfloop flow, removed 11 redundant places. [2022-12-06 06:05:21,222 INFO L231 Difference]: Finished difference. Result has 389 places, 1206 transitions, 37255 flow [2022-12-06 06:05:21,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=37099, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=37255, PETRI_PLACES=389, PETRI_TRANSITIONS=1206} [2022-12-06 06:05:21,223 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 371 predicate places. [2022-12-06 06:05:21,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:21,223 INFO L89 Accepts]: Start accepts. Operand has 389 places, 1206 transitions, 37255 flow [2022-12-06 06:05:21,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:21,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:21,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 1206 transitions, 37255 flow [2022-12-06 06:05:21,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 1206 transitions, 37255 flow [2022-12-06 06:05:21,761 INFO L130 PetriNetUnfolder]: 758/1967 cut-off events. [2022-12-06 06:05:21,761 INFO L131 PetriNetUnfolder]: For 127248/127461 co-relation queries the response was YES. [2022-12-06 06:05:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25937 conditions, 1967 events. 758/1967 cut-off events. For 127248/127461 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 17580 event pairs, 0 based on Foata normal form. 2/1965 useless extension candidates. Maximal degree in co-relation 25796. Up to 935 conditions per place. [2022-12-06 06:05:21,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 1206 transitions, 37255 flow [2022-12-06 06:05:21,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 3408 [2022-12-06 06:05:21,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:05:21,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 669 [2022-12-06 06:05:21,892 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 1206 transitions, 37325 flow [2022-12-06 06:05:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:21,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:21,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:21,900 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 06:05:22,093 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,SelfDestructingSolverStorable33 [2022-12-06 06:05:22,093 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 06:05:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -89347453, now seen corresponding path program 1 times [2022-12-06 06:05:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:22,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949197467] [2022-12-06 06:05:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:22,240 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 06:05:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:22,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949197467] [2022-12-06 06:05:22,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949197467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:22,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957773100] [2022-12-06 06:05:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:22,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:22,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:22,242 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 06:05:22,245 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 06:05:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:22,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:05:22,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:22,451 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 06:05:22,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:22,597 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 06:05:22,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957773100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:22,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:05:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973971155] [2022-12-06 06:05:22,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:22,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:05:22,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:05:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:05:22,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:05:22,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 1206 transitions, 37325 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 06:05:22,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:22,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:05:22,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:27,488 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 [] [2022-12-06 06:05:29,704 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 [] [2022-12-06 06:05:32,531 INFO L130 PetriNetUnfolder]: 4306/7569 cut-off events. [2022-12-06 06:05:32,532 INFO L131 PetriNetUnfolder]: For 645524/645524 co-relation queries the response was YES. [2022-12-06 06:05:32,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79314 conditions, 7569 events. 4306/7569 cut-off events. For 645524/645524 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 58176 event pairs, 755 based on Foata normal form. 30/7574 useless extension candidates. Maximal degree in co-relation 79170. Up to 5238 conditions per place. [2022-12-06 06:05:32,614 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 826 selfloop transitions, 513 changer transitions 0/1339 dead transitions. [2022-12-06 06:05:32,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1339 transitions, 42279 flow [2022-12-06 06:05:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:05:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:05:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 170 transitions. [2022-12-06 06:05:32,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14991181657848324 [2022-12-06 06:05:32,616 INFO L175 Difference]: Start difference. First operand has 389 places, 1206 transitions, 37325 flow. Second operand 21 states and 170 transitions. [2022-12-06 06:05:32,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1339 transitions, 42279 flow [2022-12-06 06:05:37,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 1339 transitions, 42260 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 06:05:37,109 INFO L231 Difference]: Finished difference. Result has 419 places, 1257 transitions, 40957 flow [2022-12-06 06:05:37,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=37306, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=470, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=40957, PETRI_PLACES=419, PETRI_TRANSITIONS=1257} [2022-12-06 06:05:37,110 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 401 predicate places. [2022-12-06 06:05:37,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:37,110 INFO L89 Accepts]: Start accepts. Operand has 419 places, 1257 transitions, 40957 flow [2022-12-06 06:05:37,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:37,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:37,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 1257 transitions, 40957 flow [2022-12-06 06:05:37,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 419 places, 1257 transitions, 40957 flow [2022-12-06 06:05:37,672 INFO L130 PetriNetUnfolder]: 784/2039 cut-off events. [2022-12-06 06:05:37,673 INFO L131 PetriNetUnfolder]: For 150938/151213 co-relation queries the response was YES. [2022-12-06 06:05:37,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28308 conditions, 2039 events. 784/2039 cut-off events. For 150938/151213 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 18427 event pairs, 0 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 28155. Up to 980 conditions per place. [2022-12-06 06:05:37,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 1257 transitions, 40957 flow [2022-12-06 06:05:37,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 3534 [2022-12-06 06:05:37,719 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:05:37,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 609 [2022-12-06 06:05:37,720 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 1257 transitions, 40957 flow [2022-12-06 06:05:37,720 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 06:05:37,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:37,720 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:37,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 06:05:37,920 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,SelfDestructingSolverStorable34 [2022-12-06 06:05:37,921 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 06:05:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash -103914291, now seen corresponding path program 1 times [2022-12-06 06:05:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:37,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90437169] [2022-12-06 06:05:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:38,040 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 06:05:38,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:38,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90437169] [2022-12-06 06:05:38,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90437169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:38,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694704463] [2022-12-06 06:05:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:38,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:38,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:38,044 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 06:05:38,052 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 06:05:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:38,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:05:38,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:38,247 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 06:05:38,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:38,463 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 06:05:38,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694704463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:38,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:38,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:05:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808773972] [2022-12-06 06:05:38,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:38,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:05:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:38,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:05:38,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:05:38,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:05:38,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 1257 transitions, 40957 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 06:05:38,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:38,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:05:38,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:43,154 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 [] [2022-12-06 06:05:45,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:05:48,876 INFO L130 PetriNetUnfolder]: 4464/7885 cut-off events. [2022-12-06 06:05:48,876 INFO L131 PetriNetUnfolder]: For 806855/806855 co-relation queries the response was YES. [2022-12-06 06:05:48,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86169 conditions, 7885 events. 4464/7885 cut-off events. For 806855/806855 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 61335 event pairs, 909 based on Foata normal form. 52/7912 useless extension candidates. Maximal degree in co-relation 86013. Up to 5992 conditions per place. [2022-12-06 06:05:48,960 INFO L137 encePairwiseOnDemand]: 9/54 looper letters, 937 selfloop transitions, 455 changer transitions 3/1395 dead transitions. [2022-12-06 06:05:48,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1395 transitions, 46637 flow [2022-12-06 06:05:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 06:05:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 06:05:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 139 transitions. [2022-12-06 06:05:48,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1514161220043573 [2022-12-06 06:05:48,961 INFO L175 Difference]: Start difference. First operand has 419 places, 1257 transitions, 40957 flow. Second operand 17 states and 139 transitions. [2022-12-06 06:05:48,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 1395 transitions, 46637 flow [2022-12-06 06:05:53,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1395 transitions, 46328 flow, removed 80 selfloop flow, removed 6 redundant places. [2022-12-06 06:05:53,669 INFO L231 Difference]: Finished difference. Result has 434 places, 1328 transitions, 44940 flow [2022-12-06 06:05:53,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=40648, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=394, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=44940, PETRI_PLACES=434, PETRI_TRANSITIONS=1328} [2022-12-06 06:05:53,670 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 416 predicate places. [2022-12-06 06:05:53,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:53,670 INFO L89 Accepts]: Start accepts. Operand has 434 places, 1328 transitions, 44940 flow [2022-12-06 06:05:53,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:53,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:53,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 434 places, 1328 transitions, 44940 flow [2022-12-06 06:05:53,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 434 places, 1328 transitions, 44940 flow [2022-12-06 06:05:54,262 INFO L130 PetriNetUnfolder]: 822/2164 cut-off events. [2022-12-06 06:05:54,262 INFO L131 PetriNetUnfolder]: For 165341/165656 co-relation queries the response was YES. [2022-12-06 06:05:54,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30856 conditions, 2164 events. 822/2164 cut-off events. For 165341/165656 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 19865 event pairs, 0 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 30698. Up to 1058 conditions per place. [2022-12-06 06:05:54,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 434 places, 1328 transitions, 44940 flow [2022-12-06 06:05:54,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 3688 [2022-12-06 06:05:54,310 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:05:54,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 641 [2022-12-06 06:05:54,311 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 1328 transitions, 44940 flow [2022-12-06 06:05:54,311 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 06:05:54,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:54,312 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:54,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-06 06:05:54,516 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,SelfDestructingSolverStorable35 [2022-12-06 06:05:54,517 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 06:05:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1734243150, now seen corresponding path program 1 times [2022-12-06 06:05:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035383614] [2022-12-06 06:05:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:54,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:54,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035383614] [2022-12-06 06:05:54,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035383614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:54,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688124241] [2022-12-06 06:05:54,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:54,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:54,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:54,675 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 06:05:54,680 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 06:05:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:54,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:05:54,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:54,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:55,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688124241] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:55,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:55,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 06:05:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962909503] [2022-12-06 06:05:55,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:55,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 06:05:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 06:05:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-06 06:05:55,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:05:55,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 1328 transitions, 44940 flow. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 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 06:05:55,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:55,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:05:55,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:06:05,965 INFO L130 PetriNetUnfolder]: 4830/8539 cut-off events. [2022-12-06 06:06:05,965 INFO L131 PetriNetUnfolder]: For 1140058/1140058 co-relation queries the response was YES. [2022-12-06 06:06:06,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96235 conditions, 8539 events. 4830/8539 cut-off events. For 1140058/1140058 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 67089 event pairs, 699 based on Foata normal form. 94/8608 useless extension candidates. Maximal degree in co-relation 96074. Up to 4986 conditions per place. [2022-12-06 06:06:06,055 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 835 selfloop transitions, 714 changer transitions 0/1549 dead transitions. [2022-12-06 06:06:06,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1549 transitions, 52863 flow [2022-12-06 06:06:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 06:06:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 06:06:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 221 transitions. [2022-12-06 06:06:06,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15157750342935528 [2022-12-06 06:06:06,056 INFO L175 Difference]: Start difference. First operand has 434 places, 1328 transitions, 44940 flow. Second operand 27 states and 221 transitions. [2022-12-06 06:06:06,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1549 transitions, 52863 flow [2022-12-06 06:06:11,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 1549 transitions, 51859 flow, removed 450 selfloop flow, removed 9 redundant places. [2022-12-06 06:06:11,740 INFO L231 Difference]: Finished difference. Result has 467 places, 1436 transitions, 50564 flow [2022-12-06 06:06:11,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=43992, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=619, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=50564, PETRI_PLACES=467, PETRI_TRANSITIONS=1436} [2022-12-06 06:06:11,741 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 449 predicate places. [2022-12-06 06:06:11,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:06:11,741 INFO L89 Accepts]: Start accepts. Operand has 467 places, 1436 transitions, 50564 flow [2022-12-06 06:06:11,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:06:11,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:06:11,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 467 places, 1436 transitions, 50564 flow [2022-12-06 06:06:11,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 467 places, 1436 transitions, 50564 flow [2022-12-06 06:06:12,531 INFO L130 PetriNetUnfolder]: 899/2360 cut-off events. [2022-12-06 06:06:12,531 INFO L131 PetriNetUnfolder]: For 222476/222783 co-relation queries the response was YES. [2022-12-06 06:06:12,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35604 conditions, 2360 events. 899/2360 cut-off events. For 222476/222783 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 21716 event pairs, 0 based on Foata normal form. 0/2356 useless extension candidates. Maximal degree in co-relation 35429. Up to 1099 conditions per place. [2022-12-06 06:06:12,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 467 places, 1436 transitions, 50564 flow [2022-12-06 06:06:12,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 3994 [2022-12-06 06:06:12,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:06:12,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 891 [2022-12-06 06:06:12,632 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 1436 transitions, 50567 flow [2022-12-06 06:06:12,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 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 06:06:12,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:06:12,632 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:06:12,637 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 06:06:12,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:06:12,838 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 06:06:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:06:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash -504286308, now seen corresponding path program 1 times [2022-12-06 06:06:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:06:12,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756255291] [2022-12-06 06:06:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:06:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:12,969 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 06:06:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:06:12,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756255291] [2022-12-06 06:06:12,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756255291] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:06:12,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182793382] [2022-12-06 06:06:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:06:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:06:12,972 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 06:06:12,978 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 06:06:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:13,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:06:13,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:06:13,185 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 06:06:13,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:06:13,340 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 06:06:13,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182793382] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:06:13,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:06:13,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:06:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138241337] [2022-12-06 06:06:13,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:06:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:06:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:06:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:06:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:06:13,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 06:06:13,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 1436 transitions, 50567 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 06:06:13,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:06:13,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 06:06:13,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:06:20,713 WARN L233 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 49 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:06:32,545 WARN L233 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 47 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:06:34,814 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 [] [2022-12-06 06:06:37,228 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 [] [2022-12-06 06:06:39,239 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 [] [2022-12-06 06:06:41,316 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 [] [2022-12-06 06:06:54,150 INFO L130 PetriNetUnfolder]: 5026/8935 cut-off events. [2022-12-06 06:06:54,150 INFO L131 PetriNetUnfolder]: For 1141940/1141940 co-relation queries the response was YES. [2022-12-06 06:06:54,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104528 conditions, 8935 events. 5026/8935 cut-off events. For 1141940/1141940 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 71305 event pairs, 929 based on Foata normal form. 58/8968 useless extension candidates. Maximal degree in co-relation 104350. Up to 6274 conditions per place. [2022-12-06 06:06:54,319 INFO L137 encePairwiseOnDemand]: 9/55 looper letters, 984 selfloop transitions, 658 changer transitions 4/1646 dead transitions. [2022-12-06 06:06:54,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 1646 transitions, 58197 flow [2022-12-06 06:06:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 06:06:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 06:06:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 205 transitions. [2022-12-06 06:06:54,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12424242424242424 [2022-12-06 06:06:54,322 INFO L175 Difference]: Start difference. First operand has 467 places, 1436 transitions, 50567 flow. Second operand 30 states and 205 transitions. [2022-12-06 06:06:54,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 1646 transitions, 58197 flow [2022-12-06 06:07:01,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 1646 transitions, 55745 flow, removed 1103 selfloop flow, removed 4 redundant places. [2022-12-06 06:07:01,633 INFO L231 Difference]: Finished difference. Result has 498 places, 1536 transitions, 54383 flow [2022-12-06 06:07:01,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=48208, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=582, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=828, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=54383, PETRI_PLACES=498, PETRI_TRANSITIONS=1536} [2022-12-06 06:07:01,634 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 480 predicate places. [2022-12-06 06:07:01,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:01,635 INFO L89 Accepts]: Start accepts. Operand has 498 places, 1536 transitions, 54383 flow [2022-12-06 06:07:01,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:01,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:01,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 498 places, 1536 transitions, 54383 flow [2022-12-06 06:07:01,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 498 places, 1536 transitions, 54383 flow [2022-12-06 06:07:02,458 INFO L130 PetriNetUnfolder]: 949/2504 cut-off events. [2022-12-06 06:07:02,459 INFO L131 PetriNetUnfolder]: For 231300/231595 co-relation queries the response was YES. [2022-12-06 06:07:02,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37263 conditions, 2504 events. 949/2504 cut-off events. For 231300/231595 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 23448 event pairs, 0 based on Foata normal form. 0/2500 useless extension candidates. Maximal degree in co-relation 37081. Up to 1123 conditions per place. [2022-12-06 06:07:02,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 498 places, 1536 transitions, 54383 flow [2022-12-06 06:07:02,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 4192 [2022-12-06 06:07:02,909 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:07:02,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1275 [2022-12-06 06:07:02,910 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 1536 transitions, 54461 flow [2022-12-06 06:07:02,910 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 06:07:02,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:07:02,910 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:07:02,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-06 06:07:03,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 06:07:03,114 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 06:07:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:07:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1652019060, now seen corresponding path program 1 times [2022-12-06 06:07:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:07:03,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236777788] [2022-12-06 06:07:03,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:03,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:07:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:07:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:07:03,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236777788] [2022-12-06 06:07:03,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236777788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:07:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171530295] [2022-12-06 06:07:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:03,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:07:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:07:03,159 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 06:07:03,160 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 06:07:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:03,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 06:07:03,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:07:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:07:03,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:07:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171530295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:07:03,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:07:03,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 06:07:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830192352] [2022-12-06 06:07:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:07:03,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:07:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:07:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:07:03,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:07:03,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 06:07:03,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 1536 transitions, 54461 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 06:07:03,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:07:03,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 06:07:03,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:08,342 INFO L130 PetriNetUnfolder]: 5587/9726 cut-off events. [2022-12-06 06:07:08,343 INFO L131 PetriNetUnfolder]: For 1157196/1157196 co-relation queries the response was YES. [2022-12-06 06:07:08,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115896 conditions, 9726 events. 5587/9726 cut-off events. For 1157196/1157196 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 78900 event pairs, 843 based on Foata normal form. 22/9723 useless extension candidates. Maximal degree in co-relation 115711. Up to 4554 conditions per place. [2022-12-06 06:07:08,472 INFO L137 encePairwiseOnDemand]: 52/61 looper letters, 2520 selfloop transitions, 17 changer transitions 29/2566 dead transitions. [2022-12-06 06:07:08,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 2566 transitions, 94931 flow [2022-12-06 06:07:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:07:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:07:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2022-12-06 06:07:08,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3044496487119438 [2022-12-06 06:07:08,473 INFO L175 Difference]: Start difference. First operand has 498 places, 1536 transitions, 54461 flow. Second operand 7 states and 130 transitions. [2022-12-06 06:07:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 2566 transitions, 94931 flow [2022-12-06 06:07:15,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2566 transitions, 92113 flow, removed 1234 selfloop flow, removed 14 redundant places. [2022-12-06 06:07:15,553 INFO L231 Difference]: Finished difference. Result has 492 places, 1540 transitions, 52753 flow [2022-12-06 06:07:15,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=52539, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=52753, PETRI_PLACES=492, PETRI_TRANSITIONS=1540} [2022-12-06 06:07:15,555 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 474 predicate places. [2022-12-06 06:07:15,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:15,555 INFO L89 Accepts]: Start accepts. Operand has 492 places, 1540 transitions, 52753 flow [2022-12-06 06:07:15,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:15,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:15,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 492 places, 1540 transitions, 52753 flow [2022-12-06 06:07:15,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 492 places, 1540 transitions, 52753 flow [2022-12-06 06:07:16,405 INFO L130 PetriNetUnfolder]: 1100/2796 cut-off events. [2022-12-06 06:07:16,405 INFO L131 PetriNetUnfolder]: For 327840/328176 co-relation queries the response was YES. [2022-12-06 06:07:16,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42207 conditions, 2796 events. 1100/2796 cut-off events. For 327840/328176 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 26253 event pairs, 0 based on Foata normal form. 5/2798 useless extension candidates. Maximal degree in co-relation 42024. Up to 1103 conditions per place. [2022-12-06 06:07:16,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 492 places, 1540 transitions, 52753 flow [2022-12-06 06:07:16,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 4412 [2022-12-06 06:07:16,824 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:07:16,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1269 [2022-12-06 06:07:16,824 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 1540 transitions, 52843 flow [2022-12-06 06:07:16,824 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 06:07:16,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:07:16,825 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:07:16,829 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 06:07:17,027 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,SelfDestructingSolverStorable38 [2022-12-06 06:07:17,027 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 06:07:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:07:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1479078905, now seen corresponding path program 1 times [2022-12-06 06:07:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:07:17,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941818081] [2022-12-06 06:07:17,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:17,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:07:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:17,170 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 06:07:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:07:17,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941818081] [2022-12-06 06:07:17,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941818081] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:07:17,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124326327] [2022-12-06 06:07:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:17,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:07:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:07:17,172 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 06:07:17,176 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 06:07:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:17,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:07:17,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:07:17,523 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 06:07:17,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:07:17,693 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 06:07:17,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124326327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:07:17,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:07:17,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:07:17,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689225100] [2022-12-06 06:07:17,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:07:17,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:07:17,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:07:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:07:17,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:07:17,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 06:07:17,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 1540 transitions, 52843 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 06:07:17,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:07:17,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 06:07:17,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:23,450 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 34 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:07:25,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:07:30,171 INFO L130 PetriNetUnfolder]: 6196/10781 cut-off events. [2022-12-06 06:07:30,171 INFO L131 PetriNetUnfolder]: For 1601156/1601156 co-relation queries the response was YES. [2022-12-06 06:07:30,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132527 conditions, 10781 events. 6196/10781 cut-off events. For 1601156/1601156 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 85536 event pairs, 578 based on Foata normal form. 62/10826 useless extension candidates. Maximal degree in co-relation 132341. Up to 6353 conditions per place. [2022-12-06 06:07:30,318 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 956 selfloop transitions, 895 changer transitions 0/1851 dead transitions. [2022-12-06 06:07:30,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 1851 transitions, 63614 flow [2022-12-06 06:07:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 06:07:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 06:07:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 240 transitions. [2022-12-06 06:07:30,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13136288998357964 [2022-12-06 06:07:30,320 INFO L175 Difference]: Start difference. First operand has 492 places, 1540 transitions, 52843 flow. Second operand 29 states and 240 transitions. [2022-12-06 06:07:30,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 1851 transitions, 63614 flow [2022-12-06 06:07:40,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 1851 transitions, 63581 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 06:07:40,280 INFO L231 Difference]: Finished difference. Result has 532 places, 1699 transitions, 61895 flow [2022-12-06 06:07:40,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=52810, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=761, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=61895, PETRI_PLACES=532, PETRI_TRANSITIONS=1699} [2022-12-06 06:07:40,282 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 514 predicate places. [2022-12-06 06:07:40,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:40,282 INFO L89 Accepts]: Start accepts. Operand has 532 places, 1699 transitions, 61895 flow [2022-12-06 06:07:40,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:40,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:40,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 532 places, 1699 transitions, 61895 flow [2022-12-06 06:07:40,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 532 places, 1699 transitions, 61895 flow [2022-12-06 06:07:41,499 INFO L130 PetriNetUnfolder]: 1222/3122 cut-off events. [2022-12-06 06:07:41,499 INFO L131 PetriNetUnfolder]: For 455437/455635 co-relation queries the response was YES. [2022-12-06 06:07:41,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50778 conditions, 3122 events. 1222/3122 cut-off events. For 455437/455635 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 29919 event pairs, 0 based on Foata normal form. 0/3117 useless extension candidates. Maximal degree in co-relation 50581. Up to 1285 conditions per place. [2022-12-06 06:07:41,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 532 places, 1699 transitions, 61895 flow [2022-12-06 06:07:41,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 4834 [2022-12-06 06:07:41,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:07:41,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1558 [2022-12-06 06:07:41,840 INFO L495 AbstractCegarLoop]: Abstraction has has 532 places, 1699 transitions, 61866 flow [2022-12-06 06:07:41,840 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 06:07:41,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:07:41,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:07:41,853 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 06:07:42,044 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,SelfDestructingSolverStorable39 [2022-12-06 06:07:42,044 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 06:07:42,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:07:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash 552166284, now seen corresponding path program 1 times [2022-12-06 06:07:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:07:42,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604791533] [2022-12-06 06:07:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:42,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:07:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:42,145 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 06:07:42,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:07:42,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604791533] [2022-12-06 06:07:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604791533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:07:42,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113728766] [2022-12-06 06:07:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:07:42,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:07:42,147 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 06:07:42,149 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 06:07:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:42,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:07:42,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:07:42,295 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 06:07:42,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:07:42,417 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 06:07:42,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113728766] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:07:42,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:07:42,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:07:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658705541] [2022-12-06 06:07:42,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:07:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:07:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:07:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:07:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:07:42,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 06:07:42,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 1699 transitions, 61866 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 06:07:42,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:07:42,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 06:07:42,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:49,773 INFO L130 PetriNetUnfolder]: 6691/11625 cut-off events. [2022-12-06 06:07:49,774 INFO L131 PetriNetUnfolder]: For 1983408/1983408 co-relation queries the response was YES. [2022-12-06 06:07:49,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153624 conditions, 11625 events. 6691/11625 cut-off events. For 1983408/1983408 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 92995 event pairs, 487 based on Foata normal form. 36/11644 useless extension candidates. Maximal degree in co-relation 153424. Up to 6936 conditions per place. [2022-12-06 06:07:49,921 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 1007 selfloop transitions, 895 changer transitions 0/1902 dead transitions. [2022-12-06 06:07:49,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 1902 transitions, 70790 flow [2022-12-06 06:07:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:07:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:07:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-12-06 06:07:49,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16741071428571427 [2022-12-06 06:07:49,923 INFO L175 Difference]: Start difference. First operand has 532 places, 1699 transitions, 61866 flow. Second operand 14 states and 150 transitions. [2022-12-06 06:07:49,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 1902 transitions, 70790 flow [2022-12-06 06:08:02,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 1902 transitions, 68910 flow, removed 873 selfloop flow, removed 9 redundant places. [2022-12-06 06:08:02,400 INFO L231 Difference]: Finished difference. Result has 542 places, 1815 transitions, 67495 flow [2022-12-06 06:08:02,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=60102, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=793, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=67495, PETRI_PLACES=542, PETRI_TRANSITIONS=1815} [2022-12-06 06:08:02,401 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 524 predicate places. [2022-12-06 06:08:02,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:08:02,401 INFO L89 Accepts]: Start accepts. Operand has 542 places, 1815 transitions, 67495 flow [2022-12-06 06:08:02,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:08:02,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:08:02,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 542 places, 1815 transitions, 67495 flow [2022-12-06 06:08:02,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 542 places, 1815 transitions, 67495 flow [2022-12-06 06:08:03,675 INFO L130 PetriNetUnfolder]: 1300/3349 cut-off events. [2022-12-06 06:08:03,675 INFO L131 PetriNetUnfolder]: For 550996/551754 co-relation queries the response was YES. [2022-12-06 06:08:03,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56586 conditions, 3349 events. 1300/3349 cut-off events. For 550996/551754 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 32622 event pairs, 0 based on Foata normal form. 0/3342 useless extension candidates. Maximal degree in co-relation 56385. Up to 1428 conditions per place. [2022-12-06 06:08:03,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 542 places, 1815 transitions, 67495 flow [2022-12-06 06:08:03,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 5182 [2022-12-06 06:08:03,763 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:08:03,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1363 [2022-12-06 06:08:03,764 INFO L495 AbstractCegarLoop]: Abstraction has has 542 places, 1815 transitions, 67495 flow [2022-12-06 06:08:03,764 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 06:08:03,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:08:03,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:08:03,772 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 06:08:03,968 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,SelfDestructingSolverStorable40 [2022-12-06 06:08:03,968 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 06:08:03,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:08:03,969 INFO L85 PathProgramCache]: Analyzing trace with hash -58543156, now seen corresponding path program 1 times [2022-12-06 06:08:03,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:08:03,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184401867] [2022-12-06 06:08:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:08:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:04,072 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 06:08:04,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:08:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184401867] [2022-12-06 06:08:04,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184401867] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:08:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374819171] [2022-12-06 06:08:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:04,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:08:04,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:08:04,074 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 06:08:04,075 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 06:08:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:08:04,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:08:04,433 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 06:08:04,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:08:04,556 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 06:08:04,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374819171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:08:04,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:08:04,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:08:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656195723] [2022-12-06 06:08:04,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:08:04,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:08:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:08:04,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:08:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:08:04,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 06:08:04,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 1815 transitions, 67495 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 06:08:04,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:08:04,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 06:08:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:08:12,413 INFO L130 PetriNetUnfolder]: 6755/11809 cut-off events. [2022-12-06 06:08:12,413 INFO L131 PetriNetUnfolder]: For 2238178/2238178 co-relation queries the response was YES. [2022-12-06 06:08:12,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153362 conditions, 11809 events. 6755/11809 cut-off events. For 2238178/2238178 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 96023 event pairs, 1099 based on Foata normal form. 118/11910 useless extension candidates. Maximal degree in co-relation 153158. Up to 8687 conditions per place. [2022-12-06 06:08:12,564 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 1304 selfloop transitions, 712 changer transitions 1/2017 dead transitions. [2022-12-06 06:08:12,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 2017 transitions, 75539 flow [2022-12-06 06:08:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 06:08:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 06:08:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 182 transitions. [2022-12-06 06:08:12,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12364130434782608 [2022-12-06 06:08:12,565 INFO L175 Difference]: Start difference. First operand has 542 places, 1815 transitions, 67495 flow. Second operand 23 states and 182 transitions. [2022-12-06 06:08:12,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 2017 transitions, 75539 flow [2022-12-06 06:08:25,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 2017 transitions, 75282 flow, removed 109 selfloop flow, removed 2 redundant places. [2022-12-06 06:08:25,229 INFO L231 Difference]: Finished difference. Result has 568 places, 1901 transitions, 73035 flow [2022-12-06 06:08:25,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=67250, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=632, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=73035, PETRI_PLACES=568, PETRI_TRANSITIONS=1901} [2022-12-06 06:08:25,231 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 550 predicate places. [2022-12-06 06:08:25,231 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:08:25,231 INFO L89 Accepts]: Start accepts. Operand has 568 places, 1901 transitions, 73035 flow [2022-12-06 06:08:25,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:08:25,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:08:25,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 568 places, 1901 transitions, 73035 flow [2022-12-06 06:08:25,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 568 places, 1901 transitions, 73035 flow [2022-12-06 06:08:26,637 INFO L130 PetriNetUnfolder]: 1361/3490 cut-off events. [2022-12-06 06:08:26,638 INFO L131 PetriNetUnfolder]: For 511787/512813 co-relation queries the response was YES. [2022-12-06 06:08:26,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59158 conditions, 3490 events. 1361/3490 cut-off events. For 511787/512813 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 34255 event pairs, 0 based on Foata normal form. 0/3485 useless extension candidates. Maximal degree in co-relation 58950. Up to 1525 conditions per place. [2022-12-06 06:08:26,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 568 places, 1901 transitions, 73035 flow [2022-12-06 06:08:26,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 5314 [2022-12-06 06:08:26,730 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:08:26,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1500 [2022-12-06 06:08:26,731 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 1901 transitions, 73035 flow [2022-12-06 06:08:26,731 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 06:08:26,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:08:26,731 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:08:26,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 06:08:26,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:08:26,935 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 06:08:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:08:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1773769978, now seen corresponding path program 1 times [2022-12-06 06:08:26,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:08:26,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794008177] [2022-12-06 06:08:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:08:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 06:08:26,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:08:26,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794008177] [2022-12-06 06:08:26,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794008177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:08:26,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:08:26,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:08:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039927028] [2022-12-06 06:08:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:08:26,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:08:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:08:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:08:26,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:08:26,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 06:08:26,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 1901 transitions, 73035 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:08:26,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:08:26,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 06:08:26,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:08:34,547 INFO L130 PetriNetUnfolder]: 6604/11535 cut-off events. [2022-12-06 06:08:34,547 INFO L131 PetriNetUnfolder]: For 1567800/1567800 co-relation queries the response was YES. [2022-12-06 06:08:34,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155137 conditions, 11535 events. 6604/11535 cut-off events. For 1567800/1567800 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 93794 event pairs, 2078 based on Foata normal form. 170/11690 useless extension candidates. Maximal degree in co-relation 154926. Up to 10954 conditions per place. [2022-12-06 06:08:34,712 INFO L137 encePairwiseOnDemand]: 47/64 looper letters, 1853 selfloop transitions, 77 changer transitions 0/1930 dead transitions. [2022-12-06 06:08:34,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 1930 transitions, 77852 flow [2022-12-06 06:08:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:08:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:08:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-06 06:08:34,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-06 06:08:34,713 INFO L175 Difference]: Start difference. First operand has 568 places, 1901 transitions, 73035 flow. Second operand 3 states and 74 transitions. [2022-12-06 06:08:34,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 1930 transitions, 77852 flow [2022-12-06 06:08:49,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 1930 transitions, 77410 flow, removed 175 selfloop flow, removed 5 redundant places. [2022-12-06 06:08:49,753 INFO L231 Difference]: Finished difference. Result has 566 places, 1910 transitions, 73149 flow [2022-12-06 06:08:49,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=72552, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73149, PETRI_PLACES=566, PETRI_TRANSITIONS=1910} [2022-12-06 06:08:49,755 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 548 predicate places. [2022-12-06 06:08:49,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:08:49,755 INFO L89 Accepts]: Start accepts. Operand has 566 places, 1910 transitions, 73149 flow [2022-12-06 06:08:49,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:08:49,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:08:49,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 566 places, 1910 transitions, 73149 flow [2022-12-06 06:08:49,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 1910 transitions, 73149 flow [2022-12-06 06:08:51,178 INFO L130 PetriNetUnfolder]: 1352/3457 cut-off events. [2022-12-06 06:08:51,179 INFO L131 PetriNetUnfolder]: For 498498/499325 co-relation queries the response was YES. [2022-12-06 06:08:51,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58786 conditions, 3457 events. 1352/3457 cut-off events. For 498498/499325 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 33830 event pairs, 0 based on Foata normal form. 0/3454 useless extension candidates. Maximal degree in co-relation 58576. Up to 1502 conditions per place. [2022-12-06 06:08:51,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 566 places, 1910 transitions, 73149 flow [2022-12-06 06:08:51,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 5202 [2022-12-06 06:08:51,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:08:51,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1532 [2022-12-06 06:08:51,287 INFO L495 AbstractCegarLoop]: Abstraction has has 566 places, 1910 transitions, 73149 flow [2022-12-06 06:08:51,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:08:51,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:08:51,287 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:08:51,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 06:08:51,287 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 06:08:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:08:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1859121193, now seen corresponding path program 2 times [2022-12-06 06:08:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:08:51,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585962697] [2022-12-06 06:08:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:08:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:51,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 06:08:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:08:51,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585962697] [2022-12-06 06:08:51,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585962697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:08:51,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817289757] [2022-12-06 06:08:51,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:08:51,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:08:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:08:51,420 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 06:08:51,422 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 06:08:51,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:08:51,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:08:51,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:08:51,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:08:51,615 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 06:08:51,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:08:51,770 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 06:08:51,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817289757] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:08:51,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:08:51,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:08:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859491940] [2022-12-06 06:08:51,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:08:51,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:08:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:08:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:08:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:08:51,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 06:08:51,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 1910 transitions, 73149 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 06:08:51,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:08:51,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 06:08:51,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:09:00,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:09:09,084 INFO L130 PetriNetUnfolder]: 7676/13300 cut-off events. [2022-12-06 06:09:09,085 INFO L131 PetriNetUnfolder]: For 3046212/3046212 co-relation queries the response was YES. [2022-12-06 06:09:09,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184494 conditions, 13300 events. 7676/13300 cut-off events. For 3046212/3046212 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 108977 event pairs, 377 based on Foata normal form. 176/13461 useless extension candidates. Maximal degree in co-relation 184281. Up to 5681 conditions per place. [2022-12-06 06:09:09,276 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 820 selfloop transitions, 1500 changer transitions 1/2321 dead transitions. [2022-12-06 06:09:09,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 2321 transitions, 89149 flow [2022-12-06 06:09:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 06:09:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 06:09:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 251 transitions. [2022-12-06 06:09:09,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11718020541549953 [2022-12-06 06:09:09,277 INFO L175 Difference]: Start difference. First operand has 566 places, 1910 transitions, 73149 flow. Second operand 34 states and 251 transitions. [2022-12-06 06:09:09,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 2321 transitions, 89149 flow [2022-12-06 06:09:24,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 2321 transitions, 89056 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 06:09:24,807 INFO L231 Difference]: Finished difference. Result has 610 places, 2123 transitions, 87427 flow [2022-12-06 06:09:24,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=72874, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=87427, PETRI_PLACES=610, PETRI_TRANSITIONS=2123} [2022-12-06 06:09:24,809 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 592 predicate places. [2022-12-06 06:09:24,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:09:24,809 INFO L89 Accepts]: Start accepts. Operand has 610 places, 2123 transitions, 87427 flow [2022-12-06 06:09:24,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:09:24,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:09:24,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 610 places, 2123 transitions, 87427 flow [2022-12-06 06:09:24,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 610 places, 2123 transitions, 87427 flow [2022-12-06 06:09:26,965 INFO L130 PetriNetUnfolder]: 1577/3996 cut-off events. [2022-12-06 06:09:26,965 INFO L131 PetriNetUnfolder]: For 661554/662536 co-relation queries the response was YES. [2022-12-06 06:09:27,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73028 conditions, 3996 events. 1577/3996 cut-off events. For 661554/662536 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 40100 event pairs, 0 based on Foata normal form. 0/3993 useless extension candidates. Maximal degree in co-relation 72805. Up to 1857 conditions per place. [2022-12-06 06:09:27,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 610 places, 2123 transitions, 87427 flow [2022-12-06 06:09:27,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 5894 [2022-12-06 06:09:27,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:09:27,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2349 [2022-12-06 06:09:27,158 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 2123 transitions, 87450 flow [2022-12-06 06:09:27,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 06:09:27,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:09:27,158 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:09:27,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 06:09:27,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:09:27,365 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 06:09:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:09:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1900291797, now seen corresponding path program 1 times [2022-12-06 06:09:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:09:27,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809810545] [2022-12-06 06:09:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:09:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:27,555 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 06:09:27,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:09:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809810545] [2022-12-06 06:09:27,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809810545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:09:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095862319] [2022-12-06 06:09:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:27,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:09:27,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:09:27,560 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 06:09:27,563 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 06:09:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:27,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:09:27,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:09:27,765 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 06:09:27,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:09:27,946 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 06:09:27,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095862319] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:09:27,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:09:27,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:09:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374827625] [2022-12-06 06:09:27,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:09:27,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:09:27,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:09:27,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:09:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:09:27,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 06:09:27,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 2123 transitions, 87450 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 06:09:27,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:09:27,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 06:09:27,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:09:31,000 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 [] [2022-12-06 06:09:41,790 INFO L130 PetriNetUnfolder]: 8093/14047 cut-off events. [2022-12-06 06:09:41,790 INFO L131 PetriNetUnfolder]: For 2882246/2882246 co-relation queries the response was YES. [2022-12-06 06:09:41,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208478 conditions, 14047 events. 8093/14047 cut-off events. For 2882246/2882246 co-relation queries the response was YES. Maximal size of possible extension queue 1523. Compared 116630 event pairs, 810 based on Foata normal form. 65/14097 useless extension candidates. Maximal degree in co-relation 208252. Up to 7802 conditions per place. [2022-12-06 06:09:42,100 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 1108 selfloop transitions, 1306 changer transitions 2/2416 dead transitions. [2022-12-06 06:09:42,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 2416 transitions, 100341 flow [2022-12-06 06:09:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 06:09:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 06:09:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 231 transitions. [2022-12-06 06:09:42,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11643145161290322 [2022-12-06 06:09:42,101 INFO L175 Difference]: Start difference. First operand has 610 places, 2123 transitions, 87450 flow. Second operand 31 states and 231 transitions. [2022-12-06 06:09:42,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 2416 transitions, 100341 flow [2022-12-06 06:10:03,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 2416 transitions, 96108 flow, removed 1914 selfloop flow, removed 13 redundant places. [2022-12-06 06:10:03,814 INFO L231 Difference]: Finished difference. Result has 638 places, 2253 transitions, 94198 flow [2022-12-06 06:10:03,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=83603, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=94198, PETRI_PLACES=638, PETRI_TRANSITIONS=2253} [2022-12-06 06:10:03,816 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 620 predicate places. [2022-12-06 06:10:03,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:10:03,816 INFO L89 Accepts]: Start accepts. Operand has 638 places, 2253 transitions, 94198 flow [2022-12-06 06:10:03,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:10:03,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:10:03,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 638 places, 2253 transitions, 94198 flow [2022-12-06 06:10:03,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 638 places, 2253 transitions, 94198 flow [2022-12-06 06:10:05,858 INFO L130 PetriNetUnfolder]: 1665/4235 cut-off events. [2022-12-06 06:10:05,858 INFO L131 PetriNetUnfolder]: For 781875/782883 co-relation queries the response was YES. [2022-12-06 06:10:05,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78893 conditions, 4235 events. 1665/4235 cut-off events. For 781875/782883 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 43050 event pairs, 1 based on Foata normal form. 0/4232 useless extension candidates. Maximal degree in co-relation 78663. Up to 2003 conditions per place. [2022-12-06 06:10:05,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 638 places, 2253 transitions, 94198 flow [2022-12-06 06:10:05,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 6202 [2022-12-06 06:10:05,976 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:10:05,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2161 [2022-12-06 06:10:05,977 INFO L495 AbstractCegarLoop]: Abstraction has has 638 places, 2253 transitions, 94198 flow [2022-12-06 06:10:05,977 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 06:10:05,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:10:05,977 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:10:05,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 06:10:06,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-06 06:10:06,177 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 06:10:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:10:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1859656873, now seen corresponding path program 3 times [2022-12-06 06:10:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:10:06,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092789256] [2022-12-06 06:10:06,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:10:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:10:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:10:06,321 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 06:10:06,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:10:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092789256] [2022-12-06 06:10:06,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092789256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:10:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446422306] [2022-12-06 06:10:06,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 06:10:06,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:10:06,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:10:06,323 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 06:10:06,325 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 06:10:06,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 06:10:06,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:10:06,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:10:06,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:10:06,529 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 06:10:06,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:10:06,692 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 06:10:06,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446422306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:10:06,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:10:06,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:10:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738598526] [2022-12-06 06:10:06,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:10:06,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:10:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:10:06,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:10:06,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:10:06,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 06:10:06,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 2253 transitions, 94198 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 06:10:06,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:10:06,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 06:10:06,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:10:12,311 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 [] [2022-12-06 06:10:27,113 INFO L130 PetriNetUnfolder]: 8891/15333 cut-off events. [2022-12-06 06:10:27,113 INFO L131 PetriNetUnfolder]: For 3817263/3817263 co-relation queries the response was YES. [2022-12-06 06:10:27,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231133 conditions, 15333 events. 8891/15333 cut-off events. For 3817263/3817263 co-relation queries the response was YES. Maximal size of possible extension queue 1619. Compared 127341 event pairs, 850 based on Foata normal form. 106/15424 useless extension candidates. Maximal degree in co-relation 230900. Up to 8385 conditions per place. [2022-12-06 06:10:27,347 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 1206 selfloop transitions, 1384 changer transitions 0/2590 dead transitions. [2022-12-06 06:10:27,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 2590 transitions, 107605 flow [2022-12-06 06:10:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 06:10:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 06:10:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 254 transitions. [2022-12-06 06:10:27,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11024305555555555 [2022-12-06 06:10:27,348 INFO L175 Difference]: Start difference. First operand has 638 places, 2253 transitions, 94198 flow. Second operand 36 states and 254 transitions. [2022-12-06 06:10:27,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 2590 transitions, 107605 flow [2022-12-06 06:10:56,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 2590 transitions, 105437 flow, removed 1050 selfloop flow, removed 5 redundant places. [2022-12-06 06:10:56,808 INFO L231 Difference]: Finished difference. Result has 679 places, 2397 transitions, 103230 flow [2022-12-06 06:10:56,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=92206, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=103230, PETRI_PLACES=679, PETRI_TRANSITIONS=2397} [2022-12-06 06:10:56,810 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 661 predicate places. [2022-12-06 06:10:56,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:10:56,810 INFO L89 Accepts]: Start accepts. Operand has 679 places, 2397 transitions, 103230 flow [2022-12-06 06:10:56,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:10:56,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:10:56,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 679 places, 2397 transitions, 103230 flow [2022-12-06 06:10:56,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 679 places, 2397 transitions, 103230 flow [2022-12-06 06:10:59,100 INFO L130 PetriNetUnfolder]: 1829/4614 cut-off events. [2022-12-06 06:10:59,101 INFO L131 PetriNetUnfolder]: For 985790/987017 co-relation queries the response was YES. [2022-12-06 06:10:59,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89746 conditions, 4614 events. 1829/4614 cut-off events. For 985790/987017 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 47335 event pairs, 0 based on Foata normal form. 0/4611 useless extension candidates. Maximal degree in co-relation 89504. Up to 2264 conditions per place. [2022-12-06 06:10:59,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 679 places, 2397 transitions, 103230 flow [2022-12-06 06:10:59,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 6714 [2022-12-06 06:10:59,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:10:59,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2434 [2022-12-06 06:10:59,244 INFO L495 AbstractCegarLoop]: Abstraction has has 679 places, 2397 transitions, 103230 flow [2022-12-06 06:10:59,244 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 06:10:59,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:10:59,244 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:10:59,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-06 06:10:59,450 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,SelfDestructingSolverStorable45 [2022-12-06 06:10:59,450 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 06:10:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:10:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1944161044, now seen corresponding path program 2 times [2022-12-06 06:10:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:10:59,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040513] [2022-12-06 06:10:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:10:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:10:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:10:59,591 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 06:10:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:10:59,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040513] [2022-12-06 06:10:59,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:10:59,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091965881] [2022-12-06 06:10:59,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:10:59,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:10:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:10:59,593 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 06:10:59,594 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 06:10:59,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:10:59,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:10:59,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:10:59,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:10:59,786 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 06:10:59,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:10:59,940 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 06:10:59,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091965881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:10:59,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:10:59,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:10:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965826046] [2022-12-06 06:10:59,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:10:59,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:10:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:10:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:10:59,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:10:59,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 06:10:59,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 2397 transitions, 103230 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 06:10:59,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:10:59,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 06:10:59,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:11:10,798 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 [] [2022-12-06 06:11:16,075 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 [] [2022-12-06 06:11:17,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:11:19,471 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 [] [2022-12-06 06:11:34,591 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 [] [2022-12-06 06:11:47,374 INFO L130 PetriNetUnfolder]: 9151/15819 cut-off events. [2022-12-06 06:11:47,374 INFO L131 PetriNetUnfolder]: For 3972345/3972345 co-relation queries the response was YES. [2022-12-06 06:11:47,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244474 conditions, 15819 events. 9151/15819 cut-off events. For 3972345/3972345 co-relation queries the response was YES. Maximal size of possible extension queue 1653. Compared 132388 event pairs, 994 based on Foata normal form. 80/15884 useless extension candidates. Maximal degree in co-relation 244229. Up to 10412 conditions per place. [2022-12-06 06:11:47,786 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 1453 selfloop transitions, 1200 changer transitions 1/2654 dead transitions. [2022-12-06 06:11:47,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 2654 transitions, 113698 flow [2022-12-06 06:11:47,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 06:11:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 06:11:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 240 transitions. [2022-12-06 06:11:47,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10135135135135136 [2022-12-06 06:11:47,788 INFO L175 Difference]: Start difference. First operand has 679 places, 2397 transitions, 103230 flow. Second operand 37 states and 240 transitions. [2022-12-06 06:11:47,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 2654 transitions, 113698 flow [2022-12-06 06:12:21,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 2654 transitions, 111562 flow, removed 881 selfloop flow, removed 12 redundant places. [2022-12-06 06:12:21,263 INFO L231 Difference]: Finished difference. Result has 710 places, 2478 transitions, 109014 flow [2022-12-06 06:12:21,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=101306, PETRI_DIFFERENCE_MINUEND_PLACES=667, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=109014, PETRI_PLACES=710, PETRI_TRANSITIONS=2478} [2022-12-06 06:12:21,266 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 692 predicate places. [2022-12-06 06:12:21,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:12:21,266 INFO L89 Accepts]: Start accepts. Operand has 710 places, 2478 transitions, 109014 flow [2022-12-06 06:12:21,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:12:21,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:12:21,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 710 places, 2478 transitions, 109014 flow [2022-12-06 06:12:21,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 710 places, 2478 transitions, 109014 flow [2022-12-06 06:12:24,269 INFO L130 PetriNetUnfolder]: 1916/4830 cut-off events. [2022-12-06 06:12:24,270 INFO L131 PetriNetUnfolder]: For 1062542/1063735 co-relation queries the response was YES. [2022-12-06 06:12:24,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95323 conditions, 4830 events. 1916/4830 cut-off events. For 1062542/1063735 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 49732 event pairs, 2 based on Foata normal form. 0/4826 useless extension candidates. Maximal degree in co-relation 95075. Up to 2382 conditions per place. [2022-12-06 06:12:24,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 710 places, 2478 transitions, 109014 flow [2022-12-06 06:12:24,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 6922 [2022-12-06 06:12:24,762 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:12:24,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3496 [2022-12-06 06:12:24,762 INFO L495 AbstractCegarLoop]: Abstraction has has 710 places, 2478 transitions, 109090 flow [2022-12-06 06:12:24,763 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 06:12:24,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:12:24,763 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:12:24,768 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 06:12:24,968 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,SelfDestructingSolverStorable46 [2022-12-06 06:12:24,969 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 06:12:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:12:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1064759131, now seen corresponding path program 1 times [2022-12-06 06:12:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:12:24,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490395825] [2022-12-06 06:12:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:12:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:12:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:12:25,261 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 06:12:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:12:25,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490395825] [2022-12-06 06:12:25,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490395825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:12:25,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365392478] [2022-12-06 06:12:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:12:25,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:12:25,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:12:25,263 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 06:12:25,265 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 06:12:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:12:25,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:12:25,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:12:25,455 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 06:12:25,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:12:25,589 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 06:12:25,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365392478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:12:25,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:12:25,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:12:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492770675] [2022-12-06 06:12:25,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:12:25,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:12:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:12:25,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:12:25,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:12:25,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 06:12:25,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 2478 transitions, 109090 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 06:12:25,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:12:25,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 06:12:25,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:12:39,905 WARN L233 SmtUtils]: Spent 9.72s on a formula simplification. DAG size of input: 46 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:12:50,652 WARN L233 SmtUtils]: Spent 10.71s on a formula simplification. DAG size of input: 48 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:12:56,253 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 49 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:12:59,216 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 [] [2022-12-06 06:13:01,262 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 [] [2022-12-06 06:13:03,282 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 [] [2022-12-06 06:13:17,413 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:13:22,837 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 [] [2022-12-06 06:13:24,892 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 [] [2022-12-06 06:13:25,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:13:40,775 INFO L130 PetriNetUnfolder]: 9391/16305 cut-off events. [2022-12-06 06:13:40,775 INFO L131 PetriNetUnfolder]: For 4055461/4055461 co-relation queries the response was YES. [2022-12-06 06:13:40,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253615 conditions, 16305 events. 9391/16305 cut-off events. For 4055461/4055461 co-relation queries the response was YES. Maximal size of possible extension queue 1684. Compared 138233 event pairs, 1887 based on Foata normal form. 70/16360 useless extension candidates. Maximal degree in co-relation 253364. Up to 13674 conditions per place. [2022-12-06 06:13:41,186 INFO L137 encePairwiseOnDemand]: 12/66 looper letters, 2025 selfloop transitions, 683 changer transitions 0/2708 dead transitions. [2022-12-06 06:13:41,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 2708 transitions, 120627 flow [2022-12-06 06:13:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 06:13:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 06:13:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 205 transitions. [2022-12-06 06:13:41,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10353535353535354 [2022-12-06 06:13:41,187 INFO L175 Difference]: Start difference. First operand has 710 places, 2478 transitions, 109090 flow. Second operand 30 states and 205 transitions. [2022-12-06 06:13:41,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 739 places, 2708 transitions, 120627 flow [2022-12-06 06:14:15,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 2708 transitions, 118315 flow, removed 803 selfloop flow, removed 22 redundant places. [2022-12-06 06:14:15,784 INFO L231 Difference]: Finished difference. Result has 723 places, 2604 transitions, 114796 flow [2022-12-06 06:14:15,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106838, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=573, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=114796, PETRI_PLACES=723, PETRI_TRANSITIONS=2604} [2022-12-06 06:14:15,786 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 705 predicate places. [2022-12-06 06:14:15,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:15,786 INFO L89 Accepts]: Start accepts. Operand has 723 places, 2604 transitions, 114796 flow [2022-12-06 06:14:15,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:15,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:15,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 723 places, 2604 transitions, 114796 flow [2022-12-06 06:14:15,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 723 places, 2604 transitions, 114796 flow [2022-12-06 06:14:19,397 INFO L130 PetriNetUnfolder]: 1986/5022 cut-off events. [2022-12-06 06:14:19,397 INFO L131 PetriNetUnfolder]: For 1146180/1147390 co-relation queries the response was YES. [2022-12-06 06:14:19,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99155 conditions, 5022 events. 1986/5022 cut-off events. For 1146180/1147390 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 52106 event pairs, 1 based on Foata normal form. 0/5018 useless extension candidates. Maximal degree in co-relation 98901. Up to 2390 conditions per place. [2022-12-06 06:14:19,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 723 places, 2604 transitions, 114796 flow [2022-12-06 06:14:19,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 7156 [2022-12-06 06:14:19,778 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:14:19,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3993 [2022-12-06 06:14:19,779 INFO L495 AbstractCegarLoop]: Abstraction has has 723 places, 2604 transitions, 114854 flow [2022-12-06 06:14:19,779 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 06:14:19,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:19,779 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:19,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-06 06:14:19,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:19,986 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 06:14:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1451297356, now seen corresponding path program 1 times [2022-12-06 06:14:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:19,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643478849] [2022-12-06 06:14:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:20,152 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 06:14:20,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:20,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643478849] [2022-12-06 06:14:20,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643478849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:14:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928313761] [2022-12-06 06:14:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:20,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:20,156 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 06:14:20,157 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 06:14:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:20,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:14:20,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:14:20,349 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 06:14:20,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:14:20,485 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 06:14:20,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928313761] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:14:20,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:14:20,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:14:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442608815] [2022-12-06 06:14:20,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:14:20,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:14:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:20,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:14:20,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:14:20,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 06:14:20,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 2604 transitions, 114854 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 06:14:20,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:20,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 06:14:20,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:26,815 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 48 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:14:56,836 INFO L130 PetriNetUnfolder]: 9671/16869 cut-off events. [2022-12-06 06:14:56,836 INFO L131 PetriNetUnfolder]: For 4343618/4343618 co-relation queries the response was YES. [2022-12-06 06:14:57,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261330 conditions, 16869 events. 9671/16869 cut-off events. For 4343618/4343618 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 144584 event pairs, 1434 based on Foata normal form. 82/16936 useless extension candidates. Maximal degree in co-relation 261073. Up to 11967 conditions per place. Received shutdown request... [2022-12-06 06:14:57,070 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 06:14:57,070 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:14:57,270 INFO L137 encePairwiseOnDemand]: 8/69 looper letters, 1705 selfloop transitions, 1214 changer transitions 0/2919 dead transitions. [2022-12-06 06:14:57,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 2919 transitions, 128486 flow [2022-12-06 06:14:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 06:14:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 06:14:57,278 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 06:14:57,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-06 06:14:57,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 06:14:57,482 WARN L619 AbstractCegarLoop]: Verification canceled: while ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). [2022-12-06 06:14:57,484 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 06:14:57,484 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 06:14:57,485 INFO L458 BasicCegarLoop]: Path program histogram: [3, 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] [2022-12-06 06:14:57,488 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:14:57,488 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:14:57,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:14:57 BasicIcfg [2022-12-06 06:14:57,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:14:57,492 INFO L158 Benchmark]: Toolchain (without parser) took 825809.19ms. Allocated memory was 189.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 155.1MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 06:14:57,492 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:14:57,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.86ms. Allocated memory is still 189.8MB. Free memory was 155.1MB in the beginning and 134.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 06:14:57,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.06ms. Allocated memory is still 189.8MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:14:57,493 INFO L158 Benchmark]: Boogie Preprocessor took 38.58ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 130.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:14:57,493 INFO L158 Benchmark]: RCFGBuilder took 477.82ms. Allocated memory is still 189.8MB. Free memory was 130.9MB in the beginning and 117.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 06:14:57,493 INFO L158 Benchmark]: TraceAbstraction took 824725.89ms. Allocated memory was 189.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 116.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 06:14:57,494 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.15ms. Allocated memory is still 189.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.86ms. Allocated memory is still 189.8MB. Free memory was 155.1MB in the beginning and 134.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.06ms. Allocated memory is still 189.8MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.58ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 130.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 477.82ms. Allocated memory is still 189.8MB. Free memory was 130.9MB in the beginning and 117.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 824725.89ms. Allocated memory was 189.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 116.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 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: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, 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.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): 180, Positive cache size: 180, Positive conditional cache size: 180, 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): 282, Positive cache size: 282, Positive conditional cache size: 282, 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): 354, Positive cache size: 354, Positive conditional cache size: 354, 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): 390, Positive cache size: 390, Positive conditional cache size: 390, 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): 468, Positive cache size: 468, Positive conditional cache size: 468, 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, 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): 504, Positive cache size: 504, Positive conditional cache size: 504, 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): 522, Positive cache size: 522, Positive conditional cache size: 522, 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, 28 PlacesBefore, 27 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 554, Positive conditional cache size: 554, 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, 45 PlacesBefore, 45 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 32, 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: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 32, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 879, Positive cache size: 879, Positive conditional cache size: 879, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 881, Positive cache size: 881, Positive conditional cache size: 881, 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, 51 PlacesBefore, 51 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 885, Positive conditional cache size: 885, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 885, Positive conditional cache size: 885, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 80 PlacesBefore, 80 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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): 1176, Positive cache size: 1176, Positive conditional cache size: 1176, 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.6s, 99 PlacesBefore, 99 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1283, Positive cache size: 1283, Positive conditional cache size: 1283, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1389, Positive cache size: 1389, Positive conditional cache size: 1389, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 118 PlacesBefore, 118 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1595, Positive cache size: 1595, Positive conditional cache size: 1595, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1595, Positive cache size: 1595, Positive conditional cache size: 1595, 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, 144 PlacesBefore, 144 PlacesAfterwards, 291 TransitionsBefore, 291 TransitionsAfterwards, 900 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): 1702, Positive cache size: 1702, Positive conditional cache size: 1702, 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, 165 PlacesBefore, 165 PlacesAfterwards, 365 TransitionsBefore, 365 TransitionsAfterwards, 1122 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): 1702, Positive cache size: 1702, Positive conditional cache size: 1702, 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, 179 PlacesBefore, 179 PlacesAfterwards, 387 TransitionsBefore, 387 TransitionsAfterwards, 1176 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): 2029, Positive cache size: 2029, Positive conditional cache size: 2029, 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, 191 PlacesBefore, 191 PlacesAfterwards, 417 TransitionsBefore, 417 TransitionsAfterwards, 1246 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): 2029, Positive cache size: 2029, Positive conditional cache size: 2029, 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, 216 PlacesBefore, 216 PlacesAfterwards, 490 TransitionsBefore, 490 TransitionsAfterwards, 1454 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): 2148, Positive cache size: 2148, Positive conditional cache size: 2148, 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, 231 PlacesBefore, 231 PlacesAfterwards, 540 TransitionsBefore, 540 TransitionsAfterwards, 1644 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): 2272, Positive cache size: 2272, Positive conditional cache size: 2272, 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, 259 PlacesBefore, 259 PlacesAfterwards, 632 TransitionsBefore, 632 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 2587, Positive cache size: 2587, Positive conditional cache size: 2587, 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, 278 PlacesBefore, 278 PlacesAfterwards, 710 TransitionsBefore, 710 TransitionsAfterwards, 2122 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): 2587, Positive cache size: 2587, Positive conditional cache size: 2587, 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, 308 PlacesBefore, 308 PlacesAfterwards, 830 TransitionsBefore, 830 TransitionsAfterwards, 2448 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 16, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2901, Positive cache size: 2901, Positive conditional cache size: 2901, 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, 331 PlacesBefore, 331 PlacesAfterwards, 1002 TransitionsBefore, 1002 TransitionsAfterwards, 2902 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 10, independent: 5, independent conditional: 5, 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): 3134, Positive cache size: 3134, Positive conditional cache size: 3134, 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, 340 PlacesBefore, 340 PlacesAfterwards, 1066 TransitionsBefore, 1066 TransitionsAfterwards, 3022 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3135, Positive cache size: 3135, Positive conditional cache size: 3135, 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, 369 PlacesBefore, 369 PlacesAfterwards, 1129 TransitionsBefore, 1129 TransitionsAfterwards, 3186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 3665, Positive cache size: 3665, Positive conditional cache size: 3665, 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, 393 PlacesBefore, 393 PlacesAfterwards, 1201 TransitionsBefore, 1201 TransitionsAfterwards, 3320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3909, Positive cache size: 3909, Positive conditional cache size: 3909, 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, 389 PlacesBefore, 389 PlacesAfterwards, 1206 TransitionsBefore, 1206 TransitionsAfterwards, 3408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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: 9, independent: 4, independent conditional: 4, 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): 4110, Positive cache size: 4110, Positive conditional cache size: 4110, 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, 419 PlacesBefore, 419 PlacesAfterwards, 1257 TransitionsBefore, 1257 TransitionsAfterwards, 3534 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): 4110, Positive cache size: 4110, Positive conditional cache size: 4110, 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, 434 PlacesBefore, 434 PlacesAfterwards, 1328 TransitionsBefore, 1328 TransitionsAfterwards, 3688 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): 4110, Positive cache size: 4110, Positive conditional cache size: 4110, 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, 467 PlacesBefore, 467 PlacesAfterwards, 1436 TransitionsBefore, 1436 TransitionsAfterwards, 3994 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): 4243, Positive cache size: 4243, Positive conditional cache size: 4243, 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, 498 PlacesBefore, 498 PlacesAfterwards, 1536 TransitionsBefore, 1536 TransitionsAfterwards, 4192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 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: 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: 8, independent: 2, independent conditional: 2, 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): 4728, Positive cache size: 4728, Positive conditional cache size: 4728, 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, 492 PlacesBefore, 492 PlacesAfterwards, 1540 TransitionsBefore, 1540 TransitionsAfterwards, 4412 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 35, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5290, Positive cache size: 5290, Positive conditional cache size: 5290, 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, 532 PlacesBefore, 532 PlacesAfterwards, 1699 TransitionsBefore, 1699 TransitionsAfterwards, 4834 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 30, independent conditional: 30, 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): 5976, Positive cache size: 5976, Positive conditional cache size: 5976, 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, 542 PlacesBefore, 542 PlacesAfterwards, 1815 TransitionsBefore, 1815 TransitionsAfterwards, 5182 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): 5976, Positive cache size: 5976, Positive conditional cache size: 5976, 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, 568 PlacesBefore, 568 PlacesAfterwards, 1901 TransitionsBefore, 1901 TransitionsAfterwards, 5314 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): 5976, Positive cache size: 5976, Positive conditional cache size: 5976, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 566 PlacesBefore, 566 PlacesAfterwards, 1910 TransitionsBefore, 1910 TransitionsAfterwards, 5202 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): 5976, Positive cache size: 5976, Positive conditional cache size: 5976, 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, 610 PlacesBefore, 610 PlacesAfterwards, 2123 TransitionsBefore, 2123 TransitionsAfterwards, 5894 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): 5980, Positive cache size: 5980, Positive conditional cache size: 5980, 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, 638 PlacesBefore, 638 PlacesAfterwards, 2253 TransitionsBefore, 2253 TransitionsAfterwards, 6202 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): 5980, Positive cache size: 5980, Positive conditional cache size: 5980, 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, 679 PlacesBefore, 679 PlacesAfterwards, 2397 TransitionsBefore, 2397 TransitionsAfterwards, 6714 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): 5980, Positive cache size: 5980, Positive conditional cache size: 5980, 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, 710 PlacesBefore, 710 PlacesAfterwards, 2478 TransitionsBefore, 2478 TransitionsAfterwards, 6922 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 6217, Positive cache size: 6217, Positive conditional cache size: 6217, 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, 723 PlacesBefore, 723 PlacesAfterwards, 2604 TransitionsBefore, 2604 TransitionsAfterwards, 7156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 3, independent: 1, independent conditional: 1, 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): 6451, Positive cache size: 6451, Positive conditional cache size: 6451, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). - 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 ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). - 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 ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). - 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: 824.6s, OverallIterations: 49, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 757.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 5832 SdHoareTripleChecker+Valid, 133.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5832 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 130.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20088 IncrementalHoareTripleChecker+Invalid, 26550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6426 mSolverCounterUnsat, 0 mSDtfsCounter, 20088 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 516 SyntacticMatches, 2 SemanticMatches, 1078 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6854 ImplicationChecksByTransitivity, 248.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114854occurred in iteration=48, InterpolantAutomatonStates: 782, 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.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 1021 NumberOfCodeBlocks, 1021 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 1349 ConstructedInterpolants, 0 QuantifiedInterpolants, 19718 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7154 ConjunctsInSsa, 582 ConjunctsInUnsatCore, 140 InterpolantComputations, 5 PerfectInterpolantSequences, 36/395 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