/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:51:49,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:51:49,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:51:49,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:51:49,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:51:49,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:51:49,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:51:49,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:51:49,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:51:49,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:51:49,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:51:49,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:51:49,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:51:49,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:51:49,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:51:49,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:51:49,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:51:49,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:51:49,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:51:49,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:51:49,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:51:49,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:51:49,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:51:49,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:51:49,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:51:49,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:51:49,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:51:49,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:51:49,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:51:49,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:51:49,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:51:49,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:51:49,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:51:49,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:51:49,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:51:49,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:51:49,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:51:49,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:51:49,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:51:49,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:51:49,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:51:49,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 03:51:49,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:51:49,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:51:49,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:51:49,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:51:49,341 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:51:49,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:51:49,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:51:49,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:51:49,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:51:49,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:51:49,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:51:49,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:51:49,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:51:49,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:51:49,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:51:49,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:51:49,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:51:49,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:51:49,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:51:49,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:51:49,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:51:49,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:49,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:51:49,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:51:49,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:51:49,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:51:49,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:51:49,347 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:51:49,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 03:51:49,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:51:49,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:51:49,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:51:49,653 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:51:49,653 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:51:49,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2022-12-06 03:51:50,677 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:51:50,918 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:51:50,918 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2022-12-06 03:51:50,926 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe320386/fcc47bbb4e924187850c3a869b94782a/FLAG84b88fad4 [2022-12-06 03:51:50,941 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afe320386/fcc47bbb4e924187850c3a869b94782a [2022-12-06 03:51:50,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:51:50,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:51:50,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:50,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:51:50,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:51:50,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:51:50" (1/1) ... [2022-12-06 03:51:50,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a0e5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:50, skipping insertion in model container [2022-12-06 03:51:50,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:51:50" (1/1) ... [2022-12-06 03:51:50,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:51:50,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:51:51,239 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2022-12-06 03:51:51,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,275 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:51:51,315 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2022-12-06 03:51:51,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:51:51,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:51:51,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:51:51,359 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:51:51,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51 WrapperNode [2022-12-06 03:51:51,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:51:51,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:51:51,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:51:51,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,420 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-06 03:51:51,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:51:51,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:51:51,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:51:51,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,453 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:51:51,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:51:51,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:51:51,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:51:51,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (1/1) ... [2022-12-06 03:51:51,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:51:51,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:51,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:51:51,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:51:51,545 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 03:51:51,545 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 03:51:51,545 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 03:51:51,545 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:51:51,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:51:51,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:51:51,548 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:51:51,715 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:51:51,717 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:51:51,881 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:51:51,886 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:51:51,887 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:51:51,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:51 BoogieIcfgContainer [2022-12-06 03:51:51,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:51:51,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:51:51,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:51:51,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:51:51,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:51:50" (1/3) ... [2022-12-06 03:51:51,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b816534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:51, skipping insertion in model container [2022-12-06 03:51:51,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:51:51" (2/3) ... [2022-12-06 03:51:51,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b816534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:51:51, skipping insertion in model container [2022-12-06 03:51:51,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:51:51" (3/3) ... [2022-12-06 03:51:51,894 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2022-12-06 03:51:51,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:51:51,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:51:51,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:51:51,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 03:51:52,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:52,068 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:52,069 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:52,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 03:51:52,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 03:51:52,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:52,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,134 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 03:51:52,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:52,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 03:51:52,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 03:51:52,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 03:51:55,217 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-06 03:51:55,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:51:55,242 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;@7c81c68a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:51:55,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:51:55,244 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-06 03:51:55,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-06 03:51:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676089986] [2022-12-06 03:51:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676089986] [2022-12-06 03:51:55,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676089986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:51:55,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:51:55,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:51:55,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134617918] [2022-12-06 03:51:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:51:55,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:51:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:55,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:51:55,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:51:55,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:55,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 34 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:55,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:55,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:55,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:55,542 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 03:51:55,542 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:51:55,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 149 events. 97/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 20 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 300. Up to 91 conditions per place. [2022-12-06 03:51:55,544 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-06 03:51:55,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:51:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:51:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 03:51:55,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 03:51:55,555 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-06 03:51:55,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-06 03:51:55,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:51:55,559 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=14} [2022-12-06 03:51:55,564 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 03:51:55,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:55,565 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:55,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:55,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-06 03:51:55,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,580 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 03:51:55,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 03:51:55,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 14 events. 3/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2022-12-06 03:51:55,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 03:51:55,581 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:51:55,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 03:51:55,585 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-06 03:51:55,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:55,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:55,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:51:55,591 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-06 03:51:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:55,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104446049] [2022-12-06 03:51:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:55,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104446049] [2022-12-06 03:51:55,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104446049] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:55,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217337333] [2022-12-06 03:51:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:55,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:55,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:55,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:55,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:51:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:55,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:55,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:55,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217337333] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:55,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:55,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:55,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371241414] [2022-12-06 03:51:55,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:55,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:55,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:55,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 03:51:55,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:55,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:55,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 03:51:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:55,929 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:55,930 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:55,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 203 events. 133/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 03:51:55,931 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:55,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:55,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 03:51:55,933 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-06 03:51:55,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-06 03:51:55,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:51:55,934 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 03:51:55,935 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:55,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:55,935 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:55,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:55,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,938 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:55,939 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:55,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 03:51:55,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:55,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:56,135 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:56,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 03:51:56,136 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:56,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:56,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:56,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:56,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:56,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:56,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-06 03:51:56,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:56,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837172679] [2022-12-06 03:51:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837172679] [2022-12-06 03:51:56,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837172679] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413664011] [2022-12-06 03:51:56,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:56,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:56,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:56,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:51:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:56,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:56,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:56,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:56,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413664011] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:56,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:56,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281447891] [2022-12-06 03:51:56,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:56,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:56,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:56,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:56,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:56,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:56,543 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:56,543 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 03:51:56,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-06 03:51:56,560 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:56,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:56,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 03:51:56,562 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 03:51:56,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:56,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 03:51:56,568 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 03:51:56,570 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:56,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:56,570 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:56,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:56,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,574 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:56,574 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:56,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 03:51:56,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:56,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:56,745 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:56,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 03:51:56,746 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:56,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:56,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:56,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:56,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:56,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 03:51:56,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:56,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-06 03:51:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679515508] [2022-12-06 03:51:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679515508] [2022-12-06 03:51:57,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679515508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578446681] [2022-12-06 03:51:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:57,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:51:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:57,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578446681] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:57,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:57,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032166205] [2022-12-06 03:51:57,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:57,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:57,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:57,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:57,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:57,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:57,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:57,137 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 03:51:57,137 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 03:51:57,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-06 03:51:57,139 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 03:51:57,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:51:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:51:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 03:51:57,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 03:51:57,141 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 03:51:57,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 03:51:57,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 03:51:57,144 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:57,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 03:51:57,145 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 03:51:57,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:57,145 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:57,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:57,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:57,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:57,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:57,151 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 03:51:57,151 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:51:57,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 03:51:57,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 03:51:57,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 03:51:57,371 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:51:57,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 03:51:57,372 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 03:51:57,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:57,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:57,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:57,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 03:51:57,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149165, now seen corresponding path program 1 times [2022-12-06 03:51:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:57,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393949375] [2022-12-06 03:51:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:57,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393949375] [2022-12-06 03:51:57,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393949375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:57,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14073164] [2022-12-06 03:51:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:57,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:57,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:57,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:51:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:57,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:57,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:57,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:57,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 03:51:57,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14073164] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:57,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:57,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604914207] [2022-12-06 03:51:57,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:57,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:57,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:57,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:57,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:57,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:57,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:57,717 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:57,717 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-06 03:51:57,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 176 events. 115/176 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 489. Up to 64 conditions per place. [2022-12-06 03:51:57,718 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:57,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:57,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:57,719 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:57,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-06 03:51:57,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 03:51:57,720 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:57,721 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:57,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:57,721 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:57,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:57,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,723 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:57,723 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:57,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:57,724 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:57,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:57,849 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:57,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 03:51:57,849 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:57,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:57,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:57,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:57,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:58,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149103, now seen corresponding path program 1 times [2022-12-06 03:51:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658156842] [2022-12-06 03:51:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658156842] [2022-12-06 03:51:58,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658156842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060676368] [2022-12-06 03:51:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:58,094 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:58,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:51:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060676368] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:58,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:58,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:58,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747892335] [2022-12-06 03:51:58,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:58,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:58,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:58,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:58,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:58,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:58,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:58,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:58,218 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:58,218 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 03:51:58,218 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 03:51:58,219 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:58,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:58,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:58,220 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:58,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:58,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 03:51:58,221 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:58,221 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:58,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:58,222 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:58,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:58,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,224 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:58,224 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:58,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:58,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:58,341 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:58,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 03:51:58,342 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:58,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:58,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:58,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:58,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149041, now seen corresponding path program 1 times [2022-12-06 03:51:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:58,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755372709] [2022-12-06 03:51:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755372709] [2022-12-06 03:51:58,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755372709] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473514862] [2022-12-06 03:51:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:58,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:58,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:51:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:58,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:51:58,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:58,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:58,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 03:51:58,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473514862] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:58,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:58,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 03:51:58,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439610983] [2022-12-06 03:51:58,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:58,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:51:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:58,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:51:58,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:51:58,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:58,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:58,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:58,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:51:58,723 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 03:51:58,723 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 03:51:58,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 03:51:58,740 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 03:51:58,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:51:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:51:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 03:51:58,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:51:58,741 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 03:51:58,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 03:51:58,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 03:51:58,747 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 03:51:58,747 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 03:51:58,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:51:58,747 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:51:58,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:51:58,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,750 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:51:58,750 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 03:51:58,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 03:51:58,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 03:51:58,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 03:51:58,871 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:51:58,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 03:51:58,872 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 03:51:58,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:58,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:51:58,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:51:58,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 03:51:59,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:59,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:51:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:51:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148979, now seen corresponding path program 1 times [2022-12-06 03:51:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:51:59,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173112978] [2022-12-06 03:51:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:51:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:59,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:51:59,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173112978] [2022-12-06 03:51:59,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173112978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:51:59,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595551352] [2022-12-06 03:51:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:51:59,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:51:59,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:51:59,231 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:51:59,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:51:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:51:59,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:51:59,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:51:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:59,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:51:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:51:59,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595551352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:51:59,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:51:59,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-06 03:51:59,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789442590] [2022-12-06 03:51:59,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:51:59,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:51:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:51:59,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:51:59,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:51:59,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 03:51:59,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:51:59,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:51:59,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 03:51:59,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:01,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:01,792 INFO L130 PetriNetUnfolder]: 265/405 cut-off events. [2022-12-06 03:52:01,792 INFO L131 PetriNetUnfolder]: For 379/379 co-relation queries the response was YES. [2022-12-06 03:52:01,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 405 events. 265/405 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1299 event pairs, 28 based on Foata normal form. 25/334 useless extension candidates. Maximal degree in co-relation 1095. Up to 167 conditions per place. [2022-12-06 03:52:01,794 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 46 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2022-12-06 03:52:01,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 65 transitions, 338 flow [2022-12-06 03:52:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:52:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:52:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-06 03:52:01,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 03:52:01,795 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 8 states and 68 transitions. [2022-12-06 03:52:01,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 65 transitions, 338 flow [2022-12-06 03:52:01,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 65 transitions, 294 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:01,797 INFO L231 Difference]: Finished difference. Result has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:01,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=159, PETRI_PLACES=27, PETRI_TRANSITIONS=33} [2022-12-06 03:52:01,798 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 9 predicate places. [2022-12-06 03:52:01,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:01,798 INFO L89 Accepts]: Start accepts. Operand has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:01,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:01,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:01,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:01,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:01,803 INFO L130 PetriNetUnfolder]: 35/76 cut-off events. [2022-12-06 03:52:01,803 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-12-06 03:52:01,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 76 events. 35/76 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 210 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 175. Up to 41 conditions per place. [2022-12-06 03:52:01,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-06 03:52:01,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 03:52:01,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:52:01,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:52:01,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:52:02,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:52:02,111 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:02,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 03:52:02,112 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 32 transitions, 174 flow [2022-12-06 03:52:02,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:02,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:02,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:02,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 03:52:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:02,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148917, now seen corresponding path program 1 times [2022-12-06 03:52:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:02,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589532864] [2022-12-06 03:52:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589532864] [2022-12-06 03:52:02,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589532864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:02,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:02,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873229541] [2022-12-06 03:52:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:02,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:02,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:02,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:52:02,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 32 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:02,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:02,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:52:02,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:02,371 INFO L130 PetriNetUnfolder]: 170/268 cut-off events. [2022-12-06 03:52:02,371 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-06 03:52:02,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 268 events. 170/268 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 819 event pairs, 63 based on Foata normal form. 8/276 useless extension candidates. Maximal degree in co-relation 766. Up to 155 conditions per place. [2022-12-06 03:52:02,372 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 25 selfloop transitions, 6 changer transitions 1/32 dead transitions. [2022-12-06 03:52:02,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 218 flow [2022-12-06 03:52:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 03:52:02,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 03:52:02,373 INFO L175 Difference]: Start difference. First operand has 26 places, 32 transitions, 174 flow. Second operand 3 states and 26 transitions. [2022-12-06 03:52:02,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 218 flow [2022-12-06 03:52:02,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 204 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:02,374 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 129 flow [2022-12-06 03:52:02,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-06 03:52:02,375 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 8 predicate places. [2022-12-06 03:52:02,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:02,375 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 129 flow [2022-12-06 03:52:02,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:02,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:02,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 129 flow [2022-12-06 03:52:02,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 129 flow [2022-12-06 03:52:02,379 INFO L130 PetriNetUnfolder]: 26/58 cut-off events. [2022-12-06 03:52:02,379 INFO L131 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2022-12-06 03:52:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 58 events. 26/58 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 134. Up to 33 conditions per place. [2022-12-06 03:52:02,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 129 flow [2022-12-06 03:52:02,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 03:52:02,380 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:02,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:52:02,381 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 129 flow [2022-12-06 03:52:02,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:02,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:02,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:02,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 03:52:02,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:02,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1106078484, now seen corresponding path program 1 times [2022-12-06 03:52:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:02,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21870798] [2022-12-06 03:52:02,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:02,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21870798] [2022-12-06 03:52:02,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21870798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293117001] [2022-12-06 03:52:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:02,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:02,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:02,542 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:02,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:52:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:02,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:02,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:02,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:02,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293117001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:02,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:02,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632291708] [2022-12-06 03:52:02,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:02,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:02,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:52:02,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 129 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:02,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:02,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:52:02,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:05,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:07,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:09,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:09,707 INFO L130 PetriNetUnfolder]: 350/539 cut-off events. [2022-12-06 03:52:09,708 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-06 03:52:09,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 539 events. 350/539 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1934 event pairs, 25 based on Foata normal form. 20/559 useless extension candidates. Maximal degree in co-relation 1556. Up to 219 conditions per place. [2022-12-06 03:52:09,710 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-06 03:52:09,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 101 transitions, 604 flow [2022-12-06 03:52:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:52:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:52:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-12-06 03:52:09,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-06 03:52:09,711 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 129 flow. Second operand 12 states and 100 transitions. [2022-12-06 03:52:09,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 101 transitions, 604 flow [2022-12-06 03:52:09,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 101 transitions, 576 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:09,714 INFO L231 Difference]: Finished difference. Result has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:09,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=37, PETRI_TRANSITIONS=55} [2022-12-06 03:52:09,715 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-06 03:52:09,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:09,715 INFO L89 Accepts]: Start accepts. Operand has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:09,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:09,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:09,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:09,723 INFO L130 PetriNetUnfolder]: 52/109 cut-off events. [2022-12-06 03:52:09,723 INFO L131 PetriNetUnfolder]: For 127/131 co-relation queries the response was YES. [2022-12-06 03:52:09,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 109 events. 52/109 cut-off events. For 127/131 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 348 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 339. Up to 72 conditions per place. [2022-12-06 03:52:09,724 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-06 03:52:09,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-06 03:52:09,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L705-6-->L687-5: Formula: (and (= (+ (* v_~prev~0_164 13) (* 21 v_~next~0_87) (* 21 v_~cur~0_135)) (* 34 v_~prev~0_163)) (= v_~cur~0_134 v_~next~0_87) (= (+ (* 34 v_~cur~0_135) (* 21 v_~prev~0_163) (* 21 v_~prev~0_164)) (* 13 v_~next~0_87)) (= v_~p~0_39 (+ v_~p~0_40 1)) (< v_~p~0_40 7) (= (+ v_~j~0_115 v_~i~0_102) v_~i~0_101) (< v_~x~0_149 17) (= (+ 16 v_~x~0_150) v_~x~0_149)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_164, ~i~0=v_~i~0_102, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_135, ~x~0=v_~x~0_150} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_93|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_87, ~prev~0=v_~prev~0_163, ~i~0=v_~i~0_101, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_134, ~x~0=v_~x~0_149} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14) (< v_~x~0_22 16)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-06 03:52:09,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14) (< v_~x~0_22 16)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-06 03:52:09,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) 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 [350] L705-6-->L687-5: Formula: (and (= v_~cur~0_152 v_~next~0_97) (= (+ v_~j~0_125 v_~i~0_110) v_~i~0_109) (= v_~p~0_43 (+ v_~p~0_44 1)) (< v_~x~0_167 17) (= (+ 16 v_~x~0_168) v_~x~0_167) (= (* 13 v_~next~0_97) (+ (* 34 v_~cur~0_153) (* 21 v_~prev~0_181) (* 21 v_~prev~0_182))) (= (+ (* v_~prev~0_182 13) (* 21 v_~next~0_97) (* 21 v_~cur~0_153)) (* 34 v_~prev~0_181)) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_125, ~prev~0=v_~prev~0_182, ~i~0=v_~i~0_110, ~p~0=v_~p~0_44, ~cur~0=v_~cur~0_153, ~x~0=v_~x~0_168} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_103|, ~j~0=v_~j~0_125, ~next~0=v_~next~0_97, ~prev~0=v_~prev~0_181, ~i~0=v_~i~0_109, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_30|, ~p~0=v_~p~0_43, ~cur~0=v_~cur~0_152, ~x~0=v_~x~0_167} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:52:10,071 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 03:52:10,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-06 03:52:10,072 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 55 transitions, 403 flow [2022-12-06 03:52:10,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:10,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:10,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:10,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 03:52:10,278 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,SelfDestructingSolverStorable9 [2022-12-06 03:52:10,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1421156962, now seen corresponding path program 1 times [2022-12-06 03:52:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:10,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410723327] [2022-12-06 03:52:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410723327] [2022-12-06 03:52:10,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410723327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:10,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:10,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:52:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054189441] [2022-12-06 03:52:10,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:10,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:52:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:10,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:52:10,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:52:10,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:52:10,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 55 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:10,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:10,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:52:10,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:10,390 INFO L130 PetriNetUnfolder]: 285/446 cut-off events. [2022-12-06 03:52:10,390 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-06 03:52:10,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 446 events. 285/446 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1566 event pairs, 111 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 1520. Up to 251 conditions per place. [2022-12-06 03:52:10,393 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-06 03:52:10,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 511 flow [2022-12-06 03:52:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:52:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:52:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 03:52:10,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 03:52:10,394 INFO L175 Difference]: Start difference. First operand has 37 places, 55 transitions, 403 flow. Second operand 3 states and 30 transitions. [2022-12-06 03:52:10,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 511 flow [2022-12-06 03:52:10,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 439 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-06 03:52:10,398 INFO L231 Difference]: Finished difference. Result has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:10,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=37, PETRI_TRANSITIONS=50} [2022-12-06 03:52:10,399 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-06 03:52:10,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:10,399 INFO L89 Accepts]: Start accepts. Operand has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:10,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:10,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:10,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:10,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:10,405 INFO L130 PetriNetUnfolder]: 43/92 cut-off events. [2022-12-06 03:52:10,405 INFO L131 PetriNetUnfolder]: For 142/151 co-relation queries the response was YES. [2022-12-06 03:52:10,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 92 events. 43/92 cut-off events. For 142/151 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 279 event pairs, 0 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 258. Up to 45 conditions per place. [2022-12-06 03:52:10,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:10,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 03:52:10,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:10,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:52:10,412 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 50 transitions, 321 flow [2022-12-06 03:52:10,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:10,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:10,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:10,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 03:52:10,413 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1105035954, now seen corresponding path program 1 times [2022-12-06 03:52:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405318219] [2022-12-06 03:52:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:10,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405318219] [2022-12-06 03:52:10,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405318219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:10,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206422964] [2022-12-06 03:52:10,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:10,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:10,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:10,539 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:10,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:52:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:10,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:52:10,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:10,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206422964] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:10,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:10,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574100300] [2022-12-06 03:52:10,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:10,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:10,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:10,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 50 transitions, 321 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:10,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:10,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:10,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:11,988 INFO L130 PetriNetUnfolder]: 497/766 cut-off events. [2022-12-06 03:52:11,988 INFO L131 PetriNetUnfolder]: For 1304/1304 co-relation queries the response was YES. [2022-12-06 03:52:11,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 766 events. 497/766 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3088 event pairs, 28 based on Foata normal form. 20/772 useless extension candidates. Maximal degree in co-relation 2431. Up to 279 conditions per place. [2022-12-06 03:52:11,995 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 58 selfloop transitions, 65 changer transitions 0/123 dead transitions. [2022-12-06 03:52:11,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 850 flow [2022-12-06 03:52:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:52:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:52:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-06 03:52:11,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 03:52:11,997 INFO L175 Difference]: Start difference. First operand has 37 places, 50 transitions, 321 flow. Second operand 10 states and 96 transitions. [2022-12-06 03:52:11,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 850 flow [2022-12-06 03:52:12,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 123 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:12,007 INFO L231 Difference]: Finished difference. Result has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:12,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=635, PETRI_PLACES=47, PETRI_TRANSITIONS=79} [2022-12-06 03:52:12,010 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 29 predicate places. [2022-12-06 03:52:12,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:12,010 INFO L89 Accepts]: Start accepts. Operand has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:12,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:12,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:12,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:12,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:12,020 INFO L130 PetriNetUnfolder]: 77/160 cut-off events. [2022-12-06 03:52:12,020 INFO L131 PetriNetUnfolder]: For 390/399 co-relation queries the response was YES. [2022-12-06 03:52:12,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 160 events. 77/160 cut-off events. For 390/399 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 652 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 588. Up to 96 conditions per place. [2022-12-06 03:52:12,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:12,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 03:52:12,022 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:12,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 03:52:12,023 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 79 transitions, 635 flow [2022-12-06 03:52:12,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:12,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:12,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:12,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:12,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1106192688, now seen corresponding path program 1 times [2022-12-06 03:52:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:12,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280122423] [2022-12-06 03:52:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:12,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280122423] [2022-12-06 03:52:12,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280122423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:52:12,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:52:12,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:52:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445821392] [2022-12-06 03:52:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:52:12,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:52:12,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:12,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:52:12,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:52:12,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:12,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 79 transitions, 635 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:12,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:12,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:12,334 INFO L130 PetriNetUnfolder]: 382/627 cut-off events. [2022-12-06 03:52:12,334 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2022-12-06 03:52:12,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 627 events. 382/627 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2627 event pairs, 163 based on Foata normal form. 67/683 useless extension candidates. Maximal degree in co-relation 2205. Up to 359 conditions per place. [2022-12-06 03:52:12,337 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 58 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-06 03:52:12,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 703 flow [2022-12-06 03:52:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:52:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:52:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 03:52:12,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-06 03:52:12,338 INFO L175 Difference]: Start difference. First operand has 47 places, 79 transitions, 635 flow. Second operand 4 states and 29 transitions. [2022-12-06 03:52:12,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 703 flow [2022-12-06 03:52:12,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 665 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:12,343 INFO L231 Difference]: Finished difference. Result has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:12,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=45, PETRI_TRANSITIONS=63} [2022-12-06 03:52:12,344 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-06 03:52:12,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:12,344 INFO L89 Accepts]: Start accepts. Operand has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:12,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:12,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:12,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:12,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:12,352 INFO L130 PetriNetUnfolder]: 52/131 cut-off events. [2022-12-06 03:52:12,352 INFO L131 PetriNetUnfolder]: For 259/267 co-relation queries the response was YES. [2022-12-06 03:52:12,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 131 events. 52/131 cut-off events. For 259/267 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 566 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 427. Up to 53 conditions per place. [2022-12-06 03:52:12,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:12,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 03:52:12,353 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:52:12,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 03:52:12,355 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 63 transitions, 509 flow [2022-12-06 03:52:12,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:12,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:12,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 03:52:12,355 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1429430494, now seen corresponding path program 1 times [2022-12-06 03:52:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:12,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654671907] [2022-12-06 03:52:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:12,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654671907] [2022-12-06 03:52:12,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654671907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:12,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865286469] [2022-12-06 03:52:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:12,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:12,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:12,474 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:12,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:52:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:12,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:12,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:12,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:12,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865286469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:12,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:12,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 03:52:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942710488] [2022-12-06 03:52:12,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:12,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:52:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:52:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:52:12,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:52:12,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 63 transitions, 509 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:12,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:12,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:52:12,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:15,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:15,842 INFO L130 PetriNetUnfolder]: 412/689 cut-off events. [2022-12-06 03:52:15,842 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2022-12-06 03:52:15,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 689 events. 412/689 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3055 event pairs, 39 based on Foata normal form. 26/701 useless extension candidates. Maximal degree in co-relation 2326. Up to 427 conditions per place. [2022-12-06 03:52:15,845 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 68 selfloop transitions, 42 changer transitions 0/110 dead transitions. [2022-12-06 03:52:15,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 883 flow [2022-12-06 03:52:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:52:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:52:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 03:52:15,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 03:52:15,846 INFO L175 Difference]: Start difference. First operand has 45 places, 63 transitions, 509 flow. Second operand 10 states and 74 transitions. [2022-12-06 03:52:15,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 883 flow [2022-12-06 03:52:15,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 03:52:15,850 INFO L231 Difference]: Finished difference. Result has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:15,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=56, PETRI_TRANSITIONS=77} [2022-12-06 03:52:15,851 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-06 03:52:15,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:15,851 INFO L89 Accepts]: Start accepts. Operand has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:15,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:15,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:15,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:15,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:15,860 INFO L130 PetriNetUnfolder]: 62/154 cut-off events. [2022-12-06 03:52:15,860 INFO L131 PetriNetUnfolder]: For 383/395 co-relation queries the response was YES. [2022-12-06 03:52:15,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 154 events. 62/154 cut-off events. For 383/395 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 698 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 598. Up to 62 conditions per place. [2022-12-06 03:52:15,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-06 03:52:15,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 03:52:16,020 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:16,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 03:52:16,020 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 77 transitions, 732 flow [2022-12-06 03:52:16,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:16,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:16,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:16,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:16,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 03:52:16,221 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash 67913115, now seen corresponding path program 1 times [2022-12-06 03:52:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:16,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654734075] [2022-12-06 03:52:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:16,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:16,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654734075] [2022-12-06 03:52:16,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654734075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:16,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892775463] [2022-12-06 03:52:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:16,389 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:16,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:52:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:16,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:16,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:16,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892775463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:16,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:16,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018399355] [2022-12-06 03:52:16,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:16,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:16,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:16,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:16,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 03:52:16,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 77 transitions, 732 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:16,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:16,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 03:52:16,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:19,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:19,611 INFO L130 PetriNetUnfolder]: 472/809 cut-off events. [2022-12-06 03:52:19,611 INFO L131 PetriNetUnfolder]: For 3388/3388 co-relation queries the response was YES. [2022-12-06 03:52:19,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 809 events. 472/809 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3824 event pairs, 35 based on Foata normal form. 40/838 useless extension candidates. Maximal degree in co-relation 3038. Up to 460 conditions per place. [2022-12-06 03:52:19,615 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 79 selfloop transitions, 58 changer transitions 0/137 dead transitions. [2022-12-06 03:52:19,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 137 transitions, 1256 flow [2022-12-06 03:52:19,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:52:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:52:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 03:52:19,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-06 03:52:19,616 INFO L175 Difference]: Start difference. First operand has 56 places, 77 transitions, 732 flow. Second operand 11 states and 82 transitions. [2022-12-06 03:52:19,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 137 transitions, 1256 flow [2022-12-06 03:52:19,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 1203 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:19,627 INFO L231 Difference]: Finished difference. Result has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:19,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1061, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2022-12-06 03:52:19,628 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-06 03:52:19,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:19,628 INFO L89 Accepts]: Start accepts. Operand has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:19,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:19,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:19,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:19,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:19,641 INFO L130 PetriNetUnfolder]: 76/197 cut-off events. [2022-12-06 03:52:19,642 INFO L131 PetriNetUnfolder]: For 724/736 co-relation queries the response was YES. [2022-12-06 03:52:19,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 197 events. 76/197 cut-off events. For 724/736 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 974 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 866. Up to 82 conditions per place. [2022-12-06 03:52:19,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-06 03:52:19,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 03:52:19,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:19,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 03:52:19,681 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 1064 flow [2022-12-06 03:52:19,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:19,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:19,681 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:19,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:19,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 03:52:19,885 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1362345130, now seen corresponding path program 1 times [2022-12-06 03:52:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:19,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747907399] [2022-12-06 03:52:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:20,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747907399] [2022-12-06 03:52:20,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747907399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:20,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927216631] [2022-12-06 03:52:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:20,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:20,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:20,068 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:20,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:52:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:20,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:20,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:20,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:20,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927216631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:20,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:20,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796618099] [2022-12-06 03:52:20,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:20,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:20,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:20,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:20,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 03:52:20,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 1064 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:20,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:20,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 03:52:20,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:21,134 INFO L130 PetriNetUnfolder]: 512/889 cut-off events. [2022-12-06 03:52:21,134 INFO L131 PetriNetUnfolder]: For 4892/4892 co-relation queries the response was YES. [2022-12-06 03:52:21,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 889 events. 512/889 cut-off events. For 4892/4892 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4386 event pairs, 46 based on Foata normal form. 24/902 useless extension candidates. Maximal degree in co-relation 3656. Up to 544 conditions per place. [2022-12-06 03:52:21,140 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 91 selfloop transitions, 62 changer transitions 0/153 dead transitions. [2022-12-06 03:52:21,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1586 flow [2022-12-06 03:52:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:52:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:52:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-06 03:52:21,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-06 03:52:21,141 INFO L175 Difference]: Start difference. First operand has 67 places, 101 transitions, 1064 flow. Second operand 11 states and 83 transitions. [2022-12-06 03:52:21,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1586 flow [2022-12-06 03:52:21,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 1547 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 03:52:21,155 INFO L231 Difference]: Finished difference. Result has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:21,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=78, PETRI_TRANSITIONS=117} [2022-12-06 03:52:21,155 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 60 predicate places. [2022-12-06 03:52:21,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:21,155 INFO L89 Accepts]: Start accepts. Operand has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:21,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:21,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:21,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:21,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:21,169 INFO L130 PetriNetUnfolder]: 86/226 cut-off events. [2022-12-06 03:52:21,169 INFO L131 PetriNetUnfolder]: For 1141/1153 co-relation queries the response was YES. [2022-12-06 03:52:21,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 226 events. 86/226 cut-off events. For 1141/1153 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1167 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 1100. Up to 102 conditions per place. [2022-12-06 03:52:21,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-06 03:52:21,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 03:52:21,281 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:21,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 03:52:21,281 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 117 transitions, 1375 flow [2022-12-06 03:52:21,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:21,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:21,282 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:21,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:21,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 03:52:21,482 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 549141087, now seen corresponding path program 1 times [2022-12-06 03:52:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:21,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918018892] [2022-12-06 03:52:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918018892] [2022-12-06 03:52:21,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918018892] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052234567] [2022-12-06 03:52:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:21,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:21,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 03:52:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:21,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:21,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:21,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:21,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052234567] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:21,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:21,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437063332] [2022-12-06 03:52:21,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:21,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:21,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:21,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:21,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 03:52:21,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 117 transitions, 1375 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:21,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:21,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 03:52:21,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:33,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:35,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:38,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:39,065 INFO L130 PetriNetUnfolder]: 532/933 cut-off events. [2022-12-06 03:52:39,065 INFO L131 PetriNetUnfolder]: For 5426/5426 co-relation queries the response was YES. [2022-12-06 03:52:39,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 933 events. 532/933 cut-off events. For 5426/5426 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4744 event pairs, 35 based on Foata normal form. 12/934 useless extension candidates. Maximal degree in co-relation 4128. Up to 468 conditions per place. [2022-12-06 03:52:39,069 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 101 selfloop transitions, 88 changer transitions 2/191 dead transitions. [2022-12-06 03:52:39,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 2063 flow [2022-12-06 03:52:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:52:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:52:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-06 03:52:39,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2669683257918552 [2022-12-06 03:52:39,072 INFO L175 Difference]: Start difference. First operand has 78 places, 117 transitions, 1375 flow. Second operand 17 states and 118 transitions. [2022-12-06 03:52:39,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 2063 flow [2022-12-06 03:52:39,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 191 transitions, 2003 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:39,086 INFO L231 Difference]: Finished difference. Result has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:39,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1764, PETRI_PLACES=93, PETRI_TRANSITIONS=133} [2022-12-06 03:52:39,086 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-06 03:52:39,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:39,087 INFO L89 Accepts]: Start accepts. Operand has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:39,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:39,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:39,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:39,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:39,104 INFO L130 PetriNetUnfolder]: 91/244 cut-off events. [2022-12-06 03:52:39,104 INFO L131 PetriNetUnfolder]: For 1386/1394 co-relation queries the response was YES. [2022-12-06 03:52:39,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 244 events. 91/244 cut-off events. For 1386/1394 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1346 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1314. Up to 112 conditions per place. [2022-12-06 03:52:39,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-06 03:52:39,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 03:52:39,464 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:52:39,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 378 [2022-12-06 03:52:39,465 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 133 transitions, 1799 flow [2022-12-06 03:52:39,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:39,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:39,465 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:39,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:39,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 03:52:39,666 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:39,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2103423086, now seen corresponding path program 1 times [2022-12-06 03:52:39,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:39,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625387886] [2022-12-06 03:52:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:39,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:39,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625387886] [2022-12-06 03:52:39,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625387886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:39,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780000718] [2022-12-06 03:52:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:39,818 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:39,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:52:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:39,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:39,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:40,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:40,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780000718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:40,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:40,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157233629] [2022-12-06 03:52:40,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:40,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:40,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 03:52:40,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 133 transitions, 1799 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:40,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:40,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 03:52:40,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:44,538 INFO L130 PetriNetUnfolder]: 766/1357 cut-off events. [2022-12-06 03:52:44,538 INFO L131 PetriNetUnfolder]: For 17964/17964 co-relation queries the response was YES. [2022-12-06 03:52:44,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1357 events. 766/1357 cut-off events. For 17964/17964 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7579 event pairs, 45 based on Foata normal form. 54/1400 useless extension candidates. Maximal degree in co-relation 6410. Up to 427 conditions per place. [2022-12-06 03:52:44,547 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 111 selfloop transitions, 163 changer transitions 0/274 dead transitions. [2022-12-06 03:52:44,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 274 transitions, 3397 flow [2022-12-06 03:52:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:52:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:52:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2022-12-06 03:52:44,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-06 03:52:44,549 INFO L175 Difference]: Start difference. First operand has 93 places, 133 transitions, 1799 flow. Second operand 18 states and 144 transitions. [2022-12-06 03:52:44,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 274 transitions, 3397 flow [2022-12-06 03:52:44,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 274 transitions, 3265 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-06 03:52:44,581 INFO L231 Difference]: Finished difference. Result has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:44,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=109, PETRI_TRANSITIONS=205} [2022-12-06 03:52:44,582 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 91 predicate places. [2022-12-06 03:52:44,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:44,582 INFO L89 Accepts]: Start accepts. Operand has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:44,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:44,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:44,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:44,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:44,611 INFO L130 PetriNetUnfolder]: 133/352 cut-off events. [2022-12-06 03:52:44,611 INFO L131 PetriNetUnfolder]: For 2797/2809 co-relation queries the response was YES. [2022-12-06 03:52:44,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 352 events. 133/352 cut-off events. For 2797/2809 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2083 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 2172. Up to 183 conditions per place. [2022-12-06 03:52:44,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-06 03:52:44,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-06 03:52:44,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:44,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 03:52:44,663 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 205 transitions, 3056 flow [2022-12-06 03:52:44,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:44,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:44,664 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:44,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 03:52:44,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:44,868 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1363953844, now seen corresponding path program 1 times [2022-12-06 03:52:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:44,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104895379] [2022-12-06 03:52:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:45,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104895379] [2022-12-06 03:52:45,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104895379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:45,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17982917] [2022-12-06 03:52:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:45,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:45,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:45,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:45,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:52:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:45,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:45,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:45,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:45,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17982917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:45,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:45,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419392800] [2022-12-06 03:52:45,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:45,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:45,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:45,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 03:52:45,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 205 transitions, 3056 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:45,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:45,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 03:52:45,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:51,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:52,108 INFO L130 PetriNetUnfolder]: 868/1533 cut-off events. [2022-12-06 03:52:52,108 INFO L131 PetriNetUnfolder]: For 18338/18338 co-relation queries the response was YES. [2022-12-06 03:52:52,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 1533 events. 868/1533 cut-off events. For 18338/18338 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8847 event pairs, 95 based on Foata normal form. 22/1536 useless extension candidates. Maximal degree in co-relation 8047. Up to 1000 conditions per place. [2022-12-06 03:52:52,119 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 176 selfloop transitions, 104 changer transitions 2/282 dead transitions. [2022-12-06 03:52:52,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 282 transitions, 4120 flow [2022-12-06 03:52:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:52:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:52:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 03:52:52,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465437788018433 [2022-12-06 03:52:52,120 INFO L175 Difference]: Start difference. First operand has 109 places, 205 transitions, 3056 flow. Second operand 14 states and 107 transitions. [2022-12-06 03:52:52,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 282 transitions, 4120 flow [2022-12-06 03:52:52,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 282 transitions, 3891 flow, removed 92 selfloop flow, removed 6 redundant places. [2022-12-06 03:52:52,169 INFO L231 Difference]: Finished difference. Result has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:52,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3569, PETRI_PLACES=121, PETRI_TRANSITIONS=234} [2022-12-06 03:52:52,170 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 103 predicate places. [2022-12-06 03:52:52,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:52,170 INFO L89 Accepts]: Start accepts. Operand has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:52,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:52,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:52,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:52,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:52,197 INFO L130 PetriNetUnfolder]: 153/401 cut-off events. [2022-12-06 03:52:52,198 INFO L131 PetriNetUnfolder]: For 2852/2864 co-relation queries the response was YES. [2022-12-06 03:52:52,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 401 events. 153/401 cut-off events. For 2852/2864 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2534 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 2526. Up to 187 conditions per place. [2022-12-06 03:52:52,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-06 03:52:52,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 03:52:52,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) 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 [349] L705-6-->L695-5: Formula: (and (= v_~q~0_59 (+ v_~q~0_60 1)) (= v_~j~0_121 (+ v_~j~0_122 v_~i~0_107)) (< v_~x~0_163 17) (= (+ (* 21 v_~prev~0_178) (* 21 v_~prev~0_177) (* 34 v_~cur~0_149)) (* 13 v_~next~0_95)) (= (* 34 v_~prev~0_177) (+ (* 21 v_~cur~0_149) (* v_~prev~0_178 13) (* 21 v_~next~0_95))) (= v_~cur~0_148 v_~next~0_95) (< v_~q~0_60 7) (= (+ 16 v_~x~0_164) v_~x~0_163)) InVars {~j~0=v_~j~0_122, ~prev~0=v_~prev~0_178, ~i~0=v_~i~0_107, ~q~0=v_~q~0_60, ~cur~0=v_~cur~0_149, ~x~0=v_~x~0_164} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_101|, ~j~0=v_~j~0_121, ~next~0=v_~next~0_95, ~prev~0=v_~prev~0_177, ~i~0=v_~i~0_107, ~q~0=v_~q~0_59, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_40|, ~cur~0=v_~cur~0_148, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:52:52,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) 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 [365] L705-6-->L695-5: Formula: (and (= (+ (* 21 v_~prev~0_230) (* 21 v_~prev~0_229) (* 34 v_~cur~0_195)) (* v_~next~0_123 13)) (= (+ (* v_~prev~0_230 13) (* 21 v_~next~0_123) (* 21 v_~cur~0_195)) (* 34 v_~prev~0_229)) (= (+ 2 v_~q~0_110) v_~q~0_108) (= v_~j~0_189 (+ v_~j~0_191 (* 2 v_~i~0_179))) (< v_~x~0_215 17) (< v_~q~0_110 6) (= v_~next~0_123 v_~cur~0_194) (= (+ 16 v_~x~0_216) v_~x~0_215)) InVars {~j~0=v_~j~0_191, ~prev~0=v_~prev~0_230, ~i~0=v_~i~0_179, ~q~0=v_~q~0_110, ~cur~0=v_~cur~0_195, ~x~0=v_~x~0_216} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_135|, ~j~0=v_~j~0_189, ~next~0=v_~next~0_123, ~prev~0=v_~prev~0_229, ~i~0=v_~i~0_179, ~q~0=v_~q~0_108, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_78|, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_215} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:52:52,422 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:52:52,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 03:52:52,423 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 234 transitions, 3562 flow [2022-12-06 03:52:52,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:52,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:52,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:52,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:52,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:52,628 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2104860525, now seen corresponding path program 1 times [2022-12-06 03:52:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534156387] [2022-12-06 03:52:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:52,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534156387] [2022-12-06 03:52:52,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534156387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:52,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635214762] [2022-12-06 03:52:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:52,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:52,763 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:52,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:52:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:52,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:52:52,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:52,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:53,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635214762] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:53,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:53,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:52:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4553474] [2022-12-06 03:52:53,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:53,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:52:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:52:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:52:53,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 03:52:53,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 234 transitions, 3562 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:53,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:53,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 03:52:53,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:52:55,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:52:56,165 INFO L130 PetriNetUnfolder]: 1116/1949 cut-off events. [2022-12-06 03:52:56,165 INFO L131 PetriNetUnfolder]: For 24986/24986 co-relation queries the response was YES. [2022-12-06 03:52:56,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 1949 events. 1116/1949 cut-off events. For 24986/24986 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 11513 event pairs, 39 based on Foata normal form. 26/1953 useless extension candidates. Maximal degree in co-relation 10634. Up to 566 conditions per place. [2022-12-06 03:52:56,185 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 99 selfloop transitions, 253 changer transitions 0/352 dead transitions. [2022-12-06 03:52:56,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 352 transitions, 5256 flow [2022-12-06 03:52:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:52:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:52:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2022-12-06 03:52:56,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27647058823529413 [2022-12-06 03:52:56,187 INFO L175 Difference]: Start difference. First operand has 121 places, 234 transitions, 3562 flow. Second operand 15 states and 141 transitions. [2022-12-06 03:52:56,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 352 transitions, 5256 flow [2022-12-06 03:52:56,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 352 transitions, 5174 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-06 03:52:56,279 INFO L231 Difference]: Finished difference. Result has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:56,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3484, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5003, PETRI_PLACES=136, PETRI_TRANSITIONS=281} [2022-12-06 03:52:56,279 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 118 predicate places. [2022-12-06 03:52:56,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:52:56,279 INFO L89 Accepts]: Start accepts. Operand has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:56,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:52:56,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:52:56,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:56,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:56,320 INFO L130 PetriNetUnfolder]: 184/484 cut-off events. [2022-12-06 03:52:56,320 INFO L131 PetriNetUnfolder]: For 5335/5351 co-relation queries the response was YES. [2022-12-06 03:52:56,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 484 events. 184/484 cut-off events. For 5335/5351 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3161 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 3580. Up to 229 conditions per place. [2022-12-06 03:52:56,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-06 03:52:56,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-06 03:52:56,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:52:56,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 03:52:56,383 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 281 transitions, 5007 flow [2022-12-06 03:52:56,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:56,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:52:56,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:52:56,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 03:52:56,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:56,588 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:52:56,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:52:56,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1361857903, now seen corresponding path program 1 times [2022-12-06 03:52:56,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:52:56,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895338055] [2022-12-06 03:52:56,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:56,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:52:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:56,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:52:56,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895338055] [2022-12-06 03:52:56,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895338055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:52:56,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993543727] [2022-12-06 03:52:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:52:56,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:52:56,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:52:56,711 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:52:56,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:52:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:52:56,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 03:52:56,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:52:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:56,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:52:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:52:57,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993543727] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:52:57,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:52:57,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:52:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252370043] [2022-12-06 03:52:57,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:52:57,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:52:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:52:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:52:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:52:57,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:52:57,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 281 transitions, 5007 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:52:57,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:52:57,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:52:57,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:00,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:02,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:04,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:04,877 INFO L130 PetriNetUnfolder]: 1266/2207 cut-off events. [2022-12-06 03:53:04,877 INFO L131 PetriNetUnfolder]: For 39428/39428 co-relation queries the response was YES. [2022-12-06 03:53:04,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13568 conditions, 2207 events. 1266/2207 cut-off events. For 39428/39428 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 13460 event pairs, 135 based on Foata normal form. 30/2215 useless extension candidates. Maximal degree in co-relation 13511. Up to 1395 conditions per place. [2022-12-06 03:53:04,893 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 215 selfloop transitions, 154 changer transitions 0/369 dead transitions. [2022-12-06 03:53:04,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 369 transitions, 6556 flow [2022-12-06 03:53:04,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:53:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:53:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 118 transitions. [2022-12-06 03:53:04,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24081632653061225 [2022-12-06 03:53:04,895 INFO L175 Difference]: Start difference. First operand has 136 places, 281 transitions, 5007 flow. Second operand 14 states and 118 transitions. [2022-12-06 03:53:04,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 369 transitions, 6556 flow [2022-12-06 03:53:05,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 369 transitions, 6296 flow, removed 63 selfloop flow, removed 7 redundant places. [2022-12-06 03:53:05,032 INFO L231 Difference]: Finished difference. Result has 152 places, 319 transitions, 5968 flow [2022-12-06 03:53:05,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4775, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5968, PETRI_PLACES=152, PETRI_TRANSITIONS=319} [2022-12-06 03:53:05,033 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-06 03:53:05,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:05,034 INFO L89 Accepts]: Start accepts. Operand has 152 places, 319 transitions, 5968 flow [2022-12-06 03:53:05,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:05,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:05,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-06 03:53:05,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 319 transitions, 5968 flow [2022-12-06 03:53:05,082 INFO L130 PetriNetUnfolder]: 204/533 cut-off events. [2022-12-06 03:53:05,082 INFO L131 PetriNetUnfolder]: For 7204/7220 co-relation queries the response was YES. [2022-12-06 03:53:05,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 533 events. 204/533 cut-off events. For 7204/7220 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3622 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 4182. Up to 247 conditions per place. [2022-12-06 03:53:05,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-06 03:53:05,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-06 03:53:05,091 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:05,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 03:53:05,092 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 319 transitions, 5968 flow [2022-12-06 03:53:05,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:05,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:05,093 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:05,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:05,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:05,297 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 550484565, now seen corresponding path program 1 times [2022-12-06 03:53:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:05,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051258377] [2022-12-06 03:53:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:05,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051258377] [2022-12-06 03:53:05,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051258377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:05,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701481237] [2022-12-06 03:53:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:05,444 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:05,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:53:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:05,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:53:05,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:05,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:05,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701481237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:05,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:05,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:53:05,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118422884] [2022-12-06 03:53:05,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:05,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:53:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:05,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:53:05,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:53:05,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:53:05,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 319 transitions, 5968 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:05,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:05,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:53:05,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:12,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:12,755 INFO L130 PetriNetUnfolder]: 1318/2311 cut-off events. [2022-12-06 03:53:12,755 INFO L131 PetriNetUnfolder]: For 47860/47860 co-relation queries the response was YES. [2022-12-06 03:53:12,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14893 conditions, 2311 events. 1318/2311 cut-off events. For 47860/47860 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 14237 event pairs, 169 based on Foata normal form. 28/2320 useless extension candidates. Maximal degree in co-relation 14829. Up to 1570 conditions per place. [2022-12-06 03:53:12,774 INFO L137 encePairwiseOnDemand]: 9/35 looper letters, 224 selfloop transitions, 160 changer transitions 2/386 dead transitions. [2022-12-06 03:53:12,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 386 transitions, 7310 flow [2022-12-06 03:53:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:53:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:53:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-06 03:53:12,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22197802197802197 [2022-12-06 03:53:12,776 INFO L175 Difference]: Start difference. First operand has 152 places, 319 transitions, 5968 flow. Second operand 13 states and 101 transitions. [2022-12-06 03:53:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 386 transitions, 7310 flow [2022-12-06 03:53:12,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 386 transitions, 7208 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-06 03:53:12,982 INFO L231 Difference]: Finished difference. Result has 166 places, 345 transitions, 6892 flow [2022-12-06 03:53:12,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5866, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6892, PETRI_PLACES=166, PETRI_TRANSITIONS=345} [2022-12-06 03:53:12,982 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 148 predicate places. [2022-12-06 03:53:12,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:12,983 INFO L89 Accepts]: Start accepts. Operand has 166 places, 345 transitions, 6892 flow [2022-12-06 03:53:12,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:12,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:12,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 345 transitions, 6892 flow [2022-12-06 03:53:12,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 345 transitions, 6892 flow [2022-12-06 03:53:13,042 INFO L130 PetriNetUnfolder]: 216/570 cut-off events. [2022-12-06 03:53:13,043 INFO L131 PetriNetUnfolder]: For 8817/8837 co-relation queries the response was YES. [2022-12-06 03:53:13,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4764 conditions, 570 events. 216/570 cut-off events. For 8817/8837 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3869 event pairs, 0 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 4699. Up to 258 conditions per place. [2022-12-06 03:53:13,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 345 transitions, 6892 flow [2022-12-06 03:53:13,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 03:53:13,050 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:13,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 03:53:13,051 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 345 transitions, 6892 flow [2022-12-06 03:53:13,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:13,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:13,051 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:13,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 03:53:13,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:13,255 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash 730827570, now seen corresponding path program 2 times [2022-12-06 03:53:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85073701] [2022-12-06 03:53:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:13,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85073701] [2022-12-06 03:53:13,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85073701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:13,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915809174] [2022-12-06 03:53:13,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:53:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:13,364 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:13,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:53:13,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:53:13,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:53:13,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 03:53:13,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:13,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:13,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915809174] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:13,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:13,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618570633] [2022-12-06 03:53:13,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:13,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 03:53:13,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 345 transitions, 6892 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:13,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:13,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 03:53:13,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:15,498 INFO L130 PetriNetUnfolder]: 1548/2695 cut-off events. [2022-12-06 03:53:15,498 INFO L131 PetriNetUnfolder]: For 60273/60273 co-relation queries the response was YES. [2022-12-06 03:53:15,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18233 conditions, 2695 events. 1548/2695 cut-off events. For 60273/60273 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 17078 event pairs, 130 based on Foata normal form. 18/2694 useless extension candidates. Maximal degree in co-relation 18165. Up to 1299 conditions per place. [2022-12-06 03:53:15,518 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 223 selfloop transitions, 231 changer transitions 0/454 dead transitions. [2022-12-06 03:53:15,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 454 transitions, 9031 flow [2022-12-06 03:53:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:53:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:53:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-12-06 03:53:15,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25142857142857145 [2022-12-06 03:53:15,519 INFO L175 Difference]: Start difference. First operand has 166 places, 345 transitions, 6892 flow. Second operand 15 states and 132 transitions. [2022-12-06 03:53:15,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 454 transitions, 9031 flow [2022-12-06 03:53:15,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 454 transitions, 8840 flow, removed 66 selfloop flow, removed 5 redundant places. [2022-12-06 03:53:15,740 INFO L231 Difference]: Finished difference. Result has 180 places, 393 transitions, 8363 flow [2022-12-06 03:53:15,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6727, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8363, PETRI_PLACES=180, PETRI_TRANSITIONS=393} [2022-12-06 03:53:15,741 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 162 predicate places. [2022-12-06 03:53:15,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:15,741 INFO L89 Accepts]: Start accepts. Operand has 180 places, 393 transitions, 8363 flow [2022-12-06 03:53:15,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:15,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:15,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 393 transitions, 8363 flow [2022-12-06 03:53:15,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 393 transitions, 8363 flow [2022-12-06 03:53:15,810 INFO L130 PetriNetUnfolder]: 256/671 cut-off events. [2022-12-06 03:53:15,810 INFO L131 PetriNetUnfolder]: For 13019/13039 co-relation queries the response was YES. [2022-12-06 03:53:15,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 671 events. 256/671 cut-off events. For 13019/13039 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 4783 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 5991. Up to 323 conditions per place. [2022-12-06 03:53:15,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 393 transitions, 8363 flow [2022-12-06 03:53:15,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 1242 [2022-12-06 03:53:15,884 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:53:15,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 03:53:15,885 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 393 transitions, 8383 flow [2022-12-06 03:53:15,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:15,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:15,885 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:15,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:16,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:16,086 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:16,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash 724361621, now seen corresponding path program 1 times [2022-12-06 03:53:16,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:16,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698712750] [2022-12-06 03:53:16,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:16,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698712750] [2022-12-06 03:53:16,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698712750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:53:16,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:53:16,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 03:53:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66055006] [2022-12-06 03:53:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:53:16,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:53:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:16,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:53:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:53:16,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 03:53:16,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 393 transitions, 8383 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:16,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:16,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 03:53:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:16,633 INFO L130 PetriNetUnfolder]: 1552/2695 cut-off events. [2022-12-06 03:53:16,633 INFO L131 PetriNetUnfolder]: For 71466/71466 co-relation queries the response was YES. [2022-12-06 03:53:16,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20307 conditions, 2695 events. 1552/2695 cut-off events. For 71466/71466 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 17331 event pairs, 259 based on Foata normal form. 123/2810 useless extension candidates. Maximal degree in co-relation 20234. Up to 1096 conditions per place. [2022-12-06 03:53:16,654 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 553 selfloop transitions, 55 changer transitions 1/609 dead transitions. [2022-12-06 03:53:16,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 609 transitions, 14254 flow [2022-12-06 03:53:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:53:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:53:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 03:53:16,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32972972972972975 [2022-12-06 03:53:16,656 INFO L175 Difference]: Start difference. First operand has 180 places, 393 transitions, 8383 flow. Second operand 5 states and 61 transitions. [2022-12-06 03:53:16,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 609 transitions, 14254 flow [2022-12-06 03:53:16,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 609 transitions, 13981 flow, removed 97 selfloop flow, removed 6 redundant places. [2022-12-06 03:53:16,979 INFO L231 Difference]: Finished difference. Result has 181 places, 407 transitions, 8651 flow [2022-12-06 03:53:16,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8174, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8651, PETRI_PLACES=181, PETRI_TRANSITIONS=407} [2022-12-06 03:53:16,980 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 163 predicate places. [2022-12-06 03:53:16,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:16,981 INFO L89 Accepts]: Start accepts. Operand has 181 places, 407 transitions, 8651 flow [2022-12-06 03:53:16,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:16,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:16,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 407 transitions, 8651 flow [2022-12-06 03:53:16,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 407 transitions, 8651 flow [2022-12-06 03:53:17,090 INFO L130 PetriNetUnfolder]: 259/690 cut-off events. [2022-12-06 03:53:17,090 INFO L131 PetriNetUnfolder]: For 14286/14309 co-relation queries the response was YES. [2022-12-06 03:53:17,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6367 conditions, 690 events. 259/690 cut-off events. For 14286/14309 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 4970 event pairs, 0 based on Foata normal form. 3/690 useless extension candidates. Maximal degree in co-relation 6296. Up to 328 conditions per place. [2022-12-06 03:53:17,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 407 transitions, 8651 flow [2022-12-06 03:53:17,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-06 03:53:17,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:53:17,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-06 03:53:17,245 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 407 transitions, 8681 flow [2022-12-06 03:53:17,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:17,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:17,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:17,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 03:53:17,245 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 733071164, now seen corresponding path program 1 times [2022-12-06 03:53:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:17,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535614145] [2022-12-06 03:53:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:17,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535614145] [2022-12-06 03:53:17,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535614145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:17,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845865193] [2022-12-06 03:53:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:17,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:17,350 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:17,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:53:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:17,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:53:17,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:17,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:17,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845865193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:17,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:17,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540547004] [2022-12-06 03:53:17,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:17,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:17,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:53:17,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 407 transitions, 8681 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:17,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:17,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:53:17,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:20,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:22,136 INFO L130 PetriNetUnfolder]: 1778/3101 cut-off events. [2022-12-06 03:53:22,136 INFO L131 PetriNetUnfolder]: For 124159/124159 co-relation queries the response was YES. [2022-12-06 03:53:22,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24016 conditions, 3101 events. 1778/3101 cut-off events. For 124159/124159 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 20041 event pairs, 174 based on Foata normal form. 70/3157 useless extension candidates. Maximal degree in co-relation 23942. Up to 1699 conditions per place. [2022-12-06 03:53:22,160 INFO L137 encePairwiseOnDemand]: 10/39 looper letters, 266 selfloop transitions, 273 changer transitions 0/539 dead transitions. [2022-12-06 03:53:22,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 539 transitions, 11627 flow [2022-12-06 03:53:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:53:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:53:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 146 transitions. [2022-12-06 03:53:22,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20797720797720798 [2022-12-06 03:53:22,161 INFO L175 Difference]: Start difference. First operand has 181 places, 407 transitions, 8681 flow. Second operand 18 states and 146 transitions. [2022-12-06 03:53:22,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 539 transitions, 11627 flow [2022-12-06 03:53:22,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 539 transitions, 11603 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-06 03:53:22,431 INFO L231 Difference]: Finished difference. Result has 205 places, 474 transitions, 11015 flow [2022-12-06 03:53:22,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=8657, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11015, PETRI_PLACES=205, PETRI_TRANSITIONS=474} [2022-12-06 03:53:22,432 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 187 predicate places. [2022-12-06 03:53:22,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:22,432 INFO L89 Accepts]: Start accepts. Operand has 205 places, 474 transitions, 11015 flow [2022-12-06 03:53:22,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:22,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:22,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 474 transitions, 11015 flow [2022-12-06 03:53:22,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 474 transitions, 11015 flow [2022-12-06 03:53:22,562 INFO L130 PetriNetUnfolder]: 290/784 cut-off events. [2022-12-06 03:53:22,562 INFO L131 PetriNetUnfolder]: For 22445/22470 co-relation queries the response was YES. [2022-12-06 03:53:22,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 784 events. 290/784 cut-off events. For 22445/22470 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 5800 event pairs, 0 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 7812. Up to 388 conditions per place. [2022-12-06 03:53:22,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 474 transitions, 11015 flow [2022-12-06 03:53:22,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 1434 [2022-12-06 03:53:22,574 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:53:22,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 03:53:22,574 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 474 transitions, 11015 flow [2022-12-06 03:53:22,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:22,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:22,575 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:22,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 03:53:22,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 03:53:22,778 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash 731928535, now seen corresponding path program 1 times [2022-12-06 03:53:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:22,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866029146] [2022-12-06 03:53:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:22,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866029146] [2022-12-06 03:53:22,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866029146] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:22,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197907461] [2022-12-06 03:53:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:22,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:22,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:22,935 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:22,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:53:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:23,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:53:23,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:23,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:23,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197907461] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:23,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:23,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248727052] [2022-12-06 03:53:23,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:23,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:23,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:23,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 03:53:23,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 474 transitions, 11015 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:23,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:23,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 03:53:23,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:27,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:28,189 INFO L130 PetriNetUnfolder]: 1822/3193 cut-off events. [2022-12-06 03:53:28,189 INFO L131 PetriNetUnfolder]: For 134132/134132 co-relation queries the response was YES. [2022-12-06 03:53:28,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26263 conditions, 3193 events. 1822/3193 cut-off events. For 134132/134132 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 20834 event pairs, 301 based on Foata normal form. 38/3217 useless extension candidates. Maximal degree in co-relation 26180. Up to 2513 conditions per place. [2022-12-06 03:53:28,213 INFO L137 encePairwiseOnDemand]: 10/39 looper letters, 382 selfloop transitions, 159 changer transitions 3/544 dead transitions. [2022-12-06 03:53:28,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 544 transitions, 12729 flow [2022-12-06 03:53:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 03:53:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 03:53:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-06 03:53:28,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1891025641025641 [2022-12-06 03:53:28,215 INFO L175 Difference]: Start difference. First operand has 205 places, 474 transitions, 11015 flow. Second operand 16 states and 118 transitions. [2022-12-06 03:53:28,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 544 transitions, 12729 flow [2022-12-06 03:53:28,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 544 transitions, 12261 flow, removed 216 selfloop flow, removed 3 redundant places. [2022-12-06 03:53:28,678 INFO L231 Difference]: Finished difference. Result has 222 places, 493 transitions, 11571 flow [2022-12-06 03:53:28,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10547, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11571, PETRI_PLACES=222, PETRI_TRANSITIONS=493} [2022-12-06 03:53:28,678 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 204 predicate places. [2022-12-06 03:53:28,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:28,679 INFO L89 Accepts]: Start accepts. Operand has 222 places, 493 transitions, 11571 flow [2022-12-06 03:53:28,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:28,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:28,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 493 transitions, 11571 flow [2022-12-06 03:53:28,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 493 transitions, 11571 flow [2022-12-06 03:53:28,814 INFO L130 PetriNetUnfolder]: 307/829 cut-off events. [2022-12-06 03:53:28,814 INFO L131 PetriNetUnfolder]: For 26986/27015 co-relation queries the response was YES. [2022-12-06 03:53:28,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8463 conditions, 829 events. 307/829 cut-off events. For 26986/27015 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6207 event pairs, 0 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 8377. Up to 403 conditions per place. [2022-12-06 03:53:28,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 493 transitions, 11571 flow [2022-12-06 03:53:28,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-06 03:53:28,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [367] L705-6-->L695-5: Formula: (and (< v_~x~0_219 17) (= v_~q~0_114 (+ v_~q~0_116 6)) (= v_~next~0_125 v_~cur~0_198) (= (+ 16 v_~x~0_220) v_~x~0_219) (= (* 34 v_~prev~0_233) (+ (* 21 v_~next~0_125) (* 21 v_~cur~0_199) (* v_~prev~0_234 13))) (< v_~q~0_114 8) (= (* v_~next~0_125 13) (+ (* 21 v_~prev~0_234) (* 34 v_~cur~0_199) (* 21 v_~prev~0_233))) (= v_~j~0_197 (+ v_~j~0_199 (* 6 v_~i~0_187)))) InVars {~j~0=v_~j~0_199, ~prev~0=v_~prev~0_234, ~i~0=v_~i~0_187, ~q~0=v_~q~0_116, ~cur~0=v_~cur~0_199, ~x~0=v_~x~0_220} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~j~0=v_~j~0_197, ~next~0=v_~next~0_125, ~prev~0=v_~prev~0_233, ~i~0=v_~i~0_187, ~q~0=v_~q~0_114, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_82|, ~cur~0=v_~cur~0_198, ~x~0=v_~x~0_219} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:53:28,889 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L705-6-->t2EXIT: Formula: (and (= v_~q~0_187 (+ v_~q~0_188 6)) (not (< v_~q~0_187 7)) (< v_~x~0_255 17) (= |v_t2Thread1of1ForFork0_#res.offset_24| 0) (= (+ 16 v_~x~0_256) v_~x~0_255) (= (+ (* 34 v_~cur~0_229) (* 21 v_~prev~0_270) (* 21 v_~prev~0_269)) (* v_~next~0_143 13)) (= v_~j~0_279 (+ v_~j~0_280 (* 6 v_~i~0_235))) (= (* 34 v_~prev~0_269) (+ (* 21 v_~cur~0_229) (* 21 v_~next~0_143) (* v_~prev~0_270 13))) (= |v_t2Thread1of1ForFork0_#res.base_24| 0) (= v_~next~0_143 v_~cur~0_228) (< v_~q~0_187 8)) InVars {~j~0=v_~j~0_280, ~prev~0=v_~prev~0_270, ~i~0=v_~i~0_235, ~q~0=v_~q~0_188, ~cur~0=v_~cur~0_229, ~x~0=v_~x~0_256} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_161|, ~j~0=v_~j~0_279, ~next~0=v_~next~0_143, ~prev~0=v_~prev~0_269, ~i~0=v_~i~0_235, t2Thread1of1ForFork0_#res.base=|v_t2Thread1of1ForFork0_#res.base_24|, ~q~0=v_~q~0_187, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_137|, ~cur~0=v_~cur~0_228, t2Thread1of1ForFork0_#res.offset=|v_t2Thread1of1ForFork0_#res.offset_24|, ~x~0=v_~x~0_255} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, t2Thread1of1ForFork0_#res.base, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, t2Thread1of1ForFork0_#res.offset, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:53:29,085 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L705-6-->L687-5: Formula: (and (< v_~q~0_200 8) (= (+ v_~j~0_297 v_~i~0_238) v_~i~0_237) (= (+ v_~q~0_201 6) v_~q~0_200) (= v_~p~0_126 (+ v_~p~0_127 1)) (= v_~next~0_147 v_~cur~0_234) (= (+ (* 21 v_~prev~0_278) (* 21 v_~prev~0_277) (* 34 v_~cur~0_235)) (* v_~next~0_147 13)) (= v_~j~0_297 (+ v_~j~0_298 (* 6 v_~i~0_238))) (= (* 34 v_~prev~0_277) (+ (* v_~prev~0_278 13) (* 21 v_~next~0_147) (* 21 v_~cur~0_235))) (= (+ 16 v_~x~0_264) v_~x~0_263) (< v_~x~0_263 17) (< v_~p~0_127 7)) InVars {~j~0=v_~j~0_298, ~prev~0=v_~prev~0_278, ~i~0=v_~i~0_238, ~q~0=v_~q~0_201, ~p~0=v_~p~0_127, ~cur~0=v_~cur~0_235, ~x~0=v_~x~0_264} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_167|, ~j~0=v_~j~0_297, ~next~0=v_~next~0_147, ~prev~0=v_~prev~0_277, ~i~0=v_~i~0_237, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_98|, ~q~0=v_~q~0_200, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_148|, ~p~0=v_~p~0_126, ~cur~0=v_~cur~0_234, ~x~0=v_~x~0_263} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:53:29,199 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:53:29,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 521 [2022-12-06 03:53:29,200 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 492 transitions, 11624 flow [2022-12-06 03:53:29,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:29,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:29,200 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:29,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:29,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 03:53:29,404 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -108359877, now seen corresponding path program 1 times [2022-12-06 03:53:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:29,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778358918] [2022-12-06 03:53:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:29,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:29,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778358918] [2022-12-06 03:53:29,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778358918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:29,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777418064] [2022-12-06 03:53:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:29,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:29,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:29,537 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:53:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:29,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:53:29,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:29,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:30,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777418064] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:30,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:30,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785907914] [2022-12-06 03:53:30,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:30,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:30,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:30,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:30,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 03:53:30,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 492 transitions, 11624 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:30,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:30,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 03:53:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:39,718 INFO L130 PetriNetUnfolder]: 2115/3702 cut-off events. [2022-12-06 03:53:39,718 INFO L131 PetriNetUnfolder]: For 173468/173468 co-relation queries the response was YES. [2022-12-06 03:53:39,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31145 conditions, 3702 events. 2115/3702 cut-off events. For 173468/173468 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 24831 event pairs, 150 based on Foata normal form. 32/3720 useless extension candidates. Maximal degree in co-relation 31056. Up to 2067 conditions per place. [2022-12-06 03:53:39,748 INFO L137 encePairwiseOnDemand]: 8/42 looper letters, 332 selfloop transitions, 334 changer transitions 0/666 dead transitions. [2022-12-06 03:53:39,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 666 transitions, 15526 flow [2022-12-06 03:53:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:53:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:53:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 183 transitions. [2022-12-06 03:53:39,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16758241758241757 [2022-12-06 03:53:39,749 INFO L175 Difference]: Start difference. First operand has 221 places, 492 transitions, 11624 flow. Second operand 26 states and 183 transitions. [2022-12-06 03:53:39,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 666 transitions, 15526 flow [2022-12-06 03:53:40,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 666 transitions, 15249 flow, removed 102 selfloop flow, removed 6 redundant places. [2022-12-06 03:53:40,303 INFO L231 Difference]: Finished difference. Result has 250 places, 582 transitions, 14685 flow [2022-12-06 03:53:40,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11351, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=14685, PETRI_PLACES=250, PETRI_TRANSITIONS=582} [2022-12-06 03:53:40,303 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 232 predicate places. [2022-12-06 03:53:40,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:40,304 INFO L89 Accepts]: Start accepts. Operand has 250 places, 582 transitions, 14685 flow [2022-12-06 03:53:40,306 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:40,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:40,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 582 transitions, 14685 flow [2022-12-06 03:53:40,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 582 transitions, 14685 flow [2022-12-06 03:53:40,478 INFO L130 PetriNetUnfolder]: 362/964 cut-off events. [2022-12-06 03:53:40,478 INFO L131 PetriNetUnfolder]: For 38017/38048 co-relation queries the response was YES. [2022-12-06 03:53:40,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10565 conditions, 964 events. 362/964 cut-off events. For 38017/38048 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 7473 event pairs, 0 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 10468. Up to 487 conditions per place. [2022-12-06 03:53:40,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 582 transitions, 14685 flow [2022-12-06 03:53:40,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-06 03:53:40,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:53:40,631 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:53:40,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L687-5-->L687-5: Formula: (and (< v_~p~0_72 6) (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2))) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [389] L705-6-->L687-5: Formula: (and (= (+ v_~p~0_154 1) v_~p~0_153) (< v_~p~0_154 7) (< v_~x~0_281 17) (= v_~next~0_156 v_~cur~0_251) (= (+ 16 v_~x~0_282) v_~x~0_281) (= (+ (* 21 v_~prev~0_295) (* 21 v_~prev~0_296) (* 34 v_~cur~0_252)) (* v_~next~0_156 13)) (= (+ v_~j~0_339 v_~i~0_274) v_~i~0_273) (= (+ (* 21 v_~next~0_156) (* v_~prev~0_296 13) (* 21 v_~cur~0_252)) (* 34 v_~prev~0_295))) InVars {~j~0=v_~j~0_339, ~prev~0=v_~prev~0_296, ~i~0=v_~i~0_274, ~p~0=v_~p~0_154, ~cur~0=v_~cur~0_252, ~x~0=v_~x~0_282} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_177|, ~j~0=v_~j~0_339, ~next~0=v_~next~0_156, ~prev~0=v_~prev~0_295, ~i~0=v_~i~0_273, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_115|, ~p~0=v_~p~0_153, ~cur~0=v_~cur~0_251, ~x~0=v_~x~0_281} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 03:53:40,972 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 03:53:40,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 669 [2022-12-06 03:53:40,972 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 582 transitions, 14825 flow [2022-12-06 03:53:40,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:40,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:40,972 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:40,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:41,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 03:53:41,179 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:41,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash -104688857, now seen corresponding path program 1 times [2022-12-06 03:53:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:41,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929380058] [2022-12-06 03:53:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:41,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:41,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929380058] [2022-12-06 03:53:41,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929380058] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:41,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699053740] [2022-12-06 03:53:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:41,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:41,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:41,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:41,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:53:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:41,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:53:41,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:41,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:41,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699053740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:41,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:41,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:41,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049862205] [2022-12-06 03:53:41,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:41,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:41,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:41,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:41,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:41,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 03:53:41,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 582 transitions, 14825 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:41,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:41,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 03:53:41,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:46,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:47,987 INFO L130 PetriNetUnfolder]: 2233/3944 cut-off events. [2022-12-06 03:53:47,987 INFO L131 PetriNetUnfolder]: For 234152/234152 co-relation queries the response was YES. [2022-12-06 03:53:48,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35207 conditions, 3944 events. 2233/3944 cut-off events. For 234152/234152 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27098 event pairs, 349 based on Foata normal form. 46/3970 useless extension candidates. Maximal degree in co-relation 35107. Up to 2753 conditions per place. [2022-12-06 03:53:48,021 INFO L137 encePairwiseOnDemand]: 8/48 looper letters, 413 selfloop transitions, 284 changer transitions 2/699 dead transitions. [2022-12-06 03:53:48,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 699 transitions, 17759 flow [2022-12-06 03:53:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:53:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:53:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 142 transitions. [2022-12-06 03:53:48,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14087301587301587 [2022-12-06 03:53:48,024 INFO L175 Difference]: Start difference. First operand has 250 places, 582 transitions, 14825 flow. Second operand 21 states and 142 transitions. [2022-12-06 03:53:48,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 699 transitions, 17759 flow [2022-12-06 03:53:48,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 699 transitions, 16901 flow, removed 341 selfloop flow, removed 14 redundant places. [2022-12-06 03:53:48,858 INFO L231 Difference]: Finished difference. Result has 263 places, 636 transitions, 16296 flow [2022-12-06 03:53:48,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13977, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=16296, PETRI_PLACES=263, PETRI_TRANSITIONS=636} [2022-12-06 03:53:48,859 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 245 predicate places. [2022-12-06 03:53:48,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:53:48,859 INFO L89 Accepts]: Start accepts. Operand has 263 places, 636 transitions, 16296 flow [2022-12-06 03:53:48,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:53:48,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:53:48,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 636 transitions, 16296 flow [2022-12-06 03:53:48,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 636 transitions, 16296 flow [2022-12-06 03:53:49,028 INFO L130 PetriNetUnfolder]: 396/1065 cut-off events. [2022-12-06 03:53:49,029 INFO L131 PetriNetUnfolder]: For 47381/47463 co-relation queries the response was YES. [2022-12-06 03:53:49,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11875 conditions, 1065 events. 396/1065 cut-off events. For 47381/47463 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 8423 event pairs, 0 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 11773. Up to 546 conditions per place. [2022-12-06 03:53:49,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 636 transitions, 16296 flow [2022-12-06 03:53:49,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 1808 [2022-12-06 03:53:49,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L705-6-->L695-5: Formula: (and (= v_~i~0_251 (+ v_~j~0_325 (* 7 v_~i~0_252))) (= v_~q~0_226 (+ 7 v_~q~0_228)) (= (+ (* 21 v_~cur~0_243) (* 21 v_~next~0_151) (* v_~prev~0_286 13)) (* 34 v_~prev~0_285)) (= (* 2 v_~i~0_251) (+ v_~j~0_323 v_~i~0_252)) (= (* v_~next~0_151 13) (+ (* 21 v_~prev~0_285) (* 21 v_~prev~0_286) (* 34 v_~cur~0_243))) (= v_~x~0_271 (+ 16 v_~x~0_272)) (< v_~p~0_135 7) (< v_~q~0_226 8) (= v_~next~0_151 v_~cur~0_242) (= v_~p~0_134 (+ v_~p~0_135 1)) (< v_~x~0_271 17)) InVars {~j~0=v_~j~0_325, ~prev~0=v_~prev~0_286, ~i~0=v_~i~0_252, ~q~0=v_~q~0_228, ~p~0=v_~p~0_135, ~cur~0=v_~cur~0_243, ~x~0=v_~x~0_272} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_171|, ~j~0=v_~j~0_323, ~next~0=v_~next~0_151, ~prev~0=v_~prev~0_285, ~i~0=v_~i~0_251, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_102|, ~q~0=v_~q~0_226, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_164|, ~p~0=v_~p~0_134, ~cur~0=v_~cur~0_242, ~x~0=v_~x~0_271} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:53:49,443 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:53:49,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 585 [2022-12-06 03:53:49,444 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 635 transitions, 16329 flow [2022-12-06 03:53:49,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:49,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:53:49,444 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:53:49,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:53:49,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:49,649 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:53:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:53:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -94120337, now seen corresponding path program 1 times [2022-12-06 03:53:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:53:49,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857764008] [2022-12-06 03:53:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:53:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:49,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:53:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857764008] [2022-12-06 03:53:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857764008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:53:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481410262] [2022-12-06 03:53:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:53:49,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:53:49,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:53:49,754 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:53:49,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 03:53:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:53:49,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:53:49,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:53:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:49,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:53:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:53:50,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481410262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:53:50,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:53:50,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:53:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120666014] [2022-12-06 03:53:50,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:53:50,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:53:50,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:53:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:53:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:53:50,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 03:53:50,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 635 transitions, 16329 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:53:50,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:53:50,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 03:53:50,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:53:57,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:53:59,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:03,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:05,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:06,990 INFO L130 PetriNetUnfolder]: 2539/4482 cut-off events. [2022-12-06 03:54:06,990 INFO L131 PetriNetUnfolder]: For 281306/281306 co-relation queries the response was YES. [2022-12-06 03:54:07,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40851 conditions, 4482 events. 2539/4482 cut-off events. For 281306/281306 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 31500 event pairs, 235 based on Foata normal form. 36/4504 useless extension candidates. Maximal degree in co-relation 40746. Up to 2457 conditions per place. [2022-12-06 03:54:07,034 INFO L137 encePairwiseOnDemand]: 8/51 looper letters, 391 selfloop transitions, 423 changer transitions 1/815 dead transitions. [2022-12-06 03:54:07,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 815 transitions, 20962 flow [2022-12-06 03:54:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 03:54:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 03:54:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-12-06 03:54:07,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14950980392156862 [2022-12-06 03:54:07,035 INFO L175 Difference]: Start difference. First operand has 261 places, 635 transitions, 16329 flow. Second operand 24 states and 183 transitions. [2022-12-06 03:54:07,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 815 transitions, 20962 flow [2022-12-06 03:54:08,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 815 transitions, 20474 flow, removed 197 selfloop flow, removed 8 redundant places. [2022-12-06 03:54:08,136 INFO L231 Difference]: Finished difference. Result has 286 places, 733 transitions, 19860 flow [2022-12-06 03:54:08,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=15897, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=19860, PETRI_PLACES=286, PETRI_TRANSITIONS=733} [2022-12-06 03:54:08,137 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 268 predicate places. [2022-12-06 03:54:08,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:08,138 INFO L89 Accepts]: Start accepts. Operand has 286 places, 733 transitions, 19860 flow [2022-12-06 03:54:08,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:08,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:08,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 733 transitions, 19860 flow [2022-12-06 03:54:08,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 733 transitions, 19860 flow [2022-12-06 03:54:08,414 INFO L130 PetriNetUnfolder]: 453/1214 cut-off events. [2022-12-06 03:54:08,414 INFO L131 PetriNetUnfolder]: For 62828/62901 co-relation queries the response was YES. [2022-12-06 03:54:08,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14348 conditions, 1214 events. 453/1214 cut-off events. For 62828/62901 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 9878 event pairs, 1 based on Foata normal form. 0/1211 useless extension candidates. Maximal degree in co-relation 14236. Up to 652 conditions per place. [2022-12-06 03:54:08,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 733 transitions, 19860 flow [2022-12-06 03:54:08,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 2058 [2022-12-06 03:54:08,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:54:08,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} 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_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 03:54:08,637 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L695-5-->L695-5: Formula: (and (= v_~q~0_154 (+ 2 v_~q~0_156)) (< v_~q~0_156 6) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [402] L705-6-->L695-5: Formula: (and (< v_~q~0_266 7) (= v_~next~0_172 v_~cur~0_281) (= v_~j~0_385 (+ v_~j~0_386 v_~i~0_345)) (= (+ (* 21 v_~cur~0_282) (* 21 v_~next~0_172) (* v_~prev~0_328 13)) (* 34 v_~prev~0_327)) (= v_~q~0_265 (+ v_~q~0_266 1)) (= (+ 16 v_~x~0_314) v_~x~0_313) (= (* v_~next~0_172 13) (+ (* 21 v_~prev~0_327) (* 21 v_~prev~0_328) (* 34 v_~cur~0_282))) (< v_~x~0_313 17)) InVars {~j~0=v_~j~0_386, ~prev~0=v_~prev~0_328, ~i~0=v_~i~0_345, ~q~0=v_~q~0_266, ~cur~0=v_~cur~0_282, ~x~0=v_~x~0_314} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_195|, ~j~0=v_~j~0_385, ~next~0=v_~next~0_172, ~prev~0=v_~prev~0_327, ~i~0=v_~i~0_345, ~q~0=v_~q~0_265, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_191|, ~cur~0=v_~cur~0_281, ~x~0=v_~x~0_313} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 03:54:08,720 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:54:08,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 584 [2022-12-06 03:54:08,721 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 733 transitions, 19880 flow [2022-12-06 03:54:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:08,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:08,721 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:08,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 03:54:08,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 03:54:08,925 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash 69192206, now seen corresponding path program 1 times [2022-12-06 03:54:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:08,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198661136] [2022-12-06 03:54:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:08,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198661136] [2022-12-06 03:54:08,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198661136] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:08,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905078036] [2022-12-06 03:54:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:08,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:08,951 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:08,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 03:54:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:09,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 03:54:09,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:09,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:54:09,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905078036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:54:09,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:54:09,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 03:54:09,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207425271] [2022-12-06 03:54:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:54:09,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:54:09,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:09,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:54:09,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:54:09,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 03:54:09,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 733 transitions, 19880 flow. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:09,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:09,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 03:54:09,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:10,332 INFO L130 PetriNetUnfolder]: 2541/4486 cut-off events. [2022-12-06 03:54:10,332 INFO L131 PetriNetUnfolder]: For 272914/272914 co-relation queries the response was YES. [2022-12-06 03:54:10,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43229 conditions, 4486 events. 2541/4486 cut-off events. For 272914/272914 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 33193 event pairs, 523 based on Foata normal form. 8/4474 useless extension candidates. Maximal degree in co-relation 43114. Up to 2385 conditions per place. [2022-12-06 03:54:10,377 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 1101 selfloop transitions, 3 changer transitions 21/1125 dead transitions. [2022-12-06 03:54:10,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1125 transitions, 32706 flow [2022-12-06 03:54:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:54:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:54:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 03:54:10,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 03:54:10,378 INFO L175 Difference]: Start difference. First operand has 286 places, 733 transitions, 19880 flow. Second operand 4 states and 84 transitions. [2022-12-06 03:54:10,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1125 transitions, 32706 flow [2022-12-06 03:54:11,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1125 transitions, 31725 flow, removed 441 selfloop flow, removed 7 redundant places. [2022-12-06 03:54:11,532 INFO L231 Difference]: Finished difference. Result has 284 places, 730 transitions, 19155 flow [2022-12-06 03:54:11,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=19154, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=19155, PETRI_PLACES=284, PETRI_TRANSITIONS=730} [2022-12-06 03:54:11,533 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 266 predicate places. [2022-12-06 03:54:11,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:11,533 INFO L89 Accepts]: Start accepts. Operand has 284 places, 730 transitions, 19155 flow [2022-12-06 03:54:11,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:11,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:11,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 730 transitions, 19155 flow [2022-12-06 03:54:11,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 283 places, 730 transitions, 19155 flow [2022-12-06 03:54:11,799 INFO L130 PetriNetUnfolder]: 451/1214 cut-off events. [2022-12-06 03:54:11,800 INFO L131 PetriNetUnfolder]: For 64436/64497 co-relation queries the response was YES. [2022-12-06 03:54:11,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14472 conditions, 1214 events. 451/1214 cut-off events. For 64436/64497 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 10026 event pairs, 1 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 14358. Up to 646 conditions per place. [2022-12-06 03:54:11,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 283 places, 730 transitions, 19155 flow [2022-12-06 03:54:11,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 2056 [2022-12-06 03:54:11,821 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:11,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-06 03:54:11,822 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 730 transitions, 19155 flow [2022-12-06 03:54:11,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:11,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:11,822 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:11,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-06 03:54:12,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:12,026 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash 551449812, now seen corresponding path program 1 times [2022-12-06 03:54:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:12,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469899790] [2022-12-06 03:54:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:12,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469899790] [2022-12-06 03:54:12,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469899790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:12,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269571741] [2022-12-06 03:54:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:12,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:12,182 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:12,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 03:54:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:12,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:54:12,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:12,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:12,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269571741] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:12,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:12,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:54:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539419734] [2022-12-06 03:54:12,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:12,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:54:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:54:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:54:12,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 03:54:12,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 730 transitions, 19155 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:12,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:12,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 03:54:12,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:18,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:20,610 INFO L130 PetriNetUnfolder]: 2600/4607 cut-off events. [2022-12-06 03:54:20,610 INFO L131 PetriNetUnfolder]: For 309072/309072 co-relation queries the response was YES. [2022-12-06 03:54:20,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45340 conditions, 4607 events. 2600/4607 cut-off events. For 309072/309072 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 32953 event pairs, 465 based on Foata normal form. 26/4613 useless extension candidates. Maximal degree in co-relation 45223. Up to 3618 conditions per place. [2022-12-06 03:54:20,654 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 567 selfloop transitions, 241 changer transitions 3/811 dead transitions. [2022-12-06 03:54:20,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 811 transitions, 21950 flow [2022-12-06 03:54:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:54:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:54:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-12-06 03:54:20,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15555555555555556 [2022-12-06 03:54:20,656 INFO L175 Difference]: Start difference. First operand has 283 places, 730 transitions, 19155 flow. Second operand 15 states and 126 transitions. [2022-12-06 03:54:20,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 811 transitions, 21950 flow [2022-12-06 03:54:21,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 811 transitions, 21949 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 03:54:21,997 INFO L231 Difference]: Finished difference. Result has 300 places, 763 transitions, 20923 flow [2022-12-06 03:54:21,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=19154, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20923, PETRI_PLACES=300, PETRI_TRANSITIONS=763} [2022-12-06 03:54:21,998 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 282 predicate places. [2022-12-06 03:54:21,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:21,998 INFO L89 Accepts]: Start accepts. Operand has 300 places, 763 transitions, 20923 flow [2022-12-06 03:54:22,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:22,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:22,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 300 places, 763 transitions, 20923 flow [2022-12-06 03:54:22,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 763 transitions, 20923 flow [2022-12-06 03:54:22,238 INFO L130 PetriNetUnfolder]: 468/1262 cut-off events. [2022-12-06 03:54:22,238 INFO L131 PetriNetUnfolder]: For 68355/68478 co-relation queries the response was YES. [2022-12-06 03:54:22,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15441 conditions, 1262 events. 468/1262 cut-off events. For 68355/68478 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 10505 event pairs, 1 based on Foata normal form. 0/1258 useless extension candidates. Maximal degree in co-relation 15322. Up to 680 conditions per place. [2022-12-06 03:54:22,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 763 transitions, 20923 flow [2022-12-06 03:54:22,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 2120 [2022-12-06 03:54:22,262 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:54:22,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 03:54:22,263 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 763 transitions, 20923 flow [2022-12-06 03:54:22,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:22,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:22,263 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:22,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 03:54:22,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 03:54:22,469 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash -91062435, now seen corresponding path program 1 times [2022-12-06 03:54:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:22,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119946492] [2022-12-06 03:54:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119946492] [2022-12-06 03:54:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119946492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977606069] [2022-12-06 03:54:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:22,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:22,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:22,581 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:22,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 03:54:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:22,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:54:22,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:22,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:22,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977606069] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:22,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:22,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:54:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877523632] [2022-12-06 03:54:22,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:22,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:54:22,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:54:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:54:22,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 03:54:22,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 763 transitions, 20923 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:22,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:22,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 03:54:22,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:29,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:32,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:36,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:38,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:40,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:42,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:44,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:45,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:47,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:49,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:54:50,770 INFO L130 PetriNetUnfolder]: 2708/4823 cut-off events. [2022-12-06 03:54:50,771 INFO L131 PetriNetUnfolder]: For 377340/377340 co-relation queries the response was YES. [2022-12-06 03:54:50,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48998 conditions, 4823 events. 2708/4823 cut-off events. For 377340/377340 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 34809 event pairs, 308 based on Foata normal form. 36/4839 useless extension candidates. Maximal degree in co-relation 48876. Up to 2897 conditions per place. [2022-12-06 03:54:50,823 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 444 selfloop transitions, 454 changer transitions 1/899 dead transitions. [2022-12-06 03:54:50,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 899 transitions, 24991 flow [2022-12-06 03:54:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 03:54:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 03:54:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 177 transitions. [2022-12-06 03:54:50,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13657407407407407 [2022-12-06 03:54:50,824 INFO L175 Difference]: Start difference. First operand has 300 places, 763 transitions, 20923 flow. Second operand 24 states and 177 transitions. [2022-12-06 03:54:50,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 899 transitions, 24991 flow [2022-12-06 03:54:52,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 899 transitions, 24763 flow, removed 60 selfloop flow, removed 7 redundant places. [2022-12-06 03:54:52,263 INFO L231 Difference]: Finished difference. Result has 325 places, 823 transitions, 24156 flow [2022-12-06 03:54:52,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=20699, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=24156, PETRI_PLACES=325, PETRI_TRANSITIONS=823} [2022-12-06 03:54:52,264 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 307 predicate places. [2022-12-06 03:54:52,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:54:52,264 INFO L89 Accepts]: Start accepts. Operand has 325 places, 823 transitions, 24156 flow [2022-12-06 03:54:52,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:54:52,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:54:52,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 325 places, 823 transitions, 24156 flow [2022-12-06 03:54:52,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 823 transitions, 24156 flow [2022-12-06 03:54:52,559 INFO L130 PetriNetUnfolder]: 496/1340 cut-off events. [2022-12-06 03:54:52,559 INFO L131 PetriNetUnfolder]: For 83807/83912 co-relation queries the response was YES. [2022-12-06 03:54:52,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17362 conditions, 1340 events. 496/1340 cut-off events. For 83807/83912 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 11312 event pairs, 1 based on Foata normal form. 0/1336 useless extension candidates. Maximal degree in co-relation 17233. Up to 734 conditions per place. [2022-12-06 03:54:52,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 823 transitions, 24156 flow [2022-12-06 03:54:52,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 2238 [2022-12-06 03:54:52,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:54:52,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-06 03:54:52,615 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 823 transitions, 24169 flow [2022-12-06 03:54:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:54:52,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:54:52,616 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:54:52,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 03:54:52,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:52,820 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:54:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:54:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1812255743, now seen corresponding path program 1 times [2022-12-06 03:54:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:54:52,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784052733] [2022-12-06 03:54:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:54:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:54:52,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784052733] [2022-12-06 03:54:52,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784052733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:54:52,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379787243] [2022-12-06 03:54:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:54:52,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:54:52,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:54:52,960 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:54:52,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 03:54:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:54:53,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:54:53,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:54:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:53,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:54:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:54:53,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379787243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:54:53,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:54:53,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:54:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11279385] [2022-12-06 03:54:53,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:54:53,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:54:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:54:53,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:54:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:54:53,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 03:54:53,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 823 transitions, 24169 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 03:54:53,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:54:53,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 03:54:53,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:54:59,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:02,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:05,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:07,218 INFO L130 PetriNetUnfolder]: 2842/5085 cut-off events. [2022-12-06 03:55:07,218 INFO L131 PetriNetUnfolder]: For 442212/442212 co-relation queries the response was YES. [2022-12-06 03:55:07,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53927 conditions, 5085 events. 2842/5085 cut-off events. For 442212/442212 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 37179 event pairs, 271 based on Foata normal form. 40/5105 useless extension candidates. Maximal degree in co-relation 53795. Up to 2950 conditions per place. [2022-12-06 03:55:07,275 INFO L137 encePairwiseOnDemand]: 8/55 looper letters, 475 selfloop transitions, 496 changer transitions 0/971 dead transitions. [2022-12-06 03:55:07,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 971 transitions, 28716 flow [2022-12-06 03:55:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 03:55:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 03:55:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 188 transitions. [2022-12-06 03:55:07,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14242424242424243 [2022-12-06 03:55:07,280 INFO L175 Difference]: Start difference. First operand has 325 places, 823 transitions, 24169 flow. Second operand 24 states and 188 transitions. [2022-12-06 03:55:07,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 971 transitions, 28716 flow [2022-12-06 03:55:09,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 971 transitions, 28003 flow, removed 307 selfloop flow, removed 7 redundant places. [2022-12-06 03:55:09,283 INFO L231 Difference]: Finished difference. Result has 350 places, 885 transitions, 27095 flow [2022-12-06 03:55:09,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=23460, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=823, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=27095, PETRI_PLACES=350, PETRI_TRANSITIONS=885} [2022-12-06 03:55:09,284 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 332 predicate places. [2022-12-06 03:55:09,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:09,284 INFO L89 Accepts]: Start accepts. Operand has 350 places, 885 transitions, 27095 flow [2022-12-06 03:55:09,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:09,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:09,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 885 transitions, 27095 flow [2022-12-06 03:55:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 885 transitions, 27095 flow [2022-12-06 03:55:09,612 INFO L130 PetriNetUnfolder]: 526/1426 cut-off events. [2022-12-06 03:55:09,612 INFO L131 PetriNetUnfolder]: For 95124/95218 co-relation queries the response was YES. [2022-12-06 03:55:09,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19202 conditions, 1426 events. 526/1426 cut-off events. For 95124/95218 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 12231 event pairs, 0 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 19063. Up to 786 conditions per place. [2022-12-06 03:55:09,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 885 transitions, 27095 flow [2022-12-06 03:55:09,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 2380 [2022-12-06 03:55:09,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:55:09,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 398 [2022-12-06 03:55:09,682 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 885 transitions, 27111 flow [2022-12-06 03:55:09,683 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 03:55:09,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:09,683 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:09,687 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 03:55:09,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:09,887 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1861433957, now seen corresponding path program 1 times [2022-12-06 03:55:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:09,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402793593] [2022-12-06 03:55:09,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402793593] [2022-12-06 03:55:09,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402793593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504914816] [2022-12-06 03:55:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:09,932 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:09,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 03:55:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:10,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:55:10,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:10,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:55:10,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504914816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:55:10,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:55:10,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 03:55:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755163797] [2022-12-06 03:55:10,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:55:10,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:55:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:55:10,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:55:10,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:55:10,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 885 transitions, 27111 flow. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:10,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:10,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:55:10,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:11,919 INFO L130 PetriNetUnfolder]: 2980/5277 cut-off events. [2022-12-06 03:55:11,919 INFO L131 PetriNetUnfolder]: For 429337/429337 co-relation queries the response was YES. [2022-12-06 03:55:11,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58497 conditions, 5277 events. 2980/5277 cut-off events. For 429337/429337 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 40483 event pairs, 533 based on Foata normal form. 44/5301 useless extension candidates. Maximal degree in co-relation 58355. Up to 2544 conditions per place. [2022-12-06 03:55:11,985 INFO L137 encePairwiseOnDemand]: 46/56 looper letters, 1366 selfloop transitions, 24 changer transitions 20/1410 dead transitions. [2022-12-06 03:55:11,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1410 transitions, 46347 flow [2022-12-06 03:55:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:55:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:55:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 03:55:11,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31845238095238093 [2022-12-06 03:55:11,986 INFO L175 Difference]: Start difference. First operand has 350 places, 885 transitions, 27111 flow. Second operand 6 states and 107 transitions. [2022-12-06 03:55:11,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 1410 transitions, 46347 flow [2022-12-06 03:55:14,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 1410 transitions, 44390 flow, removed 883 selfloop flow, removed 7 redundant places. [2022-12-06 03:55:14,179 INFO L231 Difference]: Finished difference. Result has 350 places, 886 transitions, 26224 flow [2022-12-06 03:55:14,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=25709, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=26224, PETRI_PLACES=350, PETRI_TRANSITIONS=886} [2022-12-06 03:55:14,180 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 332 predicate places. [2022-12-06 03:55:14,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:14,180 INFO L89 Accepts]: Start accepts. Operand has 350 places, 886 transitions, 26224 flow [2022-12-06 03:55:14,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:14,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:14,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 886 transitions, 26224 flow [2022-12-06 03:55:14,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 886 transitions, 26224 flow [2022-12-06 03:55:14,523 INFO L130 PetriNetUnfolder]: 569/1529 cut-off events. [2022-12-06 03:55:14,523 INFO L131 PetriNetUnfolder]: For 107528/107600 co-relation queries the response was YES. [2022-12-06 03:55:14,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20513 conditions, 1529 events. 569/1529 cut-off events. For 107528/107600 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 13196 event pairs, 0 based on Foata normal form. 11/1536 useless extension candidates. Maximal degree in co-relation 20373. Up to 845 conditions per place. [2022-12-06 03:55:14,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 886 transitions, 26224 flow [2022-12-06 03:55:14,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 2468 [2022-12-06 03:55:14,599 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:55:14,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-06 03:55:14,599 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 886 transitions, 26224 flow [2022-12-06 03:55:14,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:14,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:14,600 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:14,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-06 03:55:14,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:14,800 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash -80676567, now seen corresponding path program 1 times [2022-12-06 03:55:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:14,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134220697] [2022-12-06 03:55:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:14,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:14,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134220697] [2022-12-06 03:55:14,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134220697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:14,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103419776] [2022-12-06 03:55:14,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:14,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:14,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:14,906 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:14,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 03:55:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:14,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:55:14,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:15,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:15,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103419776] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:15,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:15,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:55:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111516884] [2022-12-06 03:55:15,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:15,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:55:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:55:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:55:15,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:55:15,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 886 transitions, 26224 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:15,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:15,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:55:15,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:18,654 INFO L130 PetriNetUnfolder]: 3334/5901 cut-off events. [2022-12-06 03:55:18,654 INFO L131 PetriNetUnfolder]: For 513569/513569 co-relation queries the response was YES. [2022-12-06 03:55:18,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65347 conditions, 5901 events. 3334/5901 cut-off events. For 513569/513569 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 43714 event pairs, 85 based on Foata normal form. 38/5919 useless extension candidates. Maximal degree in co-relation 65204. Up to 2265 conditions per place. [2022-12-06 03:55:18,765 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 292 selfloop transitions, 813 changer transitions 0/1105 dead transitions. [2022-12-06 03:55:18,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 1105 transitions, 33281 flow [2022-12-06 03:55:18,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 03:55:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 03:55:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 176 transitions. [2022-12-06 03:55:18,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16541353383458646 [2022-12-06 03:55:18,778 INFO L175 Difference]: Start difference. First operand has 350 places, 886 transitions, 26224 flow. Second operand 19 states and 176 transitions. [2022-12-06 03:55:18,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 1105 transitions, 33281 flow [2022-12-06 03:55:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1105 transitions, 33205 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-06 03:55:21,517 INFO L231 Difference]: Finished difference. Result has 372 places, 1007 transitions, 32952 flow [2022-12-06 03:55:21,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=26162, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=718, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=32952, PETRI_PLACES=372, PETRI_TRANSITIONS=1007} [2022-12-06 03:55:21,518 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 354 predicate places. [2022-12-06 03:55:21,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:21,519 INFO L89 Accepts]: Start accepts. Operand has 372 places, 1007 transitions, 32952 flow [2022-12-06 03:55:21,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:21,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:21,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 1007 transitions, 32952 flow [2022-12-06 03:55:21,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 1007 transitions, 32952 flow [2022-12-06 03:55:22,003 INFO L130 PetriNetUnfolder]: 621/1691 cut-off events. [2022-12-06 03:55:22,003 INFO L131 PetriNetUnfolder]: For 122942/123020 co-relation queries the response was YES. [2022-12-06 03:55:22,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24490 conditions, 1691 events. 621/1691 cut-off events. For 122942/123020 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 15210 event pairs, 0 based on Foata normal form. 13/1700 useless extension candidates. Maximal degree in co-relation 24344. Up to 956 conditions per place. [2022-12-06 03:55:22,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 1007 transitions, 32952 flow [2022-12-06 03:55:22,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 2778 [2022-12-06 03:55:22,046 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:55:22,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 528 [2022-12-06 03:55:22,047 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 1007 transitions, 32952 flow [2022-12-06 03:55:22,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:22,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:22,047 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:22,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:22,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 03:55:22,249 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash -84001968, now seen corresponding path program 1 times [2022-12-06 03:55:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:22,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797031796] [2022-12-06 03:55:22,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:22,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797031796] [2022-12-06 03:55:22,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797031796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:22,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337421276] [2022-12-06 03:55:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:22,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:22,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:22,354 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:22,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 03:55:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:22,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:55:22,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:22,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337421276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:22,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:22,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:55:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384880595] [2022-12-06 03:55:22,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:22,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:55:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:22,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:55:22,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:55:22,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:55:22,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 1007 transitions, 32952 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:22,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:22,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:55:22,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:25,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:29,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:55:31,941 INFO L130 PetriNetUnfolder]: 3506/6237 cut-off events. [2022-12-06 03:55:31,942 INFO L131 PetriNetUnfolder]: For 676301/676301 co-relation queries the response was YES. [2022-12-06 03:55:31,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73532 conditions, 6237 events. 3506/6237 cut-off events. For 676301/676301 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 47164 event pairs, 652 based on Foata normal form. 64/6281 useless extension candidates. Maximal degree in co-relation 73383. Up to 4608 conditions per place. [2022-12-06 03:55:32,017 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 777 selfloop transitions, 381 changer transitions 5/1163 dead transitions. [2022-12-06 03:55:32,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1163 transitions, 38328 flow [2022-12-06 03:55:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:55:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:55:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 151 transitions. [2022-12-06 03:55:32,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13482142857142856 [2022-12-06 03:55:32,018 INFO L175 Difference]: Start difference. First operand has 372 places, 1007 transitions, 32952 flow. Second operand 20 states and 151 transitions. [2022-12-06 03:55:32,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 1163 transitions, 38328 flow [2022-12-06 03:55:35,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1163 transitions, 36819 flow, removed 642 selfloop flow, removed 12 redundant places. [2022-12-06 03:55:35,544 INFO L231 Difference]: Finished difference. Result has 384 places, 1073 transitions, 35282 flow [2022-12-06 03:55:35,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=31535, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=35282, PETRI_PLACES=384, PETRI_TRANSITIONS=1073} [2022-12-06 03:55:35,545 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 366 predicate places. [2022-12-06 03:55:35,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:35,545 INFO L89 Accepts]: Start accepts. Operand has 384 places, 1073 transitions, 35282 flow [2022-12-06 03:55:35,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:35,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:35,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 1073 transitions, 35282 flow [2022-12-06 03:55:35,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 384 places, 1073 transitions, 35282 flow [2022-12-06 03:55:36,061 INFO L130 PetriNetUnfolder]: 670/1829 cut-off events. [2022-12-06 03:55:36,061 INFO L131 PetriNetUnfolder]: For 126533/126633 co-relation queries the response was YES. [2022-12-06 03:55:36,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26368 conditions, 1829 events. 670/1829 cut-off events. For 126533/126633 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 16642 event pairs, 0 based on Foata normal form. 15/1840 useless extension candidates. Maximal degree in co-relation 26222. Up to 1046 conditions per place. [2022-12-06 03:55:36,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 1073 transitions, 35282 flow [2022-12-06 03:55:36,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 2930 [2022-12-06 03:55:36,255 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:55:36,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 711 [2022-12-06 03:55:36,256 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 1072 transitions, 35265 flow [2022-12-06 03:55:36,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:36,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:36,256 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:36,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:36,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 03:55:36,460 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 551765578, now seen corresponding path program 1 times [2022-12-06 03:55:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:36,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619531423] [2022-12-06 03:55:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:36,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:36,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619531423] [2022-12-06 03:55:36,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619531423] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:36,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480827261] [2022-12-06 03:55:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:36,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:36,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:36,561 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:36,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 03:55:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:36,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:55:36,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:36,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:55:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:36,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480827261] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:55:36,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:55:36,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 03:55:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591492009] [2022-12-06 03:55:36,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:55:36,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:55:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:55:36,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:55:36,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 03:55:36,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1072 transitions, 35265 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:36,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:36,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 03:55:36,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:39,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 [1] [2022-12-06 03:55:43,758 INFO L130 PetriNetUnfolder]: 3562/6361 cut-off events. [2022-12-06 03:55:43,758 INFO L131 PetriNetUnfolder]: For 559071/559071 co-relation queries the response was YES. [2022-12-06 03:55:43,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74295 conditions, 6361 events. 3562/6361 cut-off events. For 559071/559071 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 48466 event pairs, 654 based on Foata normal form. 28/6369 useless extension candidates. Maximal degree in co-relation 74146. Up to 4852 conditions per place. [2022-12-06 03:55:43,838 INFO L137 encePairwiseOnDemand]: 8/57 looper letters, 769 selfloop transitions, 385 changer transitions 0/1154 dead transitions. [2022-12-06 03:55:43,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1154 transitions, 38866 flow [2022-12-06 03:55:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:55:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:55:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-12-06 03:55:43,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19649122807017544 [2022-12-06 03:55:43,840 INFO L175 Difference]: Start difference. First operand has 383 places, 1072 transitions, 35265 flow. Second operand 10 states and 112 transitions. [2022-12-06 03:55:43,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1154 transitions, 38866 flow [2022-12-06 03:55:46,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1154 transitions, 38490 flow, removed 142 selfloop flow, removed 7 redundant places. [2022-12-06 03:55:47,003 INFO L231 Difference]: Finished difference. Result has 389 places, 1101 transitions, 37211 flow [2022-12-06 03:55:47,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=34893, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=37211, PETRI_PLACES=389, PETRI_TRANSITIONS=1101} [2022-12-06 03:55:47,004 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 371 predicate places. [2022-12-06 03:55:47,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:47,004 INFO L89 Accepts]: Start accepts. Operand has 389 places, 1101 transitions, 37211 flow [2022-12-06 03:55:47,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:47,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:47,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 1101 transitions, 37211 flow [2022-12-06 03:55:47,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 1101 transitions, 37211 flow [2022-12-06 03:55:47,521 INFO L130 PetriNetUnfolder]: 690/1882 cut-off events. [2022-12-06 03:55:47,521 INFO L131 PetriNetUnfolder]: For 139106/139215 co-relation queries the response was YES. [2022-12-06 03:55:47,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27769 conditions, 1882 events. 690/1882 cut-off events. For 139106/139215 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 17088 event pairs, 0 based on Foata normal form. 15/1893 useless extension candidates. Maximal degree in co-relation 27618. Up to 1082 conditions per place. [2022-12-06 03:55:47,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 1101 transitions, 37211 flow [2022-12-06 03:55:47,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 2974 [2022-12-06 03:55:47,584 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:55:47,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 581 [2022-12-06 03:55:47,585 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 1101 transitions, 37211 flow [2022-12-06 03:55:47,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:47,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:47,585 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:47,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 03:55:47,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:47,786 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2040903103, now seen corresponding path program 1 times [2022-12-06 03:55:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:47,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201952703] [2022-12-06 03:55:47,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:47,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201952703] [2022-12-06 03:55:47,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201952703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:47,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673840364] [2022-12-06 03:55:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:47,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:47,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:47,820 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:47,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 03:55:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:47,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 03:55:47,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:47,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:55:47,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673840364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:55:47,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:55:47,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 03:55:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208652471] [2022-12-06 03:55:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:55:47,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:55:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:55:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:55:47,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 03:55:47,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 1101 transitions, 37211 flow. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:47,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:47,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 03:55:47,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:50,713 INFO L130 PetriNetUnfolder]: 3862/6807 cut-off events. [2022-12-06 03:55:50,713 INFO L131 PetriNetUnfolder]: For 633146/633146 co-relation queries the response was YES. [2022-12-06 03:55:50,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82466 conditions, 6807 events. 3862/6807 cut-off events. For 633146/633146 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 52132 event pairs, 693 based on Foata normal form. 88/6875 useless extension candidates. Maximal degree in co-relation 82312. Up to 3341 conditions per place. [2022-12-06 03:55:50,804 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 1607 selfloop transitions, 78 changer transitions 10/1695 dead transitions. [2022-12-06 03:55:50,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1695 transitions, 60973 flow [2022-12-06 03:55:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:55:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:55:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-06 03:55:50,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24853801169590642 [2022-12-06 03:55:50,805 INFO L175 Difference]: Start difference. First operand has 389 places, 1101 transitions, 37211 flow. Second operand 6 states and 85 transitions. [2022-12-06 03:55:50,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1695 transitions, 60973 flow [2022-12-06 03:55:54,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 1695 transitions, 60871 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 03:55:54,814 INFO L231 Difference]: Finished difference. Result has 395 places, 1124 transitions, 38401 flow [2022-12-06 03:55:54,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=36729, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=38401, PETRI_PLACES=395, PETRI_TRANSITIONS=1124} [2022-12-06 03:55:54,815 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 377 predicate places. [2022-12-06 03:55:54,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:55:54,815 INFO L89 Accepts]: Start accepts. Operand has 395 places, 1124 transitions, 38401 flow [2022-12-06 03:55:54,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:55:54,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:55:54,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 395 places, 1124 transitions, 38401 flow [2022-12-06 03:55:54,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 1124 transitions, 38401 flow [2022-12-06 03:55:55,406 INFO L130 PetriNetUnfolder]: 760/2051 cut-off events. [2022-12-06 03:55:55,406 INFO L131 PetriNetUnfolder]: For 188103/188193 co-relation queries the response was YES. [2022-12-06 03:55:55,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31553 conditions, 2051 events. 760/2051 cut-off events. For 188103/188193 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 18869 event pairs, 1 based on Foata normal form. 29/2077 useless extension candidates. Maximal degree in co-relation 31398. Up to 1191 conditions per place. [2022-12-06 03:55:55,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 395 places, 1124 transitions, 38401 flow [2022-12-06 03:55:55,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 3160 [2022-12-06 03:55:55,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:55:55,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 641 [2022-12-06 03:55:55,456 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 1124 transitions, 38401 flow [2022-12-06 03:55:55,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:55,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:55:55,456 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:55:55,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-06 03:55:55,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 03:55:55,656 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:55:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:55:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2128756762, now seen corresponding path program 1 times [2022-12-06 03:55:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:55:55,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079154336] [2022-12-06 03:55:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:55:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:55,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:55:55,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079154336] [2022-12-06 03:55:55,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079154336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:55:55,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320378514] [2022-12-06 03:55:55,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:55:55,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:55:55,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:55:55,693 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:55:55,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 03:55:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:55:55,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:55:55,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:55:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:55:55,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:55:55,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320378514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:55:55,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:55:55,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 03:55:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221396624] [2022-12-06 03:55:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:55:55,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:55:55,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:55:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:55:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:55:55,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 03:55:55,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1124 transitions, 38401 flow. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:55:55,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:55:55,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 03:55:55,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:55:59,008 INFO L130 PetriNetUnfolder]: 4208/7284 cut-off events. [2022-12-06 03:55:59,008 INFO L131 PetriNetUnfolder]: For 743693/743693 co-relation queries the response was YES. [2022-12-06 03:55:59,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91873 conditions, 7284 events. 4208/7284 cut-off events. For 743693/743693 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 55152 event pairs, 633 based on Foata normal form. 24/7294 useless extension candidates. Maximal degree in co-relation 91715. Up to 3289 conditions per place. [2022-12-06 03:55:59,432 INFO L137 encePairwiseOnDemand]: 36/57 looper letters, 1666 selfloop transitions, 76 changer transitions 10/1752 dead transitions. [2022-12-06 03:55:59,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1752 transitions, 63315 flow [2022-12-06 03:55:59,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:55:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:55:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 03:55:59,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2022-12-06 03:55:59,434 INFO L175 Difference]: Start difference. First operand has 395 places, 1124 transitions, 38401 flow. Second operand 7 states and 91 transitions. [2022-12-06 03:55:59,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 1752 transitions, 63315 flow [2022-12-06 03:56:03,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1752 transitions, 63128 flow, removed 93 selfloop flow, removed 1 redundant places. [2022-12-06 03:56:03,571 INFO L231 Difference]: Finished difference. Result has 403 places, 1137 transitions, 38858 flow [2022-12-06 03:56:03,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=37581, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=38858, PETRI_PLACES=403, PETRI_TRANSITIONS=1137} [2022-12-06 03:56:03,572 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 385 predicate places. [2022-12-06 03:56:03,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:56:03,573 INFO L89 Accepts]: Start accepts. Operand has 403 places, 1137 transitions, 38858 flow [2022-12-06 03:56:03,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:56:03,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:56:03,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 1137 transitions, 38858 flow [2022-12-06 03:56:03,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 403 places, 1137 transitions, 38858 flow [2022-12-06 03:56:04,241 INFO L130 PetriNetUnfolder]: 844/2236 cut-off events. [2022-12-06 03:56:04,242 INFO L131 PetriNetUnfolder]: For 237899/238020 co-relation queries the response was YES. [2022-12-06 03:56:04,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35486 conditions, 2236 events. 844/2236 cut-off events. For 237899/238020 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 20556 event pairs, 4 based on Foata normal form. 60/2293 useless extension candidates. Maximal degree in co-relation 35327. Up to 1316 conditions per place. [2022-12-06 03:56:04,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 1137 transitions, 38858 flow [2022-12-06 03:56:04,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 3346 [2022-12-06 03:56:04,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:56:04,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 720 [2022-12-06 03:56:04,293 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 1137 transitions, 38858 flow [2022-12-06 03:56:04,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:04,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:56:04,293 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:56:04,296 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 03:56:04,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 03:56:04,497 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:56:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:56:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1662982034, now seen corresponding path program 1 times [2022-12-06 03:56:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:56:04,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200915072] [2022-12-06 03:56:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:56:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:04,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:56:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200915072] [2022-12-06 03:56:04,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200915072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:56:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184864708] [2022-12-06 03:56:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:56:04,613 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:56:04,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 03:56:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:04,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:56:04,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:56:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:04,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:56:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:05,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184864708] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:56:05,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:56:05,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:56:05,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331484329] [2022-12-06 03:56:05,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:56:05,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:56:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:56:05,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:56:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:56:05,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 03:56:05,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1137 transitions, 38858 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:05,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:56:05,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 03:56:05,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:13,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:16,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:19,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:20,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:22,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:24,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:26,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:28,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:29,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:33,772 INFO L130 PetriNetUnfolder]: 4678/8110 cut-off events. [2022-12-06 03:56:33,773 INFO L131 PetriNetUnfolder]: For 1020600/1020600 co-relation queries the response was YES. [2022-12-06 03:56:33,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105570 conditions, 8110 events. 4678/8110 cut-off events. For 1020600/1020600 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 61717 event pairs, 339 based on Foata normal form. 54/8150 useless extension candidates. Maximal degree in co-relation 105408. Up to 4561 conditions per place. [2022-12-06 03:56:33,890 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 719 selfloop transitions, 744 changer transitions 4/1467 dead transitions. [2022-12-06 03:56:33,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1467 transitions, 48787 flow [2022-12-06 03:56:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 03:56:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 03:56:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 259 transitions. [2022-12-06 03:56:33,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.125 [2022-12-06 03:56:33,892 INFO L175 Difference]: Start difference. First operand has 403 places, 1137 transitions, 38858 flow. Second operand 37 states and 259 transitions. [2022-12-06 03:56:33,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 1467 transitions, 48787 flow [2022-12-06 03:56:40,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 1467 transitions, 48616 flow, removed 85 selfloop flow, removed 1 redundant places. [2022-12-06 03:56:40,110 INFO L231 Difference]: Finished difference. Result has 451 places, 1273 transitions, 46285 flow [2022-12-06 03:56:40,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=38687, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=46285, PETRI_PLACES=451, PETRI_TRANSITIONS=1273} [2022-12-06 03:56:40,111 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 433 predicate places. [2022-12-06 03:56:40,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:56:40,111 INFO L89 Accepts]: Start accepts. Operand has 451 places, 1273 transitions, 46285 flow [2022-12-06 03:56:40,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:56:40,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:56:40,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 451 places, 1273 transitions, 46285 flow [2022-12-06 03:56:40,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 451 places, 1273 transitions, 46285 flow [2022-12-06 03:56:40,954 INFO L130 PetriNetUnfolder]: 932/2473 cut-off events. [2022-12-06 03:56:40,954 INFO L131 PetriNetUnfolder]: For 311423/311551 co-relation queries the response was YES. [2022-12-06 03:56:40,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41641 conditions, 2473 events. 932/2473 cut-off events. For 311423/311551 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 23287 event pairs, 4 based on Foata normal form. 62/2532 useless extension candidates. Maximal degree in co-relation 41468. Up to 1477 conditions per place. [2022-12-06 03:56:41,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 451 places, 1273 transitions, 46285 flow [2022-12-06 03:56:41,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 3710 [2022-12-06 03:56:41,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:56:41,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1169 [2022-12-06 03:56:41,280 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 1273 transitions, 46295 flow [2022-12-06 03:56:41,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:41,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:56:41,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:56:41,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 03:56:41,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 03:56:41,485 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:56:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:56:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -73266637, now seen corresponding path program 1 times [2022-12-06 03:56:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:56:41,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688957284] [2022-12-06 03:56:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:56:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:41,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:56:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688957284] [2022-12-06 03:56:41,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688957284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:56:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722715043] [2022-12-06 03:56:41,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:56:41,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:56:41,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:56:41,652 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:56:41,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 03:56:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:56:41,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:56:41,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:56:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:41,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:56:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:56:42,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722715043] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:56:42,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:56:42,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:56:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588902907] [2022-12-06 03:56:42,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:56:42,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:56:42,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:56:42,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:56:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:56:42,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 03:56:42,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 1273 transitions, 46295 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:56:42,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:56:42,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 03:56:42,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:56:47,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:49,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:51,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:56:56,756 INFO L130 PetriNetUnfolder]: 4732/8236 cut-off events. [2022-12-06 03:56:56,756 INFO L131 PetriNetUnfolder]: For 1046818/1046818 co-relation queries the response was YES. [2022-12-06 03:56:56,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112301 conditions, 8236 events. 4732/8236 cut-off events. For 1046818/1046818 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 63288 event pairs, 596 based on Foata normal form. 26/8248 useless extension candidates. Maximal degree in co-relation 112125. Up to 5950 conditions per place. [2022-12-06 03:56:56,886 INFO L137 encePairwiseOnDemand]: 8/57 looper letters, 889 selfloop transitions, 537 changer transitions 1/1427 dead transitions. [2022-12-06 03:56:56,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1427 transitions, 51523 flow [2022-12-06 03:56:56,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:56:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:56:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 158 transitions. [2022-12-06 03:56:56,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13199665831244778 [2022-12-06 03:56:56,887 INFO L175 Difference]: Start difference. First operand has 451 places, 1273 transitions, 46295 flow. Second operand 21 states and 158 transitions. [2022-12-06 03:56:56,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1427 transitions, 51523 flow [2022-12-06 03:57:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1427 transitions, 50104 flow, removed 634 selfloop flow, removed 12 redundant places. [2022-12-06 03:57:04,134 INFO L231 Difference]: Finished difference. Result has 466 places, 1309 transitions, 48019 flow [2022-12-06 03:57:04,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=44811, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=503, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=48019, PETRI_PLACES=466, PETRI_TRANSITIONS=1309} [2022-12-06 03:57:04,134 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 448 predicate places. [2022-12-06 03:57:04,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:04,135 INFO L89 Accepts]: Start accepts. Operand has 466 places, 1309 transitions, 48019 flow [2022-12-06 03:57:04,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:04,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:04,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 466 places, 1309 transitions, 48019 flow [2022-12-06 03:57:04,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 1309 transitions, 48019 flow [2022-12-06 03:57:05,122 INFO L130 PetriNetUnfolder]: 957/2528 cut-off events. [2022-12-06 03:57:05,122 INFO L131 PetriNetUnfolder]: For 337004/337229 co-relation queries the response was YES. [2022-12-06 03:57:05,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43084 conditions, 2528 events. 957/2528 cut-off events. For 337004/337229 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 23895 event pairs, 4 based on Foata normal form. 61/2586 useless extension candidates. Maximal degree in co-relation 42903. Up to 1499 conditions per place. [2022-12-06 03:57:05,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 466 places, 1309 transitions, 48019 flow [2022-12-06 03:57:05,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 3768 [2022-12-06 03:57:05,218 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:57:05,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1084 [2022-12-06 03:57:05,219 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 1309 transitions, 48019 flow [2022-12-06 03:57:05,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:57:05,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:05,219 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:05,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 03:57:05,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:05,420 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:57:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2022451152, now seen corresponding path program 2 times [2022-12-06 03:57:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:05,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164604686] [2022-12-06 03:57:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164604686] [2022-12-06 03:57:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164604686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:57:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506564267] [2022-12-06 03:57:05,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:57:05,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:57:05,541 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:57:05,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 03:57:05,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:57:05,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:57:05,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:57:05,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:57:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:05,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:57:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:06,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506564267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:57:06,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:57:06,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:57:06,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663152746] [2022-12-06 03:57:06,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:57:06,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:57:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:06,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:57:06,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:57:06,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 03:57:06,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1309 transitions, 48019 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:57:06,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:06,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 03:57:06,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:57:13,970 INFO L130 PetriNetUnfolder]: 5652/9712 cut-off events. [2022-12-06 03:57:13,971 INFO L131 PetriNetUnfolder]: For 1567734/1567734 co-relation queries the response was YES. [2022-12-06 03:57:14,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139418 conditions, 9712 events. 5652/9712 cut-off events. For 1567734/1567734 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 75021 event pairs, 192 based on Foata normal form. 32/9730 useless extension candidates. Maximal degree in co-relation 139234. Up to 3932 conditions per place. [2022-12-06 03:57:14,313 INFO L137 encePairwiseOnDemand]: 8/57 looper letters, 452 selfloop transitions, 1173 changer transitions 2/1627 dead transitions. [2022-12-06 03:57:14,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1627 transitions, 59851 flow [2022-12-06 03:57:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:57:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:57:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 186 transitions. [2022-12-06 03:57:14,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14832535885167464 [2022-12-06 03:57:14,315 INFO L175 Difference]: Start difference. First operand has 466 places, 1309 transitions, 48019 flow. Second operand 22 states and 186 transitions. [2022-12-06 03:57:14,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 1627 transitions, 59851 flow [2022-12-06 03:57:25,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 1627 transitions, 59681 flow, removed 64 selfloop flow, removed 2 redundant places. [2022-12-06 03:57:25,241 INFO L231 Difference]: Finished difference. Result has 490 places, 1468 transitions, 58299 flow [2022-12-06 03:57:25,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=47861, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=58299, PETRI_PLACES=490, PETRI_TRANSITIONS=1468} [2022-12-06 03:57:25,242 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 472 predicate places. [2022-12-06 03:57:25,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:57:25,242 INFO L89 Accepts]: Start accepts. Operand has 490 places, 1468 transitions, 58299 flow [2022-12-06 03:57:25,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:57:25,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:57:25,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 490 places, 1468 transitions, 58299 flow [2022-12-06 03:57:25,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 490 places, 1468 transitions, 58299 flow [2022-12-06 03:57:26,567 INFO L130 PetriNetUnfolder]: 1139/2946 cut-off events. [2022-12-06 03:57:26,567 INFO L131 PetriNetUnfolder]: For 508912/509319 co-relation queries the response was YES. [2022-12-06 03:57:26,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55438 conditions, 2946 events. 1139/2946 cut-off events. For 508912/509319 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 28253 event pairs, 7 based on Foata normal form. 66/3009 useless extension candidates. Maximal degree in co-relation 55250. Up to 1782 conditions per place. [2022-12-06 03:57:26,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 490 places, 1468 transitions, 58299 flow [2022-12-06 03:57:26,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 4310 [2022-12-06 03:57:26,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:57:26,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1446 [2022-12-06 03:57:26,688 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 1468 transitions, 58313 flow [2022-12-06 03:57:26,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:57:26,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:57:26,688 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:57:26,694 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 03:57:26,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:26,891 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:57:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:57:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1434511972, now seen corresponding path program 1 times [2022-12-06 03:57:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:57:26,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111936984] [2022-12-06 03:57:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:57:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:57:26,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111936984] [2022-12-06 03:57:26,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111936984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:57:26,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759697455] [2022-12-06 03:57:26,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:57:26,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:57:26,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:57:26,988 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:57:26,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 03:57:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:57:27,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:57:27,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:57:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:27,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:57:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:57:27,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759697455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:57:27,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:57:27,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:57:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792813317] [2022-12-06 03:57:27,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:57:27,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:57:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:57:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:57:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:57:27,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 03:57:27,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 1468 transitions, 58313 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:57:27,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:57:27,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 03:57:27,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:57:43,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:57:45,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:57:50,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:57:57,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:58:06,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:58:14,646 INFO L130 PetriNetUnfolder]: 6117/10564 cut-off events. [2022-12-06 03:58:14,647 INFO L131 PetriNetUnfolder]: For 2155518/2155518 co-relation queries the response was YES. [2022-12-06 03:58:14,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157325 conditions, 10564 events. 6117/10564 cut-off events. For 2155518/2155518 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 83417 event pairs, 574 based on Foata normal form. 128/10678 useless extension candidates. Maximal degree in co-relation 157134. Up to 6389 conditions per place. [2022-12-06 03:58:14,828 INFO L137 encePairwiseOnDemand]: 8/58 looper letters, 861 selfloop transitions, 971 changer transitions 4/1836 dead transitions. [2022-12-06 03:58:14,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 1836 transitions, 71296 flow [2022-12-06 03:58:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 03:58:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 03:58:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 242 transitions. [2022-12-06 03:58:14,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11276794035414725 [2022-12-06 03:58:14,830 INFO L175 Difference]: Start difference. First operand has 490 places, 1468 transitions, 58313 flow. Second operand 37 states and 242 transitions. [2022-12-06 03:58:14,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 1836 transitions, 71296 flow [2022-12-06 03:58:28,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 1836 transitions, 69268 flow, removed 755 selfloop flow, removed 18 redundant places. [2022-12-06 03:58:28,141 INFO L231 Difference]: Finished difference. Result has 520 places, 1635 transitions, 67111 flow [2022-12-06 03:58:28,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=56683, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=826, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=67111, PETRI_PLACES=520, PETRI_TRANSITIONS=1635} [2022-12-06 03:58:28,142 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 502 predicate places. [2022-12-06 03:58:28,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:58:28,142 INFO L89 Accepts]: Start accepts. Operand has 520 places, 1635 transitions, 67111 flow [2022-12-06 03:58:28,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:58:28,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:58:28,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 520 places, 1635 transitions, 67111 flow [2022-12-06 03:58:28,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 520 places, 1635 transitions, 67111 flow [2022-12-06 03:58:29,739 INFO L130 PetriNetUnfolder]: 1259/3250 cut-off events. [2022-12-06 03:58:29,739 INFO L131 PetriNetUnfolder]: For 486991/487363 co-relation queries the response was YES. [2022-12-06 03:58:29,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60913 conditions, 3250 events. 1259/3250 cut-off events. For 486991/487363 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 31674 event pairs, 8 based on Foata normal form. 67/3314 useless extension candidates. Maximal degree in co-relation 60721. Up to 1972 conditions per place. [2022-12-06 03:58:29,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 520 places, 1635 transitions, 67111 flow [2022-12-06 03:58:29,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 4716 [2022-12-06 03:58:30,070 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:58:30,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1929 [2022-12-06 03:58:30,071 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 1633 transitions, 67070 flow [2022-12-06 03:58:30,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:58:30,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:58:30,071 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:58:30,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 03:58:30,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-06 03:58:30,271 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:58:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:58:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2035032781, now seen corresponding path program 1 times [2022-12-06 03:58:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:58:30,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894400787] [2022-12-06 03:58:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:58:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:58:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:58:30,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894400787] [2022-12-06 03:58:30,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894400787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:58:30,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937343347] [2022-12-06 03:58:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:58:30,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:58:30,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:58:30,378 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:58:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 03:58:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:58:30,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:58:30,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:58:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:58:30,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:58:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:58:30,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937343347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:58:30,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:58:30,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 03:58:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142661551] [2022-12-06 03:58:30,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:58:30,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:58:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:58:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:58:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:58:30,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 03:58:30,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 1633 transitions, 67070 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:58:30,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:58:30,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 03:58:30,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:58:37,502 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 73 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:58:46,830 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 67 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 03:58:57,564 INFO L130 PetriNetUnfolder]: 7006/12068 cut-off events. [2022-12-06 03:58:57,564 INFO L131 PetriNetUnfolder]: For 2259133/2259133 co-relation queries the response was YES. [2022-12-06 03:58:57,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184004 conditions, 12068 events. 7006/12068 cut-off events. For 2259133/2259133 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 97089 event pairs, 358 based on Foata normal form. 110/12164 useless extension candidates. Maximal degree in co-relation 183809. Up to 5499 conditions per place. [2022-12-06 03:58:57,756 INFO L137 encePairwiseOnDemand]: 8/61 looper letters, 701 selfloop transitions, 1374 changer transitions 1/2076 dead transitions. [2022-12-06 03:58:57,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 2076 transitions, 83661 flow [2022-12-06 03:58:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 03:58:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 03:58:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 231 transitions. [2022-12-06 03:58:57,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12215758857747223 [2022-12-06 03:58:57,758 INFO L175 Difference]: Start difference. First operand has 518 places, 1633 transitions, 67070 flow. Second operand 31 states and 231 transitions. [2022-12-06 03:58:57,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 2076 transitions, 83661 flow [2022-12-06 03:59:12,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 2076 transitions, 80770 flow, removed 1305 selfloop flow, removed 10 redundant places. [2022-12-06 03:59:12,850 INFO L231 Difference]: Finished difference. Result has 548 places, 1853 transitions, 78842 flow [2022-12-06 03:59:12,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=64357, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=78842, PETRI_PLACES=548, PETRI_TRANSITIONS=1853} [2022-12-06 03:59:12,851 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 530 predicate places. [2022-12-06 03:59:12,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:59:12,851 INFO L89 Accepts]: Start accepts. Operand has 548 places, 1853 transitions, 78842 flow [2022-12-06 03:59:12,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:59:12,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:59:12,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 548 places, 1853 transitions, 78842 flow [2022-12-06 03:59:12,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 548 places, 1853 transitions, 78842 flow [2022-12-06 03:59:14,748 INFO L130 PetriNetUnfolder]: 1460/3733 cut-off events. [2022-12-06 03:59:14,749 INFO L131 PetriNetUnfolder]: For 638873/639263 co-relation queries the response was YES. [2022-12-06 03:59:14,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73296 conditions, 3733 events. 1460/3733 cut-off events. For 638873/639263 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 37216 event pairs, 11 based on Foata normal form. 65/3795 useless extension candidates. Maximal degree in co-relation 73094. Up to 2177 conditions per place. [2022-12-06 03:59:14,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 548 places, 1853 transitions, 78842 flow [2022-12-06 03:59:14,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 5332 [2022-12-06 03:59:14,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:59:14,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2083 [2022-12-06 03:59:14,934 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 1853 transitions, 78863 flow [2022-12-06 03:59:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:14,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:59:14,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:59:14,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 03:59:15,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 03:59:15,135 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:59:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:59:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash -131441733, now seen corresponding path program 1 times [2022-12-06 03:59:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:59:15,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704779862] [2022-12-06 03:59:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:59:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:15,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:59:15,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704779862] [2022-12-06 03:59:15,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704779862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:59:15,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223168009] [2022-12-06 03:59:15,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:15,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:59:15,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:59:15,245 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:59:15,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 03:59:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:15,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:59:15,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:59:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:15,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:59:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:15,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223168009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:59:15,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:59:15,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:59:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272856050] [2022-12-06 03:59:15,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:59:15,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:59:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:59:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:59:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:59:15,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 03:59:15,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 1853 transitions, 78863 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:15,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:59:15,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 03:59:15,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:59:21,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:59:23,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:59:25,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:59:35,243 INFO L130 PetriNetUnfolder]: 7205/12482 cut-off events. [2022-12-06 03:59:35,243 INFO L131 PetriNetUnfolder]: For 2343310/2343310 co-relation queries the response was YES. [2022-12-06 03:59:35,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194360 conditions, 12482 events. 7205/12482 cut-off events. For 2343310/2343310 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 101994 event pairs, 1514 based on Foata normal form. 86/12554 useless extension candidates. Maximal degree in co-relation 194155. Up to 10044 conditions per place. [2022-12-06 03:59:35,477 INFO L137 encePairwiseOnDemand]: 8/62 looper letters, 1461 selfloop transitions, 610 changer transitions 3/2074 dead transitions. [2022-12-06 03:59:35,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 2074 transitions, 89023 flow [2022-12-06 03:59:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:59:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:59:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 164 transitions. [2022-12-06 03:59:35,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12023460410557185 [2022-12-06 03:59:35,479 INFO L175 Difference]: Start difference. First operand has 548 places, 1853 transitions, 78863 flow. Second operand 22 states and 164 transitions. [2022-12-06 03:59:35,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 2074 transitions, 89023 flow [2022-12-06 03:59:54,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 2074 transitions, 85983 flow, removed 1414 selfloop flow, removed 8 redundant places. [2022-12-06 03:59:54,552 INFO L231 Difference]: Finished difference. Result has 567 places, 1957 transitions, 83086 flow [2022-12-06 03:59:54,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=76041, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=83086, PETRI_PLACES=567, PETRI_TRANSITIONS=1957} [2022-12-06 03:59:54,554 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 549 predicate places. [2022-12-06 03:59:54,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 03:59:54,554 INFO L89 Accepts]: Start accepts. Operand has 567 places, 1957 transitions, 83086 flow [2022-12-06 03:59:54,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 03:59:54,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:59:54,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 567 places, 1957 transitions, 83086 flow [2022-12-06 03:59:54,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 567 places, 1957 transitions, 83086 flow [2022-12-06 03:59:56,331 INFO L130 PetriNetUnfolder]: 1514/3897 cut-off events. [2022-12-06 03:59:56,331 INFO L131 PetriNetUnfolder]: For 662272/662742 co-relation queries the response was YES. [2022-12-06 03:59:56,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75554 conditions, 3897 events. 1514/3897 cut-off events. For 662272/662742 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 39259 event pairs, 8 based on Foata normal form. 65/3959 useless extension candidates. Maximal degree in co-relation 75347. Up to 2202 conditions per place. [2022-12-06 03:59:56,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 567 places, 1957 transitions, 83086 flow [2022-12-06 03:59:56,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 5538 [2022-12-06 03:59:56,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L705-6-->L687-5: Formula: (and (= v_~j~0_501 (+ v_~j~0_502 (* 6 v_~i~0_473))) (= (* v_~next~0_200 13) (+ (* 21 v_~prev~0_384) (* 34 v_~cur~0_326) (* 21 v_~prev~0_383))) (= v_~p~0_318 (+ v_~p~0_320 2)) (= v_~i~0_471 (+ (* v_~j~0_501 2) v_~i~0_473)) (= (+ 16 v_~x~0_370) v_~x~0_369) (< v_~p~0_320 6) (< v_~q~0_368 8) (= v_~next~0_200 v_~cur~0_325) (= (+ v_~q~0_369 6) v_~q~0_368) (< v_~x~0_369 17) (= (* 34 v_~prev~0_383) (+ (* v_~prev~0_384 13) (* 21 v_~next~0_200) (* 21 v_~cur~0_326)))) InVars {~j~0=v_~j~0_502, ~prev~0=v_~prev~0_384, ~i~0=v_~i~0_473, ~q~0=v_~q~0_369, ~p~0=v_~p~0_320, ~cur~0=v_~cur~0_326, ~x~0=v_~x~0_370} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_235|, ~j~0=v_~j~0_501, ~next~0=v_~next~0_200, ~prev~0=v_~prev~0_383, ~i~0=v_~i~0_471, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_234|, ~q~0=v_~q~0_368, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_262|, ~p~0=v_~p~0_318, ~cur~0=v_~cur~0_325, ~x~0=v_~x~0_369} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 03:59:56,962 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 03:59:56,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2409 [2022-12-06 03:59:56,963 INFO L495 AbstractCegarLoop]: Abstraction has has 565 places, 1955 transitions, 83107 flow [2022-12-06 03:59:56,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:56,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:59:56,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:59:56,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 03:59:57,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-06 03:59:57,163 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:59:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:59:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash -105480721, now seen corresponding path program 1 times [2022-12-06 03:59:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:59:57,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781134786] [2022-12-06 03:59:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:59:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:57,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:59:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781134786] [2022-12-06 03:59:57,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781134786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:59:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765841115] [2022-12-06 03:59:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:59:57,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:59:57,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:59:57,260 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:59:57,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 03:59:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:59:57,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:59:57,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:59:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:57,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:59:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:59:57,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765841115] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:59:57,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:59:57,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 03:59:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048415120] [2022-12-06 03:59:57,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:59:57,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:59:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:59:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:59:57,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:59:57,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 03:59:57,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 1955 transitions, 83107 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:59:57,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:59:57,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 03:59:57,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:00:13,668 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 [1] [2022-12-06 04:00:15,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:00:17,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:00:19,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:00:22,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:00:27,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:00:38,017 INFO L130 PetriNetUnfolder]: 7254/12615 cut-off events. [2022-12-06 04:00:38,017 INFO L131 PetriNetUnfolder]: For 2233070/2233070 co-relation queries the response was YES. [2022-12-06 04:00:38,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194520 conditions, 12615 events. 7254/12615 cut-off events. For 2233070/2233070 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 103803 event pairs, 1348 based on Foata normal form. 48/12649 useless extension candidates. Maximal degree in co-relation 194310. Up to 10433 conditions per place. [2022-12-06 04:00:38,259 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 1566 selfloop transitions, 573 changer transitions 6/2145 dead transitions. [2022-12-06 04:00:38,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 2145 transitions, 91612 flow [2022-12-06 04:00:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 04:00:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 04:00:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 182 transitions. [2022-12-06 04:00:38,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11375 [2022-12-06 04:00:38,260 INFO L175 Difference]: Start difference. First operand has 565 places, 1955 transitions, 83107 flow. Second operand 25 states and 182 transitions. [2022-12-06 04:00:38,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 2145 transitions, 91612 flow [2022-12-06 04:00:59,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 2145 transitions, 90415 flow, removed 452 selfloop flow, removed 14 redundant places. [2022-12-06 04:00:59,065 INFO L231 Difference]: Finished difference. Result has 580 places, 2022 transitions, 86998 flow [2022-12-06 04:00:59,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=82010, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=86998, PETRI_PLACES=580, PETRI_TRANSITIONS=2022} [2022-12-06 04:00:59,066 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 562 predicate places. [2022-12-06 04:00:59,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:00:59,066 INFO L89 Accepts]: Start accepts. Operand has 580 places, 2022 transitions, 86998 flow [2022-12-06 04:00:59,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:00:59,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:00:59,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 580 places, 2022 transitions, 86998 flow [2022-12-06 04:00:59,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 580 places, 2022 transitions, 86998 flow [2022-12-06 04:01:01,472 INFO L130 PetriNetUnfolder]: 1518/3936 cut-off events. [2022-12-06 04:01:01,472 INFO L131 PetriNetUnfolder]: For 685041/685458 co-relation queries the response was YES. [2022-12-06 04:01:01,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76839 conditions, 3936 events. 1518/3936 cut-off events. For 685041/685458 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 40063 event pairs, 7 based on Foata normal form. 66/3999 useless extension candidates. Maximal degree in co-relation 76627. Up to 2234 conditions per place. [2022-12-06 04:01:01,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 580 places, 2022 transitions, 86998 flow [2022-12-06 04:01:01,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 5648 [2022-12-06 04:01:02,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L705-6-->L687-5: Formula: (and (= v_~next~0_209 v_~cur~0_342) (= (+ v_~p~0_351 3) v_~p~0_349) (< v_~x~0_387 17) (< v_~q~0_389 8) (= (+ v_~q~0_390 6) v_~q~0_389) (= (* v_~next~0_209 13) (+ (* 34 v_~cur~0_343) (* 21 v_~prev~0_402) (* 21 v_~prev~0_401))) (= v_~j~0_525 (+ v_~j~0_526 (* 6 v_~i~0_505))) (= (* 34 v_~prev~0_401) (+ (* 21 v_~next~0_209) (* 21 v_~cur~0_343) (* v_~prev~0_402 13))) (= (+ 16 v_~x~0_388) v_~x~0_387) (= (+ (* v_~j~0_525 3) v_~i~0_505) v_~i~0_503) (< v_~p~0_349 8)) InVars {~j~0=v_~j~0_526, ~prev~0=v_~prev~0_402, ~i~0=v_~i~0_505, ~q~0=v_~q~0_390, ~p~0=v_~p~0_351, ~cur~0=v_~cur~0_343, ~x~0=v_~x~0_388} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_245|, ~j~0=v_~j~0_525, ~next~0=v_~next~0_209, ~prev~0=v_~prev~0_401, ~i~0=v_~i~0_503, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_255|, ~q~0=v_~q~0_389, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_275|, ~p~0=v_~p~0_349, ~cur~0=v_~cur~0_342, ~x~0=v_~x~0_387} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 04:01:02,142 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:01:02,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3077 [2022-12-06 04:01:02,143 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 2021 transitions, 87054 flow [2022-12-06 04:01:02,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:01:02,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:01:02,143 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:01:02,149 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 04:01:02,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 04:01:02,345 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 04:01:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:01:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1777369864, now seen corresponding path program 1 times [2022-12-06 04:01:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:01:02,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250222363] [2022-12-06 04:01:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:01:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:01:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:01:02,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250222363] [2022-12-06 04:01:02,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250222363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:01:02,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183876755] [2022-12-06 04:01:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:01:02,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:01:02,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:01:02,454 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 04:01:02,455 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 04:01:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:01:02,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 04:01:02,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:01:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:01:02,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:01:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:01:03,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183876755] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:01:03,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:01:03,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:01:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860630042] [2022-12-06 04:01:03,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:01:03,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:01:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:01:03,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:01:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:01:03,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 04:01:03,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 2021 transitions, 87054 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:01:03,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:01:03,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 04:01:03,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:01:08,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:10,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:14,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:18,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:22,890 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 [1] [2022-12-06 04:01:25,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:27,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:29,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:31,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:01:41,786 INFO L130 PetriNetUnfolder]: 7605/13284 cut-off events. [2022-12-06 04:01:41,787 INFO L131 PetriNetUnfolder]: For 2955431/2955431 co-relation queries the response was YES. [2022-12-06 04:01:42,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206697 conditions, 13284 events. 7605/13284 cut-off events. For 2955431/2955431 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 110569 event pairs, 722 based on Foata normal form. 142/13412 useless extension candidates. Maximal degree in co-relation 206482. Up to 7902 conditions per place. [2022-12-06 04:01:42,105 INFO L137 encePairwiseOnDemand]: 8/67 looper letters, 1230 selfloop transitions, 1135 changer transitions 2/2367 dead transitions. [2022-12-06 04:01:42,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 2367 transitions, 101063 flow [2022-12-06 04:01:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 04:01:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 04:01:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 238 transitions. [2022-12-06 04:01:42,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11458834857968224 [2022-12-06 04:01:42,108 INFO L175 Difference]: Start difference. First operand has 579 places, 2021 transitions, 87054 flow. Second operand 31 states and 238 transitions. [2022-12-06 04:01:42,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 2367 transitions, 101063 flow [2022-12-06 04:02:01,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 2367 transitions, 100413 flow, removed 238 selfloop flow, removed 10 redundant places. [2022-12-06 04:02:01,345 INFO L231 Difference]: Finished difference. Result has 612 places, 2163 transitions, 97273 flow [2022-12-06 04:02:01,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=86430, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=97273, PETRI_PLACES=612, PETRI_TRANSITIONS=2163} [2022-12-06 04:02:01,347 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 594 predicate places. [2022-12-06 04:02:01,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:02:01,347 INFO L89 Accepts]: Start accepts. Operand has 612 places, 2163 transitions, 97273 flow [2022-12-06 04:02:01,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:02:01,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:02:01,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 612 places, 2163 transitions, 97273 flow [2022-12-06 04:02:01,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 612 places, 2163 transitions, 97273 flow [2022-12-06 04:02:03,559 INFO L130 PetriNetUnfolder]: 1584/4134 cut-off events. [2022-12-06 04:02:03,559 INFO L131 PetriNetUnfolder]: For 754938/755337 co-relation queries the response was YES. [2022-12-06 04:02:03,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83705 conditions, 4134 events. 1584/4134 cut-off events. For 754938/755337 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 42554 event pairs, 3 based on Foata normal form. 66/4197 useless extension candidates. Maximal degree in co-relation 83480. Up to 2376 conditions per place. [2022-12-06 04:02:03,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 612 places, 2163 transitions, 97273 flow [2022-12-06 04:02:03,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 5986 [2022-12-06 04:02:03,808 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:02:03,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2462 [2022-12-06 04:02:03,809 INFO L495 AbstractCegarLoop]: Abstraction has has 612 places, 2163 transitions, 97295 flow [2022-12-06 04:02:03,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 04:02:03,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:02:03,809 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:02:03,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-06 04:02:04,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:04,023 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 04:02:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:02:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -60377147, now seen corresponding path program 1 times [2022-12-06 04:02:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:02:04,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125013736] [2022-12-06 04:02:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:04,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:02:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:04,106 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 04:02:04,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:02:04,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125013736] [2022-12-06 04:02:04,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125013736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:02:04,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355054513] [2022-12-06 04:02:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:02:04,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:02:04,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:02:04,108 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 04:02:04,109 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 04:02:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:02:04,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 04:02:04,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:02:04,275 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 04:02:04,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:02:04,488 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 04:02:04,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355054513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:02:04,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:02:04,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 04:02:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065334151] [2022-12-06 04:02:04,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:02:04,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 04:02:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:02:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 04:02:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 04:02:04,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 04:02:04,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 2163 transitions, 97295 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:02:04,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:02:04,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 04:02:04,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:02:08,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:02:10,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:02:15,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:02:19,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:02:33,132 INFO L130 PetriNetUnfolder]: 7843/13770 cut-off events. [2022-12-06 04:02:33,132 INFO L131 PetriNetUnfolder]: For 3051023/3051023 co-relation queries the response was YES. [2022-12-06 04:02:33,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221153 conditions, 13770 events. 7843/13770 cut-off events. For 3051023/3051023 co-relation queries the response was YES. Maximal size of possible extension queue 1528. Compared 116031 event pairs, 1633 based on Foata normal form. 112/13868 useless extension candidates. Maximal degree in co-relation 220925. Up to 10578 conditions per place. [2022-12-06 04:02:33,412 INFO L137 encePairwiseOnDemand]: 9/68 looper letters, 1589 selfloop transitions, 809 changer transitions 3/2401 dead transitions. [2022-12-06 04:02:33,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 2401 transitions, 108747 flow [2022-12-06 04:02:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 04:02:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 04:02:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 167 transitions. [2022-12-06 04:02:33,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1169467787114846 [2022-12-06 04:02:33,413 INFO L175 Difference]: Start difference. First operand has 612 places, 2163 transitions, 97295 flow. Second operand 21 states and 167 transitions. [2022-12-06 04:02:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 2401 transitions, 108747 flow [2022-12-06 04:02:59,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 2401 transitions, 105313 flow, removed 1649 selfloop flow, removed 5 redundant places. [2022-12-06 04:02:59,314 INFO L231 Difference]: Finished difference. Result has 632 places, 2266 transitions, 102244 flow [2022-12-06 04:02:59,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=94099, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=102244, PETRI_PLACES=632, PETRI_TRANSITIONS=2266} [2022-12-06 04:02:59,316 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 614 predicate places. [2022-12-06 04:02:59,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:02:59,316 INFO L89 Accepts]: Start accepts. Operand has 632 places, 2266 transitions, 102244 flow [2022-12-06 04:02:59,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:02:59,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:02:59,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 632 places, 2266 transitions, 102244 flow [2022-12-06 04:02:59,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 2266 transitions, 102244 flow [2022-12-06 04:03:01,801 INFO L130 PetriNetUnfolder]: 1661/4340 cut-off events. [2022-12-06 04:03:01,802 INFO L131 PetriNetUnfolder]: For 781016/781547 co-relation queries the response was YES. [2022-12-06 04:03:01,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87022 conditions, 4340 events. 1661/4340 cut-off events. For 781016/781547 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 44941 event pairs, 6 based on Foata normal form. 64/4401 useless extension candidates. Maximal degree in co-relation 86792. Up to 2510 conditions per place. [2022-12-06 04:03:01,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 632 places, 2266 transitions, 102244 flow [2022-12-06 04:03:01,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 6218 [2022-12-06 04:03:02,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L705-6-->L695-5: Formula: (and (= (* 34 v_~prev~0_391) (+ (* 21 v_~cur~0_334) (* 21 v_~next~0_204) (* v_~prev~0_392 13))) (= (* v_~next~0_204 13) (+ (* 21 v_~prev~0_392) (* 21 v_~prev~0_391) (* 34 v_~cur~0_334))) (= (+ (* 13 v_~i~0_490) (* v_~j~0_513 2)) v_~i~0_489) (= v_~next~0_204 v_~cur~0_333) (= v_~x~0_377 (+ 16 v_~x~0_378)) (= v_~p~0_336 (+ v_~p~0_337 2)) (< v_~x~0_377 17) (= (+ 7 v_~q~0_378) v_~q~0_376) (= v_~j~0_511 (+ v_~j~0_513 (* 6 v_~i~0_490) v_~i~0_489)) (< v_~p~0_337 6) (< v_~q~0_378 1)) InVars {~j~0=v_~j~0_513, ~prev~0=v_~prev~0_392, ~i~0=v_~i~0_490, ~q~0=v_~q~0_378, ~p~0=v_~p~0_337, ~cur~0=v_~cur~0_334, ~x~0=v_~x~0_378} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_239|, ~j~0=v_~j~0_511, ~next~0=v_~next~0_204, ~prev~0=v_~prev~0_391, ~i~0=v_~i~0_489, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_246|, ~q~0=v_~q~0_376, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_266|, ~p~0=v_~p~0_336, ~cur~0=v_~cur~0_333, ~x~0=v_~x~0_377} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:03:02,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] L705-6-->L695-5: Formula: (and (< v_~q~0_399 8) (= (+ 7 v_~q~0_401) v_~q~0_399) (= (+ 16 v_~x~0_396) v_~x~0_395) (< v_~x~0_395 17) (= (+ (* 34 v_~cur~0_351) (* 21 v_~prev~0_409) (* 21 v_~prev~0_410)) (* v_~next~0_213 13)) (= (+ (* 21 v_~next~0_213) (* 21 v_~cur~0_351) (* v_~prev~0_410 13)) (* 34 v_~prev~0_409)) (= (+ (* v_~j~0_539 3) (* 19 v_~i~0_518)) v_~i~0_517) (= v_~j~0_537 (+ v_~j~0_539 (* 6 v_~i~0_518) v_~i~0_517)) (= v_~p~0_361 (+ v_~p~0_362 3)) (= v_~next~0_213 v_~cur~0_350) (< v_~p~0_361 8)) InVars {~j~0=v_~j~0_539, ~prev~0=v_~prev~0_410, ~i~0=v_~i~0_518, ~q~0=v_~q~0_401, ~p~0=v_~p~0_362, ~cur~0=v_~cur~0_351, ~x~0=v_~x~0_396} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_249|, ~j~0=v_~j~0_537, ~next~0=v_~next~0_213, ~prev~0=v_~prev~0_409, ~i~0=v_~i~0_517, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_263|, ~q~0=v_~q~0_399, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_281|, ~p~0=v_~p~0_361, ~cur~0=v_~cur~0_350, ~x~0=v_~x~0_395} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 04:03:02,281 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:03:02,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2965 [2022-12-06 04:03:02,281 INFO L495 AbstractCegarLoop]: Abstraction has has 629 places, 2263 transitions, 102146 flow [2022-12-06 04:03:02,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:03:02,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:03:02,282 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:03:02,286 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 04:03:02,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 04:03:02,482 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 04:03:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:03:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1032989432, now seen corresponding path program 1 times [2022-12-06 04:03:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:03:02,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148978734] [2022-12-06 04:03:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:03:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:03:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:03:02,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148978734] [2022-12-06 04:03:02,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148978734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:03:02,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333087301] [2022-12-06 04:03:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:03:02,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:03:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:03:02,584 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 04:03:02,588 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 04:03:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:03:02,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 04:03:02,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:03:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:03:02,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:03:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:03:03,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333087301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:03:03,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:03:03,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:03:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120854228] [2022-12-06 04:03:03,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:03:03,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:03:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:03:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:03:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:03:03,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 04:03:03,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 2263 transitions, 102146 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:03:03,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:03:03,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 04:03:03,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:03:13,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:17,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:19,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:25,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:28,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:31,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:33,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:03:45,985 INFO L130 PetriNetUnfolder]: 7897/13896 cut-off events. [2022-12-06 04:03:45,985 INFO L131 PetriNetUnfolder]: For 2608167/2608167 co-relation queries the response was YES. [2022-12-06 04:03:46,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222478 conditions, 13896 events. 7897/13896 cut-off events. For 2608167/2608167 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 117845 event pairs, 1606 based on Foata normal form. 26/13908 useless extension candidates. Maximal degree in co-relation 222245. Up to 11524 conditions per place. [2022-12-06 04:03:46,259 INFO L137 encePairwiseOnDemand]: 8/68 looper letters, 1808 selfloop transitions, 628 changer transitions 3/2439 dead transitions. [2022-12-06 04:03:46,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 2439 transitions, 110756 flow [2022-12-06 04:03:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 04:03:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 04:03:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 204 transitions. [2022-12-06 04:03:46,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10344827586206896 [2022-12-06 04:03:46,260 INFO L175 Difference]: Start difference. First operand has 629 places, 2263 transitions, 102146 flow. Second operand 29 states and 204 transitions. [2022-12-06 04:03:46,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 2439 transitions, 110756 flow [2022-12-06 04:04:13,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 2439 transitions, 108790 flow, removed 923 selfloop flow, removed 6 redundant places. [2022-12-06 04:04:13,464 INFO L231 Difference]: Finished difference. Result has 656 places, 2313 transitions, 104894 flow [2022-12-06 04:04:13,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=100252, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=104894, PETRI_PLACES=656, PETRI_TRANSITIONS=2313} [2022-12-06 04:04:13,466 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 638 predicate places. [2022-12-06 04:04:13,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:04:13,466 INFO L89 Accepts]: Start accepts. Operand has 656 places, 2313 transitions, 104894 flow [2022-12-06 04:04:13,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:04:13,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:04:13,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 656 places, 2313 transitions, 104894 flow [2022-12-06 04:04:13,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 656 places, 2313 transitions, 104894 flow [2022-12-06 04:04:16,280 INFO L130 PetriNetUnfolder]: 1671/4383 cut-off events. [2022-12-06 04:04:16,280 INFO L131 PetriNetUnfolder]: For 813733/814204 co-relation queries the response was YES. [2022-12-06 04:04:16,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88260 conditions, 4383 events. 1671/4383 cut-off events. For 813733/814204 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 45499 event pairs, 6 based on Foata normal form. 64/4444 useless extension candidates. Maximal degree in co-relation 88026. Up to 2540 conditions per place. [2022-12-06 04:04:16,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 656 places, 2313 transitions, 104894 flow [2022-12-06 04:04:16,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 6296 [2022-12-06 04:04:17,209 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:04:17,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3744 [2022-12-06 04:04:17,210 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 2313 transitions, 105101 flow [2022-12-06 04:04:17,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:04:17,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:04:17,210 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:04:17,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-06 04:04:17,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 04:04:17,415 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:04:17,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:04:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1028788901, now seen corresponding path program 1 times [2022-12-06 04:04:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:04:17,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93238846] [2022-12-06 04:04:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:17,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:04:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:04:17,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93238846] [2022-12-06 04:04:17,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93238846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:04:17,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177781509] [2022-12-06 04:04:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:04:17,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:04:17,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:04:17,511 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 04:04:17,512 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 04:04:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:04:17,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 04:04:17,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:04:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:17,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:04:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:04:17,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177781509] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:04:17,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:04:17,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 04:04:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520640174] [2022-12-06 04:04:17,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:04:17,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 04:04:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:04:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 04:04:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-06 04:04:17,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 04:04:17,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 2313 transitions, 105101 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:04:17,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:04:17,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 04:04:17,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:04:24,121 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 78 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 04:04:35,673 WARN L233 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 74 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 04:04:40,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:42,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:43,549 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 [1] [2022-12-06 04:04:45,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:04:49,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:01,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:02,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:04,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:06,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:08,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:10,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:12,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:14,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:16,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:19,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:21,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:23,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 04:05:37,212 INFO L130 PetriNetUnfolder]: 8050/14240 cut-off events. [2022-12-06 04:05:37,212 INFO L131 PetriNetUnfolder]: For 2897674/2897674 co-relation queries the response was YES. [2022-12-06 04:05:37,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229964 conditions, 14240 events. 8050/14240 cut-off events. For 2897674/2897674 co-relation queries the response was YES. Maximal size of possible extension queue 1572. Compared 121593 event pairs, 1400 based on Foata normal form. 46/14272 useless extension candidates. Maximal degree in co-relation 229727. Up to 10656 conditions per place. [2022-12-06 04:05:37,498 INFO L137 encePairwiseOnDemand]: 8/74 looper letters, 1627 selfloop transitions, 943 changer transitions 11/2581 dead transitions. [2022-12-06 04:05:37,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 2581 transitions, 117549 flow [2022-12-06 04:05:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-06 04:05:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-06 04:05:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 242 transitions. [2022-12-06 04:05:37,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0860597439544808 [2022-12-06 04:05:37,500 INFO L175 Difference]: Start difference. First operand has 656 places, 2313 transitions, 105101 flow. Second operand 38 states and 242 transitions. [2022-12-06 04:05:37,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 2581 transitions, 117549 flow Received shutdown request... [2022-12-06 04:05:59,027 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 04:05:59,027 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 04:05:59,027 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 04:05:59,035 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 04:05:59,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 04:05:59,228 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 04:05:59,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 04:05:59,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 04:05:59,230 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:59,232 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:05:59,232 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:05:59,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:05:59 BasicIcfg [2022-12-06 04:05:59,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:05:59,234 INFO L158 Benchmark]: Toolchain (without parser) took 848289.87ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 163.3MB in the beginning and 799.9MB in the end (delta: -636.6MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 04:05:59,234 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:05:59,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.27ms. Allocated memory is still 188.7MB. Free memory was 163.3MB in the beginning and 142.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.58ms. Allocated memory is still 188.7MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,234 INFO L158 Benchmark]: Boogie Preprocessor took 35.53ms. Allocated memory is still 188.7MB. Free memory was 140.8MB in the beginning and 139.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,234 INFO L158 Benchmark]: RCFGBuilder took 431.31ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 125.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 04:05:59,234 INFO L158 Benchmark]: TraceAbstraction took 847343.42ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 125.1MB in the beginning and 799.9MB in the end (delta: -674.8MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 04:05:59,235 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.10ms. Allocated memory is still 127.9MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.27ms. Allocated memory is still 188.7MB. Free memory was 163.3MB in the beginning and 142.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.58ms. Allocated memory is still 188.7MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.53ms. Allocated memory is still 188.7MB. Free memory was 140.8MB in the beginning and 139.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 431.31ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 125.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 847343.42ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 125.1MB in the beginning and 799.9MB in the end (delta: -674.8MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 91 PlacesBefore, 18 PlacesAfterwards, 91 TransitionsBefore, 14 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 1109, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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.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): 216, Positive cache size: 216, Positive conditional cache size: 216, 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): 252, Positive cache size: 252, Positive conditional cache size: 252, 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): 288, Positive cache size: 288, Positive conditional cache size: 288, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 26 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 320, Positive conditional cache size: 320, 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, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 320, Positive conditional cache size: 320, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 37 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 448, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 448, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 448, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 448, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 56 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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): 452, Positive cache size: 452, Positive conditional cache size: 452, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 515, Positive cache size: 515, Positive conditional cache size: 515, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 78 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 683, Positive conditional cache size: 683, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 93 PlacesBefore, 93 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 808, Positive cache size: 808, Positive conditional cache size: 808, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 880, Positive cache size: 880, Positive conditional cache size: 880, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 121 PlacesBefore, 121 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 1006, Positive conditional cache size: 1006, 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, 136 PlacesBefore, 136 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1083, Positive cache size: 1083, Positive conditional cache size: 1083, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1083, Positive cache size: 1083, Positive conditional cache size: 1083, 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, 166 PlacesBefore, 166 PlacesAfterwards, 345 TransitionsBefore, 345 TransitionsAfterwards, 1078 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): 1083, Positive cache size: 1083, Positive conditional cache size: 1083, 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, 180 PlacesBefore, 180 PlacesAfterwards, 393 TransitionsBefore, 393 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1216, Positive cache size: 1216, Positive conditional cache size: 1216, 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, 181 PlacesBefore, 181 PlacesAfterwards, 407 TransitionsBefore, 407 TransitionsAfterwards, 1246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1226, Positive conditional cache size: 1226, 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, 205 PlacesBefore, 205 PlacesAfterwards, 474 TransitionsBefore, 474 TransitionsAfterwards, 1434 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): 1226, Positive cache size: 1226, Positive conditional cache size: 1226, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 222 PlacesBefore, 221 PlacesAfterwards, 493 TransitionsBefore, 492 TransitionsAfterwards, 1474 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1438, Positive cache size: 1438, Positive conditional cache size: 1438, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 250 PlacesBefore, 250 PlacesAfterwards, 582 TransitionsBefore, 582 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1851, Positive cache size: 1851, Positive conditional cache size: 1851, 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, 262 PlacesBefore, 261 PlacesAfterwards, 636 TransitionsBefore, 635 TransitionsAfterwards, 1808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 5, independent: 1, independent conditional: 1, 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): 1933, Positive cache size: 1933, Positive conditional cache size: 1933, 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, 286 PlacesBefore, 286 PlacesAfterwards, 733 TransitionsBefore, 733 TransitionsAfterwards, 2058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 18, independent: 12, independent conditional: 12, 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): 2128, Positive cache size: 2128, Positive conditional cache size: 2128, 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, 283 PlacesBefore, 283 PlacesAfterwards, 730 TransitionsBefore, 730 TransitionsAfterwards, 2056 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): 2128, Positive cache size: 2128, Positive conditional cache size: 2128, 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, 300 PlacesBefore, 300 PlacesAfterwards, 763 TransitionsBefore, 763 TransitionsAfterwards, 2120 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): 2128, Positive cache size: 2128, Positive conditional cache size: 2128, 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, 325 PlacesBefore, 325 PlacesAfterwards, 823 TransitionsBefore, 823 TransitionsAfterwards, 2238 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): 2186, Positive cache size: 2186, Positive conditional cache size: 2186, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 885 TransitionsBefore, 885 TransitionsAfterwards, 2380 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): 2250, Positive cache size: 2250, Positive conditional cache size: 2250, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 886 TransitionsBefore, 886 TransitionsAfterwards, 2468 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): 2250, Positive cache size: 2250, Positive conditional cache size: 2250, 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, 372 PlacesBefore, 372 PlacesAfterwards, 1007 TransitionsBefore, 1007 TransitionsAfterwards, 2778 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): 2250, Positive cache size: 2250, Positive conditional cache size: 2250, 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, 384 PlacesBefore, 383 PlacesAfterwards, 1073 TransitionsBefore, 1072 TransitionsAfterwards, 2930 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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, 389 PlacesBefore, 389 PlacesAfterwards, 1101 TransitionsBefore, 1101 TransitionsAfterwards, 2974 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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, 395 PlacesBefore, 395 PlacesAfterwards, 1124 TransitionsBefore, 1124 TransitionsAfterwards, 3160 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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, 403 PlacesBefore, 403 PlacesAfterwards, 1137 TransitionsBefore, 1137 TransitionsAfterwards, 3346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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, 451 PlacesBefore, 451 PlacesAfterwards, 1273 TransitionsBefore, 1273 TransitionsAfterwards, 3710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2447, Positive cache size: 2447, Positive conditional cache size: 2447, 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, 466 PlacesBefore, 466 PlacesAfterwards, 1309 TransitionsBefore, 1309 TransitionsAfterwards, 3768 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): 2447, Positive cache size: 2447, Positive conditional cache size: 2447, 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, 490 PlacesBefore, 490 PlacesAfterwards, 1468 TransitionsBefore, 1468 TransitionsAfterwards, 4310 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): 2525, Positive cache size: 2525, Positive conditional cache size: 2525, 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, 520 PlacesBefore, 518 PlacesAfterwards, 1635 TransitionsBefore, 1633 TransitionsAfterwards, 4716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 2669, Positive cache size: 2669, Positive conditional cache size: 2669, 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, 548 PlacesBefore, 548 PlacesAfterwards, 1853 TransitionsBefore, 1853 TransitionsAfterwards, 5332 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2670, Positive cache size: 2670, Positive conditional cache size: 2670, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 567 PlacesBefore, 565 PlacesAfterwards, 1957 TransitionsBefore, 1955 TransitionsAfterwards, 5538 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 2757, Positive cache size: 2757, Positive conditional cache size: 2757, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 580 PlacesBefore, 579 PlacesAfterwards, 2022 TransitionsBefore, 2021 TransitionsAfterwards, 5648 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 2837, Positive cache size: 2837, Positive conditional cache size: 2837, 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, 612 PlacesBefore, 612 PlacesAfterwards, 2163 TransitionsBefore, 2163 TransitionsAfterwards, 5986 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): 2839, Positive cache size: 2839, Positive conditional cache size: 2839, 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, 632 PlacesBefore, 629 PlacesAfterwards, 2266 TransitionsBefore, 2263 TransitionsAfterwards, 6218 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 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): 2842, Positive cache size: 2842, Positive conditional cache size: 2842, 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, 656 PlacesBefore, 656 PlacesAfterwards, 2313 TransitionsBefore, 2313 TransitionsAfterwards, 6296 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: 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: 8, independent: 5, independent conditional: 5, 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): 3291, Positive cache size: 3291, Positive conditional cache size: 3291, 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 executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 847.2s, OverallIterations: 50, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 780.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 80 mSolverCounterUnknown, 5064 SdHoareTripleChecker+Valid, 279.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5064 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 276.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19018 IncrementalHoareTripleChecker+Invalid, 25444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6346 mSolverCounterUnsat, 0 mSDtfsCounter, 19018 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1517 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 1012 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6312 ImplicationChecksByTransitivity, 166.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105101occurred in iteration=49, InterpolantAutomatonStates: 735, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 1009 NumberOfCodeBlocks, 1009 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 1311 ConstructedInterpolants, 275 QuantifiedInterpolants, 33643 SizeOfPredicates, 35 NumberOfNonLiveVariables, 6904 ConjunctsInSsa, 706 ConjunctsInUnsatCore, 136 InterpolantComputations, 9 PerfectInterpolantSequences, 50/367 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