/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:01:10,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:01:10,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:01:10,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:01:10,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:01:10,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:01:10,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:01:10,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:01:10,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:01:10,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:01:10,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:01:10,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:01:10,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:01:10,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:01:10,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:01:10,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:01:10,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:01:10,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:01:10,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:01:10,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:01:10,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:01:10,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:01:10,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:01:10,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:01:10,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:01:10,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:01:10,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:01:11,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:01:11,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:01:11,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:01:11,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:01:11,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:01:11,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:01:11,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:01:11,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:01:11,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:01:11,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:01:11,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:01:11,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:01:11,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:01:11,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:01:11,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:01:11,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:01:11,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:01:11,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:01:11,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:01:11,075 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:01:11,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:01:11,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:01:11,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:01:11,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:01:11,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:01:11,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:01:11,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:01:11,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:01:11,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:01:11,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:01:11,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:01:11,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:01:11,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:01:11,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:01:11,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:01:11,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:01:11,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:11,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:01:11,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:01:11,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:01:11,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:01:11,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:01:11,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:01:11,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:01:11,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:01:11,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:01:11,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:01:11,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:01:11,626 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:01:11,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-6.i [2022-12-06 06:01:13,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:01:13,774 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:01:13,774 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i [2022-12-06 06:01:13,789 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ad2d9ea/3db92f3ecb4446c9886993f17c49e766/FLAGca1d5d54a [2022-12-06 06:01:13,816 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ad2d9ea/3db92f3ecb4446c9886993f17c49e766 [2022-12-06 06:01:13,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:01:13,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:01:13,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:13,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:01:13,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:01:13,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f25b852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13, skipping insertion in model container [2022-12-06 06:01:13,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:01:13,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:01:14,299 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i[30241,30254] [2022-12-06 06:01:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:14,378 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:01:14,431 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i[30241,30254] [2022-12-06 06:01:14,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:14,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:14,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:14,523 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:01:14,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14 WrapperNode [2022-12-06 06:01:14,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:14,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:14,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:01:14,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:01:14,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,622 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-06 06:01:14,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:14,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:01:14,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:01:14,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:01:14,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:01:14,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:01:14,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:01:14,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:01:14,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (1/1) ... [2022-12-06 06:01:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:14,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:14,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:01:14,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:01:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:01:14,806 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:01:14,806 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:01:14,806 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:01:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:01:14,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:01:14,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:01:14,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:01:14,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:01:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:01:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:01:14,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:01:14,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:01:14,810 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:01:15,018 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:01:15,020 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:01:15,286 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:01:15,292 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:01:15,292 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 06:01:15,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:15 BoogieIcfgContainer [2022-12-06 06:01:15,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:01:15,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:01:15,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:01:15,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:01:15,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:01:13" (1/3) ... [2022-12-06 06:01:15,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53158162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:15, skipping insertion in model container [2022-12-06 06:01:15,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:14" (2/3) ... [2022-12-06 06:01:15,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53158162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:15, skipping insertion in model container [2022-12-06 06:01:15,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:15" (3/3) ... [2022-12-06 06:01:15,334 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-6.i [2022-12-06 06:01:15,374 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:01:15,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:01:15,379 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:01:15,492 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:01:15,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 06:01:15,612 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 06:01:15,612 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:15,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 06:01:15,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 06:01:15,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:15,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:15,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:15,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:15,716 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 06:01:15,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:15,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 06:01:15,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:15,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 06:01:19,513 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-06 06:01:19,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:01:19,534 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;@4ae91088, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:01:19,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 06:01:19,537 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-06 06:01:19,537 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:19,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:19,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:01:19,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:19,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-06 06:01:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:19,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252359914] [2022-12-06 06:01:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:19,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:19,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252359914] [2022-12-06 06:01:19,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252359914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:19,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:19,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:01:19,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019726935] [2022-12-06 06:01:19,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:01:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:01:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:01:19,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:19,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 34 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:19,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:19,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:19,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:19,857 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 06:01:19,857 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:01:19,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 149 events. 97/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 20 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 300. Up to 91 conditions per place. [2022-12-06 06:01:19,860 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-06 06:01:19,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-06 06:01:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:01:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:01:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:01:19,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:01:19,875 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:01:19,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-06 06:01:19,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:19,880 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:19,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=14} [2022-12-06 06:01:19,887 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 06:01:19,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:19,888 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:19,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:19,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:19,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:19,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:19,903 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 06:01:19,903 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:19,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 14 events. 3/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2022-12-06 06:01:19,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:19,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 06:01:19,905 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:19,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:01:19,910 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:19,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:19,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:19,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:19,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:01:19,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-06 06:01:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:19,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075759537] [2022-12-06 06:01:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:19,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075759537] [2022-12-06 06:01:19,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075759537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:19,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963504787] [2022-12-06 06:01:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:19,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:19,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:20,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:20,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 06:01:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:20,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:20,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:20,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963504787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:20,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:20,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624364381] [2022-12-06 06:01:20,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:20,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:20,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:20,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:01:20,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:20,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:20,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:01:20,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:20,294 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:20,295 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:20,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 203 events. 133/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 06:01:20,300 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:20,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-06 06:01:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:20,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 06:01:20,304 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:20,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-06 06:01:20,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:01:20,306 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 06:01:20,307 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:20,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:20,307 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:20,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:20,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,312 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:20,312 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:20,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 06:01:20,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:20,558 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:20,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 06:01:20,559 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:20,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:20,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:20,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:20,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:20,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:20,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-06 06:01:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:20,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532496401] [2022-12-06 06:01:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:20,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532496401] [2022-12-06 06:01:20,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532496401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:20,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841822820] [2022-12-06 06:01:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:20,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:20,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 06:01:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:20,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:20,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:20,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841822820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:20,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:20,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798927153] [2022-12-06 06:01:20,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:20,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:20,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:20,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:20,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:20,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:21,046 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:21,047 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 06:01:21,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-06 06:01:21,051 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:21,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:21,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:01:21,053 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:21,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:21,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:21,062 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:21,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 06:01:21,064 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:21,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:21,064 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:21,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:21,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:21,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:21,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:21,069 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:21,069 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:21,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-06 06:01:21,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:21,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:21,301 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:21,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 06:01:21,302 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:21,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:21,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:21,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:21,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:21,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 06:01:21,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:21,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-06 06:01:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:21,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315366958] [2022-12-06 06:01:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:21,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315366958] [2022-12-06 06:01:21,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315366958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:21,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056000238] [2022-12-06 06:01:21,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:21,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:21,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:21,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 06:01:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:21,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:21,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:21,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056000238] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:21,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:21,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:21,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160185014] [2022-12-06 06:01:21,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:21,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:21,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:21,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:21,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:21,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:21,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:21,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:21,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:21,792 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:21,793 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-06 06:01:21,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 176 events. 115/176 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 489. Up to 64 conditions per place. [2022-12-06 06:01:21,794 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:21,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-06 06:01:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:21,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:21,808 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:21,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-06 06:01:21,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:21,815 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 06:01:21,820 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:21,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:21,820 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:21,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:21,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,843 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:21,843 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:21,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 06:01:21,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:21,995 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:21,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 06:01:21,996 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:21,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:21,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:21,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:22,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:22,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:22,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149196, now seen corresponding path program 1 times [2022-12-06 06:01:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:22,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450328972] [2022-12-06 06:01:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:22,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:22,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450328972] [2022-12-06 06:01:22,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450328972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:22,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018086748] [2022-12-06 06:01:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:22,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:22,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:22,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 06:01:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:22,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:22,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018086748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:22,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:22,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952816876] [2022-12-06 06:01:22,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:22,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:22,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:22,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:22,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:22,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:22,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:22,515 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:22,515 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:22,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 06:01:22,517 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:22,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:22,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:22,520 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:22,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:22,522 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 06:01:22,523 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:22,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:22,523 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:22,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:22,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,527 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:22,527 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:22,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 06:01:22,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:22,901 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:22,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 379 [2022-12-06 06:01:22,902 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:22,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:22,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:22,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:22,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:23,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:23,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149134, now seen corresponding path program 1 times [2022-12-06 06:01:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:23,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418732256] [2022-12-06 06:01:23,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:23,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:23,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418732256] [2022-12-06 06:01:23,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418732256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:23,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900521059] [2022-12-06 06:01:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:23,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:23,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:23,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 06:01:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:23,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:23,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:23,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900521059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:23,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:23,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193498144] [2022-12-06 06:01:23,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:23,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:23,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:23,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:23,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:23,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:23,393 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:23,393 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:23,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 06:01:23,394 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:23,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:23,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:23,397 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:23,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:23,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:23,399 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-06 06:01:23,402 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:23,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:23,402 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:23,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:23,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,406 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:23,406 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:23,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-06 06:01:23,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:23,571 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:23,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 06:01:23,573 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:23,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:23,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:23,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:23,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:23,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:23,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149072, now seen corresponding path program 1 times [2022-12-06 06:01:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:23,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876478479] [2022-12-06 06:01:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876478479] [2022-12-06 06:01:23,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876478479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894316056] [2022-12-06 06:01:23,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:23,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:23,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:23,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:23,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 06:01:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:23,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:23,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:23,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894316056] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:23,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:23,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-06 06:01:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772167718] [2022-12-06 06:01:23,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:24,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:01:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:01:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:01:24,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:24,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:24,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:24,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:24,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:24,076 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 06:01:24,076 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 06:01:24,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 149 events. 97/149 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 20 based on Foata normal form. 9/126 useless extension candidates. Maximal degree in co-relation 399. Up to 64 conditions per place. [2022-12-06 06:01:24,077 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 06:01:24,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-06 06:01:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:01:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:01:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 06:01:24,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:01:24,079 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-06 06:01:24,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-06 06:01:24,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 122 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:24,081 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-06 06:01:24,082 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 06:01:24,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:24,083 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:24,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:24,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,086 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 06:01:24,086 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:24,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 15 events. 3/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 24. Up to 5 conditions per place. [2022-12-06 06:01:24,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:01:24,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:24,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 06:01:24,202 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-06 06:01:24,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:24,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:24,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:24,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:24,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149041, now seen corresponding path program 1 times [2022-12-06 06:01:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:24,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824788273] [2022-12-06 06:01:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:24,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824788273] [2022-12-06 06:01:24,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824788273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:24,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257214347] [2022-12-06 06:01:24,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:24,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:24,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:24,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 06:01:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 06:01:24,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:24,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:24,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257214347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:24,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:24,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-06 06:01:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799934937] [2022-12-06 06:01:24,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:24,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:01:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:24,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:01:24,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:01:24,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:24,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 50 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:24,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:24,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:24,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:25,053 INFO L130 PetriNetUnfolder]: 247/378 cut-off events. [2022-12-06 06:01:25,053 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 06:01:25,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 378 events. 247/378 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1184 event pairs, 31 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 973. Up to 167 conditions per place. [2022-12-06 06:01:25,057 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 45 selfloop transitions, 19 changer transitions 0/64 dead transitions. [2022-12-06 06:01:25,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 64 transitions, 318 flow [2022-12-06 06:01:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:01:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:01:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-06 06:01:25,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:01:25,074 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-06 06:01:25,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 64 transitions, 318 flow [2022-12-06 06:01:25,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 64 transitions, 288 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:25,076 INFO L231 Difference]: Finished difference. Result has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=28, PETRI_TRANSITIONS=33} [2022-12-06 06:01:25,080 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 10 predicate places. [2022-12-06 06:01:25,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:25,080 INFO L89 Accepts]: Start accepts. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:25,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:25,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,094 INFO L130 PetriNetUnfolder]: 35/74 cut-off events. [2022-12-06 06:01:25,094 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 06:01:25,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 74 events. 35/74 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 199 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 184. Up to 41 conditions per place. [2022-12-06 06:01:25,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 06:01:25,166 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:01:25,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6) (= 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 06:01:25,358 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:01:25,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6) (= 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 06:01:25,641 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:25,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 562 [2022-12-06 06:01:25,642 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 32 transitions, 179 flow [2022-12-06 06:01:25,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:25,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:25,642 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:25,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:25,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:25,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 66809608, now seen corresponding path program 1 times [2022-12-06 06:01:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:25,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712004810] [2022-12-06 06:01:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:26,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712004810] [2022-12-06 06:01:26,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712004810] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:26,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707688058] [2022-12-06 06:01:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:26,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:26,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:26,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:26,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 06:01:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:26,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:26,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:26,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:26,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707688058] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:26,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:26,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311282311] [2022-12-06 06:01:26,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:26,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:26,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:26,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:26,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:01:26,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 32 transitions, 179 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:26,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:26,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:01:26,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:27,296 INFO L130 PetriNetUnfolder]: 623/945 cut-off events. [2022-12-06 06:01:27,297 INFO L131 PetriNetUnfolder]: For 1397/1397 co-relation queries the response was YES. [2022-12-06 06:01:27,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 945 events. 623/945 cut-off events. For 1397/1397 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3820 event pairs, 35 based on Foata normal form. 38/983 useless extension candidates. Maximal degree in co-relation 2900. Up to 370 conditions per place. [2022-12-06 06:01:27,325 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 89 selfloop transitions, 67 changer transitions 1/157 dead transitions. [2022-12-06 06:01:27,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 157 transitions, 968 flow [2022-12-06 06:01:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:01:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:01:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2022-12-06 06:01:27,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.446875 [2022-12-06 06:01:27,342 INFO L175 Difference]: Start difference. First operand has 27 places, 32 transitions, 179 flow. Second operand 16 states and 143 transitions. [2022-12-06 06:01:27,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 157 transitions, 968 flow [2022-12-06 06:01:27,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 157 transitions, 922 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-06 06:01:27,366 INFO L231 Difference]: Finished difference. Result has 46 places, 84 transitions, 612 flow [2022-12-06 06:01:27,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=612, PETRI_PLACES=46, PETRI_TRANSITIONS=84} [2022-12-06 06:01:27,380 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 28 predicate places. [2022-12-06 06:01:27,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:27,380 INFO L89 Accepts]: Start accepts. Operand has 46 places, 84 transitions, 612 flow [2022-12-06 06:01:27,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:27,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:27,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 84 transitions, 612 flow [2022-12-06 06:01:27,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 84 transitions, 612 flow [2022-12-06 06:01:27,396 INFO L130 PetriNetUnfolder]: 89/180 cut-off events. [2022-12-06 06:01:27,396 INFO L131 PetriNetUnfolder]: For 373/376 co-relation queries the response was YES. [2022-12-06 06:01:27,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 180 events. 89/180 cut-off events. For 373/376 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 720 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 617. Up to 119 conditions per place. [2022-12-06 06:01:27,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 84 transitions, 612 flow [2022-12-06 06:01:27,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 06:01:27,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L705-6-->L705-6: Formula: (and (= v_~prev~0_173 (+ (* 610 v_~cur~0_146) (* 377 v_~prev~0_175))) (< v_~x~0_161 0) (= v_~cur~0_144 v_~next~0_91) (= (+ (* 377 v_~cur~0_146) v_~prev~0_173 (* 233 v_~prev~0_175)) v_~next~0_91) (= v_~x~0_159 (+ 15 v_~x~0_161))) InVars {~prev~0=v_~prev~0_175, ~cur~0=v_~cur~0_146, ~x~0=v_~x~0_161} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_97|, ~next~0=v_~next~0_91, ~prev~0=v_~prev~0_173, ~cur~0=v_~cur~0_144, ~x~0=v_~x~0_159} 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 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:01:27,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L705-6-->L705-6: Formula: (and (= v_~prev~0_173 (+ (* 610 v_~cur~0_146) (* 377 v_~prev~0_175))) (< v_~x~0_161 0) (= v_~cur~0_144 v_~next~0_91) (= (+ (* 377 v_~cur~0_146) v_~prev~0_173 (* 233 v_~prev~0_175)) v_~next~0_91) (= v_~x~0_159 (+ 15 v_~x~0_161))) InVars {~prev~0=v_~prev~0_175, ~cur~0=v_~cur~0_146, ~x~0=v_~x~0_161} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_97|, ~next~0=v_~next~0_91, ~prev~0=v_~prev~0_173, ~cur~0=v_~cur~0_144, ~x~0=v_~x~0_159} 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 6) (= 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 06:01:27,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= 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 [345] L705-6-->L687-5: Formula: (and (= v_~next~0_81 (+ (* 233 v_~cur~0_127) v_~prev~0_155 (* 144 v_~prev~0_156))) (= (+ v_~j~0_119 v_~i~0_104) v_~i~0_103) (= v_~cur~0_126 v_~next~0_81) (< v_~p~0_40 6) (= v_~p~0_39 (+ v_~p~0_40 1)) (< v_~x~0_142 1) (= (+ 14 v_~x~0_142) v_~x~0_141) (= (+ (* 377 v_~cur~0_127) (* 233 v_~prev~0_156)) v_~prev~0_155)) InVars {~j~0=v_~j~0_119, ~prev~0=v_~prev~0_156, ~i~0=v_~i~0_104, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_142} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~j~0=v_~j~0_119, ~next~0=v_~next~0_81, ~prev~0=v_~prev~0_155, ~i~0=v_~i~0_103, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_126, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-06 06:01:27,800 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:27,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-06 06:01:27,801 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 84 transitions, 630 flow [2022-12-06 06:01:27,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:27,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:27,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:27,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:28,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 06:01:28,002 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1106198516, now seen corresponding path program 1 times [2022-12-06 06:01:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:28,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936023953] [2022-12-06 06:01:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936023953] [2022-12-06 06:01:28,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936023953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349422426] [2022-12-06 06:01:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:28,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:28,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:28,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:28,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 06:01:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:28,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:28,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:28,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:01:28,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349422426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:28,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:01:28,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 06:01:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476576653] [2022-12-06 06:01:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:28,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:01:28,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:01:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:01:28,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 06:01:28,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 84 transitions, 630 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:28,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:28,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 06:01:28,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:28,402 INFO L130 PetriNetUnfolder]: 344/561 cut-off events. [2022-12-06 06:01:28,403 INFO L131 PetriNetUnfolder]: For 1663/1663 co-relation queries the response was YES. [2022-12-06 06:01:28,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 561 events. 344/561 cut-off events. For 1663/1663 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2237 event pairs, 153 based on Foata normal form. 81/626 useless extension candidates. Maximal degree in co-relation 1855. Up to 337 conditions per place. [2022-12-06 06:01:28,408 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2022-12-06 06:01:28,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 490 flow [2022-12-06 06:01:28,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:01:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:01:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 06:01:28,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 06:01:28,410 INFO L175 Difference]: Start difference. First operand has 45 places, 84 transitions, 630 flow. Second operand 4 states and 32 transitions. [2022-12-06 06:01:28,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 490 flow [2022-12-06 06:01:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 431 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:28,417 INFO L231 Difference]: Finished difference. Result has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:28,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=39, PETRI_TRANSITIONS=47} [2022-12-06 06:01:28,417 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 21 predicate places. [2022-12-06 06:01:28,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:28,418 INFO L89 Accepts]: Start accepts. Operand has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:28,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:28,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:28,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:28,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 47 transitions, 309 flow [2022-12-06 06:01:28,428 INFO L130 PetriNetUnfolder]: 48/121 cut-off events. [2022-12-06 06:01:28,428 INFO L131 PetriNetUnfolder]: For 233/247 co-relation queries the response was YES. [2022-12-06 06:01:28,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 121 events. 48/121 cut-off events. For 233/247 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 479 event pairs, 0 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 318. Up to 34 conditions per place. [2022-12-06 06:01:28,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 309 flow [2022-12-06 06:01:28,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:01:28,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:28,522 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 06:01:28,522 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 315 flow [2022-12-06 06:01:28,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:28,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:28,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:28,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:28,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 06:01:28,723 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1429431455, now seen corresponding path program 1 times [2022-12-06 06:01:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:28,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067468660] [2022-12-06 06:01:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:29,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067468660] [2022-12-06 06:01:29,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067468660] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:29,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015476670] [2022-12-06 06:01:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:29,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:29,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:29,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:29,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 06:01:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:29,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:29,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:29,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:29,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015476670] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:29,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:29,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 06:01:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337804128] [2022-12-06 06:01:29,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:29,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:01:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:01:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:01:29,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:01:29,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 315 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:29,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:29,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:01:29,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:29,938 INFO L130 PetriNetUnfolder]: 402/671 cut-off events. [2022-12-06 06:01:29,939 INFO L131 PetriNetUnfolder]: For 1204/1204 co-relation queries the response was YES. [2022-12-06 06:01:29,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 671 events. 402/671 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2922 event pairs, 40 based on Foata normal form. 26/681 useless extension candidates. Maximal degree in co-relation 2027. Up to 383 conditions per place. [2022-12-06 06:01:29,943 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-06 06:01:29,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 101 transitions, 700 flow [2022-12-06 06:01:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:01:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:01:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 06:01:29,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 06:01:29,945 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 315 flow. Second operand 10 states and 74 transitions. [2022-12-06 06:01:29,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 101 transitions, 700 flow [2022-12-06 06:01:29,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 101 transitions, 683 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:29,950 INFO L231 Difference]: Finished difference. Result has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:29,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=581, PETRI_PLACES=51, PETRI_TRANSITIONS=68} [2022-12-06 06:01:29,950 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 33 predicate places. [2022-12-06 06:01:29,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:29,950 INFO L89 Accepts]: Start accepts. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:29,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:29,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:29,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:29,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:29,988 INFO L130 PetriNetUnfolder]: 63/155 cut-off events. [2022-12-06 06:01:29,989 INFO L131 PetriNetUnfolder]: For 408/436 co-relation queries the response was YES. [2022-12-06 06:01:29,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 155 events. 63/155 cut-off events. For 408/436 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 681 event pairs, 1 based on Foata normal form. 5/157 useless extension candidates. Maximal degree in co-relation 548. Up to 48 conditions per place. [2022-12-06 06:01:29,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:29,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:01:30,662 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:30,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 712 [2022-12-06 06:01:30,663 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 68 transitions, 598 flow [2022-12-06 06:01:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:30,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:30,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:30,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:30,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 06:01:30,864 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 67842962, now seen corresponding path program 1 times [2022-12-06 06:01:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:30,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40774868] [2022-12-06 06:01:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:31,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40774868] [2022-12-06 06:01:31,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40774868] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248177903] [2022-12-06 06:01:31,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:31,116 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:31,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 06:01:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:31,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:31,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:31,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:31,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248177903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:31,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:31,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560980334] [2022-12-06 06:01:31,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:31,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:31,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:31,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:01:31,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 68 transitions, 598 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:31,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:31,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:01:31,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:32,113 INFO L130 PetriNetUnfolder]: 548/935 cut-off events. [2022-12-06 06:01:32,114 INFO L131 PetriNetUnfolder]: For 3108/3108 co-relation queries the response was YES. [2022-12-06 06:01:32,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 935 events. 548/935 cut-off events. For 3108/3108 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4547 event pairs, 31 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 3268. Up to 295 conditions per place. [2022-12-06 06:01:32,121 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 73 selfloop transitions, 97 changer transitions 0/170 dead transitions. [2022-12-06 06:01:32,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 170 transitions, 1411 flow [2022-12-06 06:01:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:01:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:01:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 06:01:32,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33229813664596275 [2022-12-06 06:01:32,122 INFO L175 Difference]: Start difference. First operand has 51 places, 68 transitions, 598 flow. Second operand 14 states and 107 transitions. [2022-12-06 06:01:32,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 170 transitions, 1411 flow [2022-12-06 06:01:32,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 170 transitions, 1374 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:32,140 INFO L231 Difference]: Finished difference. Result has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1241, PETRI_PLACES=69, PETRI_TRANSITIONS=120} [2022-12-06 06:01:32,141 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 51 predicate places. [2022-12-06 06:01:32,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:32,141 INFO L89 Accepts]: Start accepts. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:32,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:32,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,176 INFO L130 PetriNetUnfolder]: 81/205 cut-off events. [2022-12-06 06:01:32,176 INFO L131 PetriNetUnfolder]: For 779/811 co-relation queries the response was YES. [2022-12-06 06:01:32,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 205 events. 81/205 cut-off events. For 779/811 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1023 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 895. Up to 86 conditions per place. [2022-12-06 06:01:32,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 06:01:32,180 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:32,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 06:01:32,181 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:32,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:32,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:32,181 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:32,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:32,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 06:01:32,388 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1362345130, now seen corresponding path program 1 times [2022-12-06 06:01:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:32,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408242212] [2022-12-06 06:01:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:32,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:32,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408242212] [2022-12-06 06:01:32,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408242212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:32,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358863612] [2022-12-06 06:01:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:32,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:32,639 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:32,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 06:01:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:32,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:32,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:32,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:33,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358863612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:33,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:33,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:33,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689512200] [2022-12-06 06:01:33,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:33,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:33,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:33,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:33,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:01:33,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 120 transitions, 1241 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:33,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:33,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:01:33,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:33,556 INFO L130 PetriNetUnfolder]: 592/1023 cut-off events. [2022-12-06 06:01:33,556 INFO L131 PetriNetUnfolder]: For 5402/5402 co-relation queries the response was YES. [2022-12-06 06:01:33,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1023 events. 592/1023 cut-off events. For 5402/5402 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5179 event pairs, 68 based on Foata normal form. 24/1028 useless extension candidates. Maximal degree in co-relation 4181. Up to 656 conditions per place. [2022-12-06 06:01:33,565 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 113 selfloop transitions, 61 changer transitions 0/174 dead transitions. [2022-12-06 06:01:33,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1819 flow [2022-12-06 06:01:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:01:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:01:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 06:01:33,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-06 06:01:33,566 INFO L175 Difference]: Start difference. First operand has 69 places, 120 transitions, 1241 flow. Second operand 11 states and 82 transitions. [2022-12-06 06:01:33,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1819 flow [2022-12-06 06:01:33,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1737 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:33,586 INFO L231 Difference]: Finished difference. Result has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:33,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1515, PETRI_PLACES=80, PETRI_TRANSITIONS=138} [2022-12-06 06:01:33,587 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 62 predicate places. [2022-12-06 06:01:33,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:33,588 INFO L89 Accepts]: Start accepts. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:33,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:33,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:33,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:33,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:33,628 INFO L130 PetriNetUnfolder]: 92/237 cut-off events. [2022-12-06 06:01:33,628 INFO L131 PetriNetUnfolder]: For 1021/1053 co-relation queries the response was YES. [2022-12-06 06:01:33,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 237 events. 92/237 cut-off events. For 1021/1053 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1222 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 1104. Up to 106 conditions per place. [2022-12-06 06:01:33,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:33,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 06:01:33,762 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:33,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 06:01:33,764 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 138 transitions, 1526 flow [2022-12-06 06:01:33,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:33,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:33,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:33,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:33,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 06:01:33,970 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash 548600044, now seen corresponding path program 1 times [2022-12-06 06:01:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:33,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276801650] [2022-12-06 06:01:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:34,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:34,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276801650] [2022-12-06 06:01:34,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276801650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:34,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406405666] [2022-12-06 06:01:34,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:34,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:34,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:34,129 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:34,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 06:01:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:34,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:34,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:34,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:34,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 06:01:34,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406405666] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:34,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:34,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795061604] [2022-12-06 06:01:34,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:34,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:34,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:34,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:01:34,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 138 transitions, 1526 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:34,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:34,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:01:34,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:35,426 INFO L130 PetriNetUnfolder]: 706/1215 cut-off events. [2022-12-06 06:01:35,427 INFO L131 PetriNetUnfolder]: For 6309/6309 co-relation queries the response was YES. [2022-12-06 06:01:35,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5231 conditions, 1215 events. 706/1215 cut-off events. For 6309/6309 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6395 event pairs, 44 based on Foata normal form. 14/1210 useless extension candidates. Maximal degree in co-relation 5194. Up to 676 conditions per place. [2022-12-06 06:01:35,467 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 128 selfloop transitions, 96 changer transitions 2/226 dead transitions. [2022-12-06 06:01:35,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 226 transitions, 2420 flow [2022-12-06 06:01:35,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:01:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:01:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-12-06 06:01:35,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26 [2022-12-06 06:01:35,490 INFO L175 Difference]: Start difference. First operand has 80 places, 138 transitions, 1526 flow. Second operand 18 states and 117 transitions. [2022-12-06 06:01:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 226 transitions, 2420 flow [2022-12-06 06:01:35,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 2358 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:35,612 INFO L231 Difference]: Finished difference. Result has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:35,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2118, PETRI_PLACES=99, PETRI_TRANSITIONS=170} [2022-12-06 06:01:35,612 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 81 predicate places. [2022-12-06 06:01:35,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:35,613 INFO L89 Accepts]: Start accepts. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:35,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:35,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:35,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:35,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:35,649 INFO L130 PetriNetUnfolder]: 109/282 cut-off events. [2022-12-06 06:01:35,649 INFO L131 PetriNetUnfolder]: For 1460/1516 co-relation queries the response was YES. [2022-12-06 06:01:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 282 events. 109/282 cut-off events. For 1460/1516 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1587 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 1480. Up to 125 conditions per place. [2022-12-06 06:01:35,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:35,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 06:01:36,148 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 6)) 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 [344] L705-6-->L695-5: Formula: (and (= v_~prev~0_151 (+ (* 233 v_~prev~0_152) (* 377 v_~cur~0_123))) (< v_~x~0_138 1) (< v_~q~0_56 6) (= (+ (* 233 v_~cur~0_123) v_~prev~0_151 (* 144 v_~prev~0_152)) v_~next~0_79) (= v_~j~0_115 (+ v_~j~0_116 v_~i~0_101)) (= v_~q~0_55 (+ v_~q~0_56 1)) (= (+ 14 v_~x~0_138) v_~x~0_137) (= v_~cur~0_122 v_~next~0_79)) InVars {~j~0=v_~j~0_116, ~prev~0=v_~prev~0_152, ~i~0=v_~i~0_101, ~q~0=v_~q~0_56, ~cur~0=v_~cur~0_123, ~x~0=v_~x~0_138} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_85|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_79, ~prev~0=v_~prev~0_151, ~i~0=v_~i~0_101, ~q~0=v_~q~0_55, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_38|, ~cur~0=v_~cur~0_122, ~x~0=v_~x~0_137} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 06:01:36,335 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:01:36,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-06 06:01:36,335 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 170 transitions, 2154 flow [2022-12-06 06:01:36,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:36,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:36,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:36,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:36,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 06:01:36,536 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1362135353, now seen corresponding path program 1 times [2022-12-06 06:01:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:36,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119523544] [2022-12-06 06:01:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119523544] [2022-12-06 06:01:36,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119523544] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327481582] [2022-12-06 06:01:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:36,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:36,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:36,712 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:36,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 06:01:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:36,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:01:36,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:36,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:37,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327481582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:37,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:37,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801791606] [2022-12-06 06:01:37,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:37,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:37,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:01:37,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 170 transitions, 2154 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:37,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:37,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:01:37,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:37,657 INFO L130 PetriNetUnfolder]: 874/1499 cut-off events. [2022-12-06 06:01:37,658 INFO L131 PetriNetUnfolder]: For 12598/12598 co-relation queries the response was YES. [2022-12-06 06:01:37,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1499 events. 874/1499 cut-off events. For 12598/12598 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8353 event pairs, 49 based on Foata normal form. 22/1502 useless extension candidates. Maximal degree in co-relation 7150. Up to 501 conditions per place. [2022-12-06 06:01:37,676 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 103 selfloop transitions, 152 changer transitions 0/255 dead transitions. [2022-12-06 06:01:37,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 255 transitions, 3262 flow [2022-12-06 06:01:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:01:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:01:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-12-06 06:01:37,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-06 06:01:37,678 INFO L175 Difference]: Start difference. First operand has 99 places, 170 transitions, 2154 flow. Second operand 12 states and 107 transitions. [2022-12-06 06:01:37,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 255 transitions, 3262 flow [2022-12-06 06:01:37,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 255 transitions, 3132 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-12-06 06:01:37,762 INFO L231 Difference]: Finished difference. Result has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:37,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2974, PETRI_PLACES=107, PETRI_TRANSITIONS=206} [2022-12-06 06:01:37,762 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 89 predicate places. [2022-12-06 06:01:37,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:37,763 INFO L89 Accepts]: Start accepts. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:37,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:37,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:37,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:37,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:37,820 INFO L130 PetriNetUnfolder]: 137/352 cut-off events. [2022-12-06 06:01:37,820 INFO L131 PetriNetUnfolder]: For 2822/2908 co-relation queries the response was YES. [2022-12-06 06:01:37,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 352 events. 137/352 cut-off events. For 2822/2908 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2139 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 2176. Up to 169 conditions per place. [2022-12-06 06:01:37,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:37,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 06:01:37,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:37,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 06:01:37,883 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 206 transitions, 2978 flow [2022-12-06 06:01:37,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:37,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:37,883 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:37,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:38,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:38,089 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1362077011, now seen corresponding path program 1 times [2022-12-06 06:01:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:38,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720078027] [2022-12-06 06:01:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:38,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:38,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720078027] [2022-12-06 06:01:38,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720078027] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:38,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677367495] [2022-12-06 06:01:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:38,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:38,262 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:38,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 06:01:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:38,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:38,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:38,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677367495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:38,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:38,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:38,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714738096] [2022-12-06 06:01:38,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:38,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:38,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:38,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:38,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:38,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:01:38,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 206 transitions, 2978 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:38,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:38,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:01:38,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:39,368 INFO L130 PetriNetUnfolder]: 914/1579 cut-off events. [2022-12-06 06:01:39,369 INFO L131 PetriNetUnfolder]: For 20255/20255 co-relation queries the response was YES. [2022-12-06 06:01:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 1579 events. 914/1579 cut-off events. For 20255/20255 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8902 event pairs, 102 based on Foata normal form. 32/1586 useless extension candidates. Maximal degree in co-relation 8328. Up to 1020 conditions per place. [2022-12-06 06:01:39,395 INFO L137 encePairwiseOnDemand]: 8/31 looper letters, 155 selfloop transitions, 108 changer transitions 2/265 dead transitions. [2022-12-06 06:01:39,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 265 transitions, 3844 flow [2022-12-06 06:01:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:01:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:01:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-06 06:01:39,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2456575682382134 [2022-12-06 06:01:39,397 INFO L175 Difference]: Start difference. First operand has 107 places, 206 transitions, 2978 flow. Second operand 13 states and 99 transitions. [2022-12-06 06:01:39,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 265 transitions, 3844 flow [2022-12-06 06:01:39,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 265 transitions, 3743 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:39,484 INFO L231 Difference]: Finished difference. Result has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:39,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3473, PETRI_PLACES=118, PETRI_TRANSITIONS=222} [2022-12-06 06:01:39,486 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 100 predicate places. [2022-12-06 06:01:39,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:39,486 INFO L89 Accepts]: Start accepts. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:39,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:39,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:39,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:39,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:39,530 INFO L130 PetriNetUnfolder]: 147/382 cut-off events. [2022-12-06 06:01:39,530 INFO L131 PetriNetUnfolder]: For 3538/3666 co-relation queries the response was YES. [2022-12-06 06:01:39,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 382 events. 147/382 cut-off events. For 3538/3666 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2353 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 2522. Up to 183 conditions per place. [2022-12-06 06:01:39,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 06:01:39,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-06 06:01:39,663 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:39,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 06:01:39,664 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 222 transitions, 3485 flow [2022-12-06 06:01:39,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:39,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:39,664 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:39,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:39,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 06:01:39,865 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 549156463, now seen corresponding path program 1 times [2022-12-06 06:01:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:39,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758959737] [2022-12-06 06:01:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:40,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758959737] [2022-12-06 06:01:40,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758959737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:40,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658435618] [2022-12-06 06:01:40,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:40,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:40,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:40,019 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:40,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 06:01:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:40,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:40,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:40,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:40,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658435618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:40,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:40,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:40,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706589623] [2022-12-06 06:01:40,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:40,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:40,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:40,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:40,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:40,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:01:40,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 222 transitions, 3485 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:40,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:40,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:01:40,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:41,241 INFO L130 PetriNetUnfolder]: 1032/1791 cut-off events. [2022-12-06 06:01:41,242 INFO L131 PetriNetUnfolder]: For 20894/20894 co-relation queries the response was YES. [2022-12-06 06:01:41,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 1791 events. 1032/1791 cut-off events. For 20894/20894 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 10508 event pairs, 88 based on Foata normal form. 20/1786 useless extension candidates. Maximal degree in co-relation 9859. Up to 1048 conditions per place. [2022-12-06 06:01:41,285 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 167 selfloop transitions, 150 changer transitions 3/320 dead transitions. [2022-12-06 06:01:41,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 320 transitions, 4900 flow [2022-12-06 06:01:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:01:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:01:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-06 06:01:41,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22348484848484848 [2022-12-06 06:01:41,300 INFO L175 Difference]: Start difference. First operand has 118 places, 222 transitions, 3485 flow. Second operand 16 states and 118 transitions. [2022-12-06 06:01:41,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 320 transitions, 4900 flow [2022-12-06 06:01:41,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 320 transitions, 4802 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:41,424 INFO L231 Difference]: Finished difference. Result has 133 places, 265 transitions, 4573 flow [2022-12-06 06:01:41,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4573, PETRI_PLACES=133, PETRI_TRANSITIONS=265} [2022-12-06 06:01:41,431 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 115 predicate places. [2022-12-06 06:01:41,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:41,431 INFO L89 Accepts]: Start accepts. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 06:01:41,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:41,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:41,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 06:01:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 06:01:41,517 INFO L130 PetriNetUnfolder]: 168/439 cut-off events. [2022-12-06 06:01:41,517 INFO L131 PetriNetUnfolder]: For 4068/4158 co-relation queries the response was YES. [2022-12-06 06:01:41,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3177 conditions, 439 events. 168/439 cut-off events. For 4068/4158 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2860 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 3126. Up to 210 conditions per place. [2022-12-06 06:01:41,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 06:01:41,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-06 06:01:41,525 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:41,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 06:01:41,526 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 265 transitions, 4573 flow [2022-12-06 06:01:41,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:41,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:41,527 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:41,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:41,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 06:01:41,749 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 550395192, now seen corresponding path program 1 times [2022-12-06 06:01:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:41,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579842390] [2022-12-06 06:01:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:42,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579842390] [2022-12-06 06:01:42,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579842390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:42,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477810052] [2022-12-06 06:01:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:42,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:42,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:42,044 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:42,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 06:01:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:42,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:42,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:42,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:42,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477810052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:42,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:42,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669496295] [2022-12-06 06:01:42,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:42,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:42,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:01:42,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 265 transitions, 4573 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:42,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:42,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:01:42,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:43,021 INFO L130 PetriNetUnfolder]: 1086/1899 cut-off events. [2022-12-06 06:01:43,021 INFO L131 PetriNetUnfolder]: For 24882/24882 co-relation queries the response was YES. [2022-12-06 06:01:43,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11345 conditions, 1899 events. 1086/1899 cut-off events. For 24882/24882 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 11378 event pairs, 109 based on Foata normal form. 20/1902 useless extension candidates. Maximal degree in co-relation 11291. Up to 1140 conditions per place. [2022-12-06 06:01:43,051 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 172 selfloop transitions, 158 changer transitions 1/331 dead transitions. [2022-12-06 06:01:43,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 331 transitions, 5803 flow [2022-12-06 06:01:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:01:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:01:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-06 06:01:43,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-06 06:01:43,055 INFO L175 Difference]: Start difference. First operand has 133 places, 265 transitions, 4573 flow. Second operand 13 states and 99 transitions. [2022-12-06 06:01:43,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 331 transitions, 5803 flow [2022-12-06 06:01:43,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 331 transitions, 5654 flow, removed 59 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:43,222 INFO L231 Difference]: Finished difference. Result has 144 places, 291 transitions, 5430 flow [2022-12-06 06:01:43,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4432, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5430, PETRI_PLACES=144, PETRI_TRANSITIONS=291} [2022-12-06 06:01:43,223 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 126 predicate places. [2022-12-06 06:01:43,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:43,223 INFO L89 Accepts]: Start accepts. Operand has 144 places, 291 transitions, 5430 flow [2022-12-06 06:01:43,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:43,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:43,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 291 transitions, 5430 flow [2022-12-06 06:01:43,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 291 transitions, 5430 flow [2022-12-06 06:01:43,307 INFO L130 PetriNetUnfolder]: 184/483 cut-off events. [2022-12-06 06:01:43,308 INFO L131 PetriNetUnfolder]: For 5341/5473 co-relation queries the response was YES. [2022-12-06 06:01:43,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 483 events. 184/483 cut-off events. For 5341/5473 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3224 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 3672. Up to 234 conditions per place. [2022-12-06 06:01:43,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 291 transitions, 5430 flow [2022-12-06 06:01:43,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-06 06:01:43,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:43,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 06:01:43,373 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 291 transitions, 5437 flow [2022-12-06 06:01:43,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:43,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:43,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:43,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:43,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 06:01:43,580 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash 725442746, now seen corresponding path program 1 times [2022-12-06 06:01:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:43,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910436079] [2022-12-06 06:01:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:43,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910436079] [2022-12-06 06:01:43,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910436079] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:43,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393891662] [2022-12-06 06:01:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:43,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:43,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:43,841 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:43,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 06:01:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:43,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:43,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:44,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393891662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:44,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:44,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:01:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146170047] [2022-12-06 06:01:44,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:01:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:44,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:01:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:01:44,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 06:01:44,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 291 transitions, 5437 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:44,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:44,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 06:01:44,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:45,181 INFO L130 PetriNetUnfolder]: 1356/2365 cut-off events. [2022-12-06 06:01:45,182 INFO L131 PetriNetUnfolder]: For 55414/55414 co-relation queries the response was YES. [2022-12-06 06:01:45,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14814 conditions, 2365 events. 1356/2365 cut-off events. For 55414/55414 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 14536 event pairs, 97 based on Foata normal form. 60/2408 useless extension candidates. Maximal degree in co-relation 14756. Up to 1026 conditions per place. [2022-12-06 06:01:45,205 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 184 selfloop transitions, 245 changer transitions 0/429 dead transitions. [2022-12-06 06:01:45,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 429 transitions, 7854 flow [2022-12-06 06:01:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:01:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:01:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 142 transitions. [2022-12-06 06:01:45,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23202614379084968 [2022-12-06 06:01:45,207 INFO L175 Difference]: Start difference. First operand has 144 places, 291 transitions, 5437 flow. Second operand 18 states and 142 transitions. [2022-12-06 06:01:45,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 429 transitions, 7854 flow [2022-12-06 06:01:45,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 429 transitions, 7665 flow, removed 63 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:45,389 INFO L231 Difference]: Finished difference. Result has 165 places, 365 transitions, 7382 flow [2022-12-06 06:01:45,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5260, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7382, PETRI_PLACES=165, PETRI_TRANSITIONS=365} [2022-12-06 06:01:45,390 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 147 predicate places. [2022-12-06 06:01:45,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:45,390 INFO L89 Accepts]: Start accepts. Operand has 165 places, 365 transitions, 7382 flow [2022-12-06 06:01:45,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:45,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:45,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 365 transitions, 7382 flow [2022-12-06 06:01:45,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 365 transitions, 7382 flow [2022-12-06 06:01:45,466 INFO L130 PetriNetUnfolder]: 224/584 cut-off events. [2022-12-06 06:01:45,466 INFO L131 PetriNetUnfolder]: For 8955/9075 co-relation queries the response was YES. [2022-12-06 06:01:45,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 584 events. 224/584 cut-off events. For 8955/9075 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3971 event pairs, 0 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 4912. Up to 305 conditions per place. [2022-12-06 06:01:45,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 365 transitions, 7382 flow [2022-12-06 06:01:45,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-06 06:01:45,476 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:45,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 06:01:45,477 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 365 transitions, 7382 flow [2022-12-06 06:01:45,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:45,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:45,478 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:45,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:45,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:45,683 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2105872675, now seen corresponding path program 1 times [2022-12-06 06:01:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:45,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467111410] [2022-12-06 06:01:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:45,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:45,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467111410] [2022-12-06 06:01:45,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467111410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:45,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600779259] [2022-12-06 06:01:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:45,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:45,841 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:45,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 06:01:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:46,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:01:46,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:46,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:46,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600779259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:46,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:46,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:01:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849126873] [2022-12-06 06:01:46,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:46,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:01:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:01:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:01:46,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 06:01:46,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 365 transitions, 7382 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:46,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:46,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 06:01:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:47,188 INFO L130 PetriNetUnfolder]: 1410/2473 cut-off events. [2022-12-06 06:01:47,188 INFO L131 PetriNetUnfolder]: For 58013/58013 co-relation queries the response was YES. [2022-12-06 06:01:47,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16668 conditions, 2473 events. 1410/2473 cut-off events. For 58013/58013 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 15481 event pairs, 195 based on Foata normal form. 30/2486 useless extension candidates. Maximal degree in co-relation 16600. Up to 1782 conditions per place. [2022-12-06 06:01:47,250 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 286 selfloop transitions, 143 changer transitions 0/429 dead transitions. [2022-12-06 06:01:47,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 429 transitions, 8714 flow [2022-12-06 06:01:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:01:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:01:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2022-12-06 06:01:47,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 06:01:47,252 INFO L175 Difference]: Start difference. First operand has 165 places, 365 transitions, 7382 flow. Second operand 13 states and 104 transitions. [2022-12-06 06:01:47,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 429 transitions, 8714 flow [2022-12-06 06:01:47,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 429 transitions, 8404 flow, removed 138 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:47,789 INFO L231 Difference]: Finished difference. Result has 179 places, 387 transitions, 7931 flow [2022-12-06 06:01:47,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=7072, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7931, PETRI_PLACES=179, PETRI_TRANSITIONS=387} [2022-12-06 06:01:47,790 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 161 predicate places. [2022-12-06 06:01:47,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:47,791 INFO L89 Accepts]: Start accepts. Operand has 179 places, 387 transitions, 7931 flow [2022-12-06 06:01:47,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:47,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:47,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 387 transitions, 7931 flow [2022-12-06 06:01:47,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 387 transitions, 7931 flow [2022-12-06 06:01:47,876 INFO L130 PetriNetUnfolder]: 238/625 cut-off events. [2022-12-06 06:01:47,876 INFO L131 PetriNetUnfolder]: For 11464/11634 co-relation queries the response was YES. [2022-12-06 06:01:47,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 625 events. 238/625 cut-off events. For 11464/11634 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4316 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 5336. Up to 316 conditions per place. [2022-12-06 06:01:47,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 387 transitions, 7931 flow [2022-12-06 06:01:47,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-06 06:01:47,973 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:47,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 06:01:47,974 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 387 transitions, 7948 flow [2022-12-06 06:01:47,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:47,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:47,974 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:47,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:48,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:48,184 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 721591058, now seen corresponding path program 1 times [2022-12-06 06:01:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:48,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482142098] [2022-12-06 06:01:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:01:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:48,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482142098] [2022-12-06 06:01:48,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482142098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:48,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:48,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:01:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208114639] [2022-12-06 06:01:48,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:01:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:48,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:01:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:01:48,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 06:01:48,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 387 transitions, 7948 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 06:01:48,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:48,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 06:01:48,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:48,898 INFO L130 PetriNetUnfolder]: 1364/2403 cut-off events. [2022-12-06 06:01:48,899 INFO L131 PetriNetUnfolder]: For 53032/53032 co-relation queries the response was YES. [2022-12-06 06:01:48,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16949 conditions, 2403 events. 1364/2403 cut-off events. For 53032/53032 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 15348 event pairs, 191 based on Foata normal form. 91/2480 useless extension candidates. Maximal degree in co-relation 16875. Up to 1048 conditions per place. [2022-12-06 06:01:48,920 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 545 selfloop transitions, 40 changer transitions 0/585 dead transitions. [2022-12-06 06:01:48,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 585 transitions, 13224 flow [2022-12-06 06:01:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:01:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:01:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 06:01:48,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2022-12-06 06:01:48,922 INFO L175 Difference]: Start difference. First operand has 179 places, 387 transitions, 7948 flow. Second operand 4 states and 53 transitions. [2022-12-06 06:01:48,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 585 transitions, 13224 flow [2022-12-06 06:01:49,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 585 transitions, 13032 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:49,218 INFO L231 Difference]: Finished difference. Result has 180 places, 393 transitions, 8079 flow [2022-12-06 06:01:49,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7726, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8079, PETRI_PLACES=180, PETRI_TRANSITIONS=393} [2022-12-06 06:01:49,219 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 162 predicate places. [2022-12-06 06:01:49,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:49,219 INFO L89 Accepts]: Start accepts. Operand has 180 places, 393 transitions, 8079 flow [2022-12-06 06:01:49,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:49,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:49,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 393 transitions, 8079 flow [2022-12-06 06:01:49,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 393 transitions, 8079 flow [2022-12-06 06:01:49,295 INFO L130 PetriNetUnfolder]: 233/624 cut-off events. [2022-12-06 06:01:49,295 INFO L131 PetriNetUnfolder]: For 12246/12374 co-relation queries the response was YES. [2022-12-06 06:01:49,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 624 events. 233/624 cut-off events. For 12246/12374 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4338 event pairs, 0 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 5534. Up to 314 conditions per place. [2022-12-06 06:01:49,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 393 transitions, 8079 flow [2022-12-06 06:01:49,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 1148 [2022-12-06 06:01:49,305 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:49,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 06:01:49,306 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 393 transitions, 8079 flow [2022-12-06 06:01:49,306 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 06:01:49,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:49,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:49,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 06:01:49,308 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1633311550, now seen corresponding path program 1 times [2022-12-06 06:01:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:49,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474395677] [2022-12-06 06:01:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:49,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:49,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474395677] [2022-12-06 06:01:49,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474395677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:49,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388275235] [2022-12-06 06:01:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:49,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:49,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:49,443 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:49,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 06:01:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:49,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:49,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:49,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:49,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388275235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:49,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:49,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:01:49,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372992941] [2022-12-06 06:01:49,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:49,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:01:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:01:49,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:01:49,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 06:01:49,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 393 transitions, 8079 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:49,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:49,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 06:01:49,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:50,805 INFO L130 PetriNetUnfolder]: 1610/2831 cut-off events. [2022-12-06 06:01:50,805 INFO L131 PetriNetUnfolder]: For 87087/87087 co-relation queries the response was YES. [2022-12-06 06:01:50,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21123 conditions, 2831 events. 1610/2831 cut-off events. For 87087/87087 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 18181 event pairs, 152 based on Foata normal form. 32/2849 useless extension candidates. Maximal degree in co-relation 21046. Up to 1529 conditions per place. [2022-12-06 06:01:50,838 INFO L137 encePairwiseOnDemand]: 8/36 looper letters, 263 selfloop transitions, 276 changer transitions 0/539 dead transitions. [2022-12-06 06:01:50,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 539 transitions, 10941 flow [2022-12-06 06:01:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:01:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:01:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 155 transitions. [2022-12-06 06:01:50,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20502645502645503 [2022-12-06 06:01:50,842 INFO L175 Difference]: Start difference. First operand has 180 places, 393 transitions, 8079 flow. Second operand 21 states and 155 transitions. [2022-12-06 06:01:50,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 539 transitions, 10941 flow [2022-12-06 06:01:51,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 539 transitions, 10941 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:01:51,236 INFO L231 Difference]: Finished difference. Result has 209 places, 465 transitions, 10431 flow [2022-12-06 06:01:51,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=8079, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=10431, PETRI_PLACES=209, PETRI_TRANSITIONS=465} [2022-12-06 06:01:51,237 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 191 predicate places. [2022-12-06 06:01:51,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:51,237 INFO L89 Accepts]: Start accepts. Operand has 209 places, 465 transitions, 10431 flow [2022-12-06 06:01:51,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:51,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:51,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 465 transitions, 10431 flow [2022-12-06 06:01:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 465 transitions, 10431 flow [2022-12-06 06:01:51,357 INFO L130 PetriNetUnfolder]: 274/730 cut-off events. [2022-12-06 06:01:51,358 INFO L131 PetriNetUnfolder]: For 17896/18077 co-relation queries the response was YES. [2022-12-06 06:01:51,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7098 conditions, 730 events. 274/730 cut-off events. For 17896/18077 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 5339 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 7013. Up to 385 conditions per place. [2022-12-06 06:01:51,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 465 transitions, 10431 flow [2022-12-06 06:01:51,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 1344 [2022-12-06 06:01:51,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:51,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 06:01:51,412 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 465 transitions, 10445 flow [2022-12-06 06:01:51,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:51,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:51,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:51,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:51,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 06:01:51,619 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2104115688, now seen corresponding path program 1 times [2022-12-06 06:01:51,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:51,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383239307] [2022-12-06 06:01:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:51,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383239307] [2022-12-06 06:01:51,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383239307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:51,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944533384] [2022-12-06 06:01:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:51,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:51,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:51,791 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:51,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 06:01:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:51,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:51,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:51,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:52,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944533384] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:52,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:52,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:01:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714702251] [2022-12-06 06:01:52,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:52,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:01:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:01:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:01:52,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 06:01:52,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 465 transitions, 10445 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:52,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:52,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 06:01:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:53,133 INFO L130 PetriNetUnfolder]: 1870/3263 cut-off events. [2022-12-06 06:01:53,133 INFO L131 PetriNetUnfolder]: For 130809/130809 co-relation queries the response was YES. [2022-12-06 06:01:53,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26841 conditions, 3263 events. 1870/3263 cut-off events. For 130809/130809 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 21250 event pairs, 135 based on Foata normal form. 28/3277 useless extension candidates. Maximal degree in co-relation 26753. Up to 1303 conditions per place. [2022-12-06 06:01:53,165 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 225 selfloop transitions, 360 changer transitions 0/585 dead transitions. [2022-12-06 06:01:53,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 585 transitions, 13361 flow [2022-12-06 06:01:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 06:01:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 06:01:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2022-12-06 06:01:53,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24684684684684685 [2022-12-06 06:01:53,167 INFO L175 Difference]: Start difference. First operand has 209 places, 465 transitions, 10445 flow. Second operand 15 states and 137 transitions. [2022-12-06 06:01:53,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 585 transitions, 13361 flow [2022-12-06 06:01:53,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 585 transitions, 13032 flow, removed 137 selfloop flow, removed 6 redundant places. [2022-12-06 06:01:53,706 INFO L231 Difference]: Finished difference. Result has 223 places, 517 transitions, 12669 flow [2022-12-06 06:01:53,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10160, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12669, PETRI_PLACES=223, PETRI_TRANSITIONS=517} [2022-12-06 06:01:53,707 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 205 predicate places. [2022-12-06 06:01:53,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:53,707 INFO L89 Accepts]: Start accepts. Operand has 223 places, 517 transitions, 12669 flow [2022-12-06 06:01:53,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:53,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:53,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 517 transitions, 12669 flow [2022-12-06 06:01:53,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 517 transitions, 12669 flow [2022-12-06 06:01:53,815 INFO L130 PetriNetUnfolder]: 308/816 cut-off events. [2022-12-06 06:01:53,815 INFO L131 PetriNetUnfolder]: For 23218/23376 co-relation queries the response was YES. [2022-12-06 06:01:53,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8621 conditions, 816 events. 308/816 cut-off events. For 23218/23376 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6162 event pairs, 0 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 8530. Up to 446 conditions per place. [2022-12-06 06:01:53,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 517 transitions, 12669 flow [2022-12-06 06:01:53,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 1532 [2022-12-06 06:01:53,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:53,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 06:01:53,867 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 517 transitions, 12671 flow [2022-12-06 06:01:53,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:53,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:53,867 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:53,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-06 06:01:54,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 06:01:54,071 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:54,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash -115749967, now seen corresponding path program 1 times [2022-12-06 06:01:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:54,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631259047] [2022-12-06 06:01:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631259047] [2022-12-06 06:01:54,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631259047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:54,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437407285] [2022-12-06 06:01:54,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:54,218 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:54,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 06:01:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:54,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:01:54,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:54,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:54,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437407285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:54,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:54,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:01:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811941324] [2022-12-06 06:01:54,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:54,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:01:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:01:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:01:54,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 06:01:54,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 517 transitions, 12671 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:54,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:54,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 06:01:54,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:56,081 INFO L130 PetriNetUnfolder]: 2158/3767 cut-off events. [2022-12-06 06:01:56,081 INFO L131 PetriNetUnfolder]: For 172278/172278 co-relation queries the response was YES. [2022-12-06 06:01:56,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32929 conditions, 3767 events. 2158/3767 cut-off events. For 172278/172278 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 25358 event pairs, 201 based on Foata normal form. 32/3785 useless extension candidates. Maximal degree in co-relation 32835. Up to 2112 conditions per place. [2022-12-06 06:01:56,129 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 351 selfloop transitions, 339 changer transitions 1/691 dead transitions. [2022-12-06 06:01:56,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 691 transitions, 16578 flow [2022-12-06 06:01:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:01:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:01:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 178 transitions. [2022-12-06 06:01:56,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18016194331983806 [2022-12-06 06:01:56,131 INFO L175 Difference]: Start difference. First operand has 223 places, 517 transitions, 12671 flow. Second operand 26 states and 178 transitions. [2022-12-06 06:01:56,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 691 transitions, 16578 flow [2022-12-06 06:01:56,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 691 transitions, 16322 flow, removed 88 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:56,857 INFO L231 Difference]: Finished difference. Result has 253 places, 607 transitions, 15702 flow [2022-12-06 06:01:56,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=12457, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=15702, PETRI_PLACES=253, PETRI_TRANSITIONS=607} [2022-12-06 06:01:56,858 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 235 predicate places. [2022-12-06 06:01:56,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:56,859 INFO L89 Accepts]: Start accepts. Operand has 253 places, 607 transitions, 15702 flow [2022-12-06 06:01:56,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:56,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:56,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 607 transitions, 15702 flow [2022-12-06 06:01:56,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 607 transitions, 15702 flow [2022-12-06 06:01:57,028 INFO L130 PetriNetUnfolder]: 361/948 cut-off events. [2022-12-06 06:01:57,029 INFO L131 PetriNetUnfolder]: For 29934/30092 co-relation queries the response was YES. [2022-12-06 06:01:57,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10558 conditions, 948 events. 361/948 cut-off events. For 29934/30092 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 7311 event pairs, 0 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 10459. Up to 538 conditions per place. [2022-12-06 06:01:57,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 607 transitions, 15702 flow [2022-12-06 06:01:57,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 1770 [2022-12-06 06:01:57,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:57,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 326 [2022-12-06 06:01:57,184 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 607 transitions, 15735 flow [2022-12-06 06:01:57,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:57,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:57,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:57,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:57,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:57,390 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 804745265, now seen corresponding path program 1 times [2022-12-06 06:01:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:57,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678648841] [2022-12-06 06:01:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:57,461 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 06:01:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:57,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678648841] [2022-12-06 06:01:57,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678648841] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:57,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288612687] [2022-12-06 06:01:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:57,471 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:57,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 06:01:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:57,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 06:01:57,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:57,580 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 06:01:57,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:01:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288612687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:57,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:01:57,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-06 06:01:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529944421] [2022-12-06 06:01:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:57,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:01:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:57,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:01:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:57,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 06:01:57,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 607 transitions, 15735 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 06:01:57,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:57,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 06:01:57,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:59,033 INFO L130 PetriNetUnfolder]: 2318/3973 cut-off events. [2022-12-06 06:01:59,033 INFO L131 PetriNetUnfolder]: For 203968/203968 co-relation queries the response was YES. [2022-12-06 06:01:59,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38217 conditions, 3973 events. 2318/3973 cut-off events. For 203968/203968 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27138 event pairs, 450 based on Foata normal form. 6/3965 useless extension candidates. Maximal degree in co-relation 38115. Up to 2043 conditions per place. [2022-12-06 06:01:59,112 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 949 selfloop transitions, 8 changer transitions 11/968 dead transitions. [2022-12-06 06:01:59,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 968 transitions, 27120 flow [2022-12-06 06:01:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 06:01:59,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37435897435897436 [2022-12-06 06:01:59,114 INFO L175 Difference]: Start difference. First operand has 253 places, 607 transitions, 15735 flow. Second operand 5 states and 73 transitions. [2022-12-06 06:01:59,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 968 transitions, 27120 flow [2022-12-06 06:02:00,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 968 transitions, 26168 flow, removed 377 selfloop flow, removed 13 redundant places. [2022-12-06 06:02:00,260 INFO L231 Difference]: Finished difference. Result has 244 places, 603 transitions, 14987 flow [2022-12-06 06:02:00,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=14965, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14987, PETRI_PLACES=244, PETRI_TRANSITIONS=603} [2022-12-06 06:02:00,261 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 226 predicate places. [2022-12-06 06:02:00,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:00,261 INFO L89 Accepts]: Start accepts. Operand has 244 places, 603 transitions, 14987 flow [2022-12-06 06:02:00,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:00,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:00,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 603 transitions, 14987 flow [2022-12-06 06:02:00,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 603 transitions, 14987 flow [2022-12-06 06:02:00,502 INFO L130 PetriNetUnfolder]: 408/1043 cut-off events. [2022-12-06 06:02:00,503 INFO L131 PetriNetUnfolder]: For 39083/39167 co-relation queries the response was YES. [2022-12-06 06:02:00,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11770 conditions, 1043 events. 408/1043 cut-off events. For 39083/39167 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 8105 event pairs, 0 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 11672. Up to 592 conditions per place. [2022-12-06 06:02:00,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 603 transitions, 14987 flow [2022-12-06 06:02:00,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 1806 [2022-12-06 06:02:00,529 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:00,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 06:02:00,531 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 603 transitions, 14987 flow [2022-12-06 06:02:00,531 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 06:02:00,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:00,531 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:00,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:00,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:00,737 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash -122402567, now seen corresponding path program 1 times [2022-12-06 06:02:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:00,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437409603] [2022-12-06 06:02:00,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:00,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:02:00,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:00,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437409603] [2022-12-06 06:02:00,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437409603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:00,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:00,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:02:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078845951] [2022-12-06 06:02:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:00,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:02:00,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:02:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:02:00,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 06:02:00,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 603 transitions, 14987 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:00,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:00,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 06:02:00,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:02,468 INFO L130 PetriNetUnfolder]: 2333/3958 cut-off events. [2022-12-06 06:02:02,469 INFO L131 PetriNetUnfolder]: For 208486/208486 co-relation queries the response was YES. [2022-12-06 06:02:02,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38840 conditions, 3958 events. 2333/3958 cut-off events. For 208486/208486 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 25927 event pairs, 495 based on Foata normal form. 104/4050 useless extension candidates. Maximal degree in co-relation 38739. Up to 2586 conditions per place. [2022-12-06 06:02:02,521 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 766 selfloop transitions, 45 changer transitions 1/812 dead transitions. [2022-12-06 06:02:02,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 812 transitions, 21743 flow [2022-12-06 06:02:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:02:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:02:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 06:02:02,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-06 06:02:02,532 INFO L175 Difference]: Start difference. First operand has 244 places, 603 transitions, 14987 flow. Second operand 4 states and 60 transitions. [2022-12-06 06:02:02,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 812 transitions, 21743 flow [2022-12-06 06:02:03,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 812 transitions, 21697 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 06:02:03,689 INFO L231 Difference]: Finished difference. Result has 247 places, 603 transitions, 15052 flow [2022-12-06 06:02:03,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=14732, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15052, PETRI_PLACES=247, PETRI_TRANSITIONS=603} [2022-12-06 06:02:03,690 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 229 predicate places. [2022-12-06 06:02:03,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:03,690 INFO L89 Accepts]: Start accepts. Operand has 247 places, 603 transitions, 15052 flow [2022-12-06 06:02:03,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:03,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:03,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 603 transitions, 15052 flow [2022-12-06 06:02:03,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 603 transitions, 15052 flow [2022-12-06 06:02:03,984 INFO L130 PetriNetUnfolder]: 423/1070 cut-off events. [2022-12-06 06:02:03,984 INFO L131 PetriNetUnfolder]: For 41827/41913 co-relation queries the response was YES. [2022-12-06 06:02:03,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12396 conditions, 1070 events. 423/1070 cut-off events. For 41827/41913 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 8327 event pairs, 0 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 12296. Up to 613 conditions per place. [2022-12-06 06:02:04,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 603 transitions, 15052 flow [2022-12-06 06:02:04,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 1778 [2022-12-06 06:02:04,027 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:04,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 339 [2022-12-06 06:02:04,029 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 603 transitions, 15052 flow [2022-12-06 06:02:04,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:04,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:04,029 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:04,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 06:02:04,029 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:04,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1072725394, now seen corresponding path program 1 times [2022-12-06 06:02:04,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:04,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647363126] [2022-12-06 06:02:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:04,136 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 06:02:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647363126] [2022-12-06 06:02:04,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647363126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214346253] [2022-12-06 06:02:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:04,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:04,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:04,139 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:04,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 06:02:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:04,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 06:02:04,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:02:04,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:02:04,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214346253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:04,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:02:04,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-12-06 06:02:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771101108] [2022-12-06 06:02:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:04,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:02:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:02:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:02:04,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 06:02:04,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 603 transitions, 15052 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:04,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:04,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 06:02:04,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:06,233 INFO L130 PetriNetUnfolder]: 2343/3972 cut-off events. [2022-12-06 06:02:06,233 INFO L131 PetriNetUnfolder]: For 225583/225583 co-relation queries the response was YES. [2022-12-06 06:02:06,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40416 conditions, 3972 events. 2343/3972 cut-off events. For 225583/225583 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 25997 event pairs, 501 based on Foata normal form. 10/3976 useless extension candidates. Maximal degree in co-relation 40313. Up to 2100 conditions per place. [2022-12-06 06:02:06,288 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 883 selfloop transitions, 9 changer transitions 0/892 dead transitions. [2022-12-06 06:02:06,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 892 transitions, 24088 flow [2022-12-06 06:02:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:02:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:02:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 06:02:06,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2810810810810811 [2022-12-06 06:02:06,289 INFO L175 Difference]: Start difference. First operand has 247 places, 603 transitions, 15052 flow. Second operand 5 states and 52 transitions. [2022-12-06 06:02:06,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 892 transitions, 24088 flow [2022-12-06 06:02:07,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 892 transitions, 24088 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:02:07,374 INFO L231 Difference]: Finished difference. Result has 252 places, 599 transitions, 14933 flow [2022-12-06 06:02:07,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14893, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14933, PETRI_PLACES=252, PETRI_TRANSITIONS=599} [2022-12-06 06:02:07,375 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 234 predicate places. [2022-12-06 06:02:07,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:07,375 INFO L89 Accepts]: Start accepts. Operand has 252 places, 599 transitions, 14933 flow [2022-12-06 06:02:07,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:07,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:07,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 599 transitions, 14933 flow [2022-12-06 06:02:07,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 599 transitions, 14933 flow [2022-12-06 06:02:07,640 INFO L130 PetriNetUnfolder]: 421/1074 cut-off events. [2022-12-06 06:02:07,640 INFO L131 PetriNetUnfolder]: For 45096/45182 co-relation queries the response was YES. [2022-12-06 06:02:07,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12671 conditions, 1074 events. 421/1074 cut-off events. For 45096/45182 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 8423 event pairs, 0 based on Foata normal form. 0/1072 useless extension candidates. Maximal degree in co-relation 12568. Up to 613 conditions per place. [2022-12-06 06:02:07,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 599 transitions, 14933 flow [2022-12-06 06:02:07,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 1786 [2022-12-06 06:02:07,677 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:07,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-06 06:02:07,678 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 599 transitions, 14933 flow [2022-12-06 06:02:07,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:07,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:07,678 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:07,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 06:02:07,884 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,SelfDestructingSolverStorable26 [2022-12-06 06:02:07,884 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash 956589480, now seen corresponding path program 1 times [2022-12-06 06:02:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:07,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129724941] [2022-12-06 06:02:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:08,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129724941] [2022-12-06 06:02:08,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129724941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:08,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661145372] [2022-12-06 06:02:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:08,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:08,094 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:08,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 06:02:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:08,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:02:08,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:08,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:08,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661145372] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:08,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:08,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:02:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707315875] [2022-12-06 06:02:08,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:08,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:02:08,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:08,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:02:08,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:02:08,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 06:02:08,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 599 transitions, 14933 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:08,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:08,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 06:02:08,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:11,516 INFO L130 PetriNetUnfolder]: 3139/5228 cut-off events. [2022-12-06 06:02:11,516 INFO L131 PetriNetUnfolder]: For 439477/439477 co-relation queries the response was YES. [2022-12-06 06:02:11,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56494 conditions, 5228 events. 3139/5228 cut-off events. For 439477/439477 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 34484 event pairs, 191 based on Foata normal form. 80/5302 useless extension candidates. Maximal degree in co-relation 56388. Up to 2205 conditions per place. [2022-12-06 06:02:11,597 INFO L137 encePairwiseOnDemand]: 8/37 looper letters, 347 selfloop transitions, 516 changer transitions 0/863 dead transitions. [2022-12-06 06:02:11,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 863 transitions, 21027 flow [2022-12-06 06:02:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 06:02:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 06:02:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 191 transitions. [2022-12-06 06:02:11,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17800559179869524 [2022-12-06 06:02:11,599 INFO L175 Difference]: Start difference. First operand has 252 places, 599 transitions, 14933 flow. Second operand 29 states and 191 transitions. [2022-12-06 06:02:11,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 863 transitions, 21027 flow [2022-12-06 06:02:13,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 863 transitions, 21026 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:02:13,245 INFO L231 Difference]: Finished difference. Result has 291 places, 717 transitions, 20018 flow [2022-12-06 06:02:13,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14932, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=413, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=20018, PETRI_PLACES=291, PETRI_TRANSITIONS=717} [2022-12-06 06:02:13,246 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 273 predicate places. [2022-12-06 06:02:13,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:13,247 INFO L89 Accepts]: Start accepts. Operand has 291 places, 717 transitions, 20018 flow [2022-12-06 06:02:13,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:13,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:13,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 717 transitions, 20018 flow [2022-12-06 06:02:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 717 transitions, 20018 flow [2022-12-06 06:02:13,761 INFO L130 PetriNetUnfolder]: 590/1443 cut-off events. [2022-12-06 06:02:13,761 INFO L131 PetriNetUnfolder]: For 103282/103462 co-relation queries the response was YES. [2022-12-06 06:02:13,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19742 conditions, 1443 events. 590/1443 cut-off events. For 103282/103462 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 11657 event pairs, 0 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 19626. Up to 859 conditions per place. [2022-12-06 06:02:13,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 717 transitions, 20018 flow [2022-12-06 06:02:13,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 2200 [2022-12-06 06:02:13,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:02:13,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6) (= 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 06:02:14,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L695-5-->L695-5: Formula: (and (= v_~j~0_205 (+ v_~j~0_207 (* 2 v_~i~0_175))) (< v_~q~0_127 5) (= (+ 2 v_~q~0_127) v_~q~0_125)) InVars {~j~0=v_~j~0_207, ~i~0=v_~i~0_175, ~q~0=v_~q~0_127} OutVars{~j~0=v_~j~0_205, ~i~0=v_~i~0_175, ~q~0=v_~q~0_125, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_88|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [381] L705-6-->L695-5: Formula: (and (= v_~j~0_291 (+ v_~j~0_292 v_~i~0_271)) (< v_~x~0_252 1) (< v_~q~0_193 6) (= v_~next~0_138 (+ (* 144 v_~prev~0_264) (* 233 v_~cur~0_220) v_~prev~0_263)) (= v_~next~0_138 v_~cur~0_219) (= (+ (* 377 v_~cur~0_220) (* 233 v_~prev~0_264)) v_~prev~0_263) (= (+ v_~q~0_193 1) v_~q~0_192) (= (+ 14 v_~x~0_252) v_~x~0_251)) InVars {~j~0=v_~j~0_292, ~prev~0=v_~prev~0_264, ~i~0=v_~i~0_271, ~q~0=v_~q~0_193, ~cur~0=v_~cur~0_220, ~x~0=v_~x~0_252} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_159|, ~j~0=v_~j~0_291, ~next~0=v_~next~0_138, ~prev~0=v_~prev~0_263, ~i~0=v_~i~0_271, ~q~0=v_~q~0_192, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_140|, ~cur~0=v_~cur~0_219, ~x~0=v_~x~0_251} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 06:02:14,180 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:02:14,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 938 [2022-12-06 06:02:14,186 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 717 transitions, 20057 flow [2022-12-06 06:02:14,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:14,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:14,186 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:14,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:14,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 06:02:14,387 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 373966105, now seen corresponding path program 1 times [2022-12-06 06:02:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:14,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490993153] [2022-12-06 06:02:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490993153] [2022-12-06 06:02:14,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490993153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760005147] [2022-12-06 06:02:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:14,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:14,600 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:14,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 06:02:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:14,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:02:14,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:14,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:15,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760005147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:15,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:15,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:02:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984162450] [2022-12-06 06:02:15,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:15,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:02:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:02:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:02:15,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 06:02:15,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 717 transitions, 20057 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:15,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:15,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 06:02:15,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:18,718 INFO L130 PetriNetUnfolder]: 4107/6744 cut-off events. [2022-12-06 06:02:18,719 INFO L131 PetriNetUnfolder]: For 673083/673083 co-relation queries the response was YES. [2022-12-06 06:02:18,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81091 conditions, 6744 events. 4107/6744 cut-off events. For 673083/673083 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 45564 event pairs, 171 based on Foata normal form. 60/6794 useless extension candidates. Maximal degree in co-relation 80972. Up to 2849 conditions per place. [2022-12-06 06:02:18,844 INFO L137 encePairwiseOnDemand]: 8/41 looper letters, 315 selfloop transitions, 682 changer transitions 1/998 dead transitions. [2022-12-06 06:02:18,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 998 transitions, 27771 flow [2022-12-06 06:02:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 06:02:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 06:02:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 184 transitions. [2022-12-06 06:02:18,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18699186991869918 [2022-12-06 06:02:18,854 INFO L175 Difference]: Start difference. First operand has 291 places, 717 transitions, 20057 flow. Second operand 24 states and 184 transitions. [2022-12-06 06:02:18,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 998 transitions, 27771 flow [2022-12-06 06:02:22,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 998 transitions, 25953 flow, removed 842 selfloop flow, removed 9 redundant places. [2022-12-06 06:02:22,869 INFO L231 Difference]: Finished difference. Result has 312 places, 864 transitions, 25269 flow [2022-12-06 06:02:22,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=18823, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=559, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=25269, PETRI_PLACES=312, PETRI_TRANSITIONS=864} [2022-12-06 06:02:22,871 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 294 predicate places. [2022-12-06 06:02:22,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:22,871 INFO L89 Accepts]: Start accepts. Operand has 312 places, 864 transitions, 25269 flow [2022-12-06 06:02:22,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:22,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:22,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 312 places, 864 transitions, 25269 flow [2022-12-06 06:02:22,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 864 transitions, 25269 flow [2022-12-06 06:02:23,510 INFO L130 PetriNetUnfolder]: 751/1831 cut-off events. [2022-12-06 06:02:23,511 INFO L131 PetriNetUnfolder]: For 149674/149887 co-relation queries the response was YES. [2022-12-06 06:02:23,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26067 conditions, 1831 events. 751/1831 cut-off events. For 149674/149887 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 15529 event pairs, 1 based on Foata normal form. 1/1829 useless extension candidates. Maximal degree in co-relation 25945. Up to 953 conditions per place. [2022-12-06 06:02:23,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 864 transitions, 25269 flow [2022-12-06 06:02:23,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 2748 [2022-12-06 06:02:23,728 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:02:23,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 858 [2022-12-06 06:02:23,730 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 864 transitions, 25307 flow [2022-12-06 06:02:23,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:23,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:23,730 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:23,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:23,936 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,SelfDestructingSolverStorable28 [2022-12-06 06:02:23,937 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:23,937 INFO L85 PathProgramCache]: Analyzing trace with hash -155959168, now seen corresponding path program 1 times [2022-12-06 06:02:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:23,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308696540] [2022-12-06 06:02:23,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:23,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:24,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308696540] [2022-12-06 06:02:24,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308696540] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:24,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952434448] [2022-12-06 06:02:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:24,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:24,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:24,183 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:24,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 06:02:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:24,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:02:24,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:24,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:24,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952434448] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:24,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:24,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179001717] [2022-12-06 06:02:24,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:24,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:24,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:24,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 06:02:24,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 864 transitions, 25307 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:24,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:24,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 06:02:24,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:27,789 INFO L130 PetriNetUnfolder]: 4259/7030 cut-off events. [2022-12-06 06:02:27,789 INFO L131 PetriNetUnfolder]: For 711679/711679 co-relation queries the response was YES. [2022-12-06 06:02:27,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85218 conditions, 7030 events. 4259/7030 cut-off events. For 711679/711679 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 48342 event pairs, 661 based on Foata normal form. 62/7082 useless extension candidates. Maximal degree in co-relation 85093. Up to 5756 conditions per place. [2022-12-06 06:02:27,871 INFO L137 encePairwiseOnDemand]: 8/44 looper letters, 681 selfloop transitions, 334 changer transitions 2/1017 dead transitions. [2022-12-06 06:02:27,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1017 transitions, 29960 flow [2022-12-06 06:02:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 06:02:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 06:02:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 144 transitions. [2022-12-06 06:02:27,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-06 06:02:27,872 INFO L175 Difference]: Start difference. First operand has 311 places, 864 transitions, 25307 flow. Second operand 20 states and 144 transitions. [2022-12-06 06:02:27,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1017 transitions, 29960 flow [2022-12-06 06:02:31,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 1017 transitions, 29240 flow, removed 290 selfloop flow, removed 11 redundant places. [2022-12-06 06:02:31,176 INFO L231 Difference]: Finished difference. Result has 324 places, 930 transitions, 27831 flow [2022-12-06 06:02:31,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=24655, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=27831, PETRI_PLACES=324, PETRI_TRANSITIONS=930} [2022-12-06 06:02:31,177 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 306 predicate places. [2022-12-06 06:02:31,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:31,177 INFO L89 Accepts]: Start accepts. Operand has 324 places, 930 transitions, 27831 flow [2022-12-06 06:02:31,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:31,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:31,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 930 transitions, 27831 flow [2022-12-06 06:02:31,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 930 transitions, 27831 flow [2022-12-06 06:02:31,708 INFO L130 PetriNetUnfolder]: 800/1950 cut-off events. [2022-12-06 06:02:31,708 INFO L131 PetriNetUnfolder]: For 147168/147274 co-relation queries the response was YES. [2022-12-06 06:02:31,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27636 conditions, 1950 events. 800/1950 cut-off events. For 147168/147274 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 16636 event pairs, 1 based on Foata normal form. 0/1947 useless extension candidates. Maximal degree in co-relation 27512. Up to 1024 conditions per place. [2022-12-06 06:02:31,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 930 transitions, 27831 flow [2022-12-06 06:02:31,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 2878 [2022-12-06 06:02:31,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:02:31,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 736 [2022-12-06 06:02:31,913 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 930 transitions, 27859 flow [2022-12-06 06:02:31,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:31,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:31,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:31,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:32,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:32,119 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 551190900, now seen corresponding path program 1 times [2022-12-06 06:02:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:32,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094982575] [2022-12-06 06:02:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:32,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 06:02:32,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:32,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094982575] [2022-12-06 06:02:32,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094982575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:32,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553221305] [2022-12-06 06:02:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:32,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:32,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:32,231 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:32,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 06:02:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:32,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 06:02:32,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:32,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:32,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553221305] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:32,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:32,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:02:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378795483] [2022-12-06 06:02:32,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:32,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:02:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:02:32,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:02:32,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 06:02:32,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 930 transitions, 27859 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:32,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:32,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 06:02:32,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:35,545 INFO L130 PetriNetUnfolder]: 4295/7110 cut-off events. [2022-12-06 06:02:35,545 INFO L131 PetriNetUnfolder]: For 653297/653297 co-relation queries the response was YES. [2022-12-06 06:02:35,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85549 conditions, 7110 events. 4295/7110 cut-off events. For 653297/653297 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 49220 event pairs, 692 based on Foata normal form. 44/7144 useless extension candidates. Maximal degree in co-relation 85422. Up to 5654 conditions per place. [2022-12-06 06:02:35,779 INFO L137 encePairwiseOnDemand]: 8/45 looper letters, 660 selfloop transitions, 372 changer transitions 0/1032 dead transitions. [2022-12-06 06:02:35,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1032 transitions, 31541 flow [2022-12-06 06:02:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:02:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:02:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 124 transitions. [2022-12-06 06:02:35,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17222222222222222 [2022-12-06 06:02:35,781 INFO L175 Difference]: Start difference. First operand has 324 places, 930 transitions, 27859 flow. Second operand 16 states and 124 transitions. [2022-12-06 06:02:35,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1032 transitions, 31541 flow [2022-12-06 06:02:40,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 1032 transitions, 31334 flow, removed 93 selfloop flow, removed 3 redundant places. [2022-12-06 06:02:40,575 INFO L231 Difference]: Finished difference. Result has 344 places, 968 transitions, 30173 flow [2022-12-06 06:02:40,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=27652, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=30173, PETRI_PLACES=344, PETRI_TRANSITIONS=968} [2022-12-06 06:02:40,576 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 326 predicate places. [2022-12-06 06:02:40,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:40,577 INFO L89 Accepts]: Start accepts. Operand has 344 places, 968 transitions, 30173 flow [2022-12-06 06:02:40,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:40,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:40,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 344 places, 968 transitions, 30173 flow [2022-12-06 06:02:40,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 344 places, 968 transitions, 30173 flow [2022-12-06 06:02:41,351 INFO L130 PetriNetUnfolder]: 844/2016 cut-off events. [2022-12-06 06:02:41,351 INFO L131 PetriNetUnfolder]: For 172121/172313 co-relation queries the response was YES. [2022-12-06 06:02:41,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29697 conditions, 2016 events. 844/2016 cut-off events. For 172121/172313 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 16991 event pairs, 2 based on Foata normal form. 0/2010 useless extension candidates. Maximal degree in co-relation 29563. Up to 1074 conditions per place. [2022-12-06 06:02:41,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 344 places, 968 transitions, 30173 flow [2022-12-06 06:02:41,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 2942 [2022-12-06 06:02:41,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:41,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 862 [2022-12-06 06:02:41,439 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 968 transitions, 30173 flow [2022-12-06 06:02:41,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:41,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:41,445 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:41,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:41,651 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:41,652 INFO L85 PathProgramCache]: Analyzing trace with hash 744717523, now seen corresponding path program 1 times [2022-12-06 06:02:41,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:41,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841658268] [2022-12-06 06:02:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:41,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 06:02:41,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:41,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841658268] [2022-12-06 06:02:41,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841658268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:41,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:41,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:02:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994105648] [2022-12-06 06:02:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:02:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:02:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:02:41,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 06:02:41,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 968 transitions, 30173 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:41,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:41,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 06:02:41,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:45,059 INFO L130 PetriNetUnfolder]: 4179/6930 cut-off events. [2022-12-06 06:02:45,059 INFO L131 PetriNetUnfolder]: For 643007/643007 co-relation queries the response was YES. [2022-12-06 06:02:45,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86449 conditions, 6930 events. 4179/6930 cut-off events. For 643007/643007 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 47946 event pairs, 1245 based on Foata normal form. 4/6924 useless extension candidates. Maximal degree in co-relation 86312. Up to 6433 conditions per place. [2022-12-06 06:02:45,302 INFO L137 encePairwiseOnDemand]: 24/45 looper letters, 911 selfloop transitions, 54 changer transitions 0/965 dead transitions. [2022-12-06 06:02:45,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 965 transitions, 32014 flow [2022-12-06 06:02:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:02:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:02:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:02:45,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2022-12-06 06:02:45,304 INFO L175 Difference]: Start difference. First operand has 344 places, 968 transitions, 30173 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:02:45,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 965 transitions, 32014 flow [2022-12-06 06:02:50,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 965 transitions, 31804 flow, removed 48 selfloop flow, removed 7 redundant places. [2022-12-06 06:02:50,789 INFO L231 Difference]: Finished difference. Result has 339 places, 954 transitions, 29680 flow [2022-12-06 06:02:50,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=29572, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=29680, PETRI_PLACES=339, PETRI_TRANSITIONS=954} [2022-12-06 06:02:50,792 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 321 predicate places. [2022-12-06 06:02:50,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:50,792 INFO L89 Accepts]: Start accepts. Operand has 339 places, 954 transitions, 29680 flow [2022-12-06 06:02:50,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:50,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:50,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 954 transitions, 29680 flow [2022-12-06 06:02:50,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 339 places, 954 transitions, 29680 flow [2022-12-06 06:02:51,497 INFO L130 PetriNetUnfolder]: 824/1981 cut-off events. [2022-12-06 06:02:51,498 INFO L131 PetriNetUnfolder]: For 166329/166589 co-relation queries the response was YES. [2022-12-06 06:02:51,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29098 conditions, 1981 events. 824/1981 cut-off events. For 166329/166589 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 16807 event pairs, 2 based on Foata normal form. 1/1976 useless extension candidates. Maximal degree in co-relation 28964. Up to 1047 conditions per place. [2022-12-06 06:02:51,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 954 transitions, 29680 flow [2022-12-06 06:02:51,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 2874 [2022-12-06 06:02:51,562 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:51,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 771 [2022-12-06 06:02:51,563 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 954 transitions, 29680 flow [2022-12-06 06:02:51,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:51,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:51,563 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:51,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 06:02:51,563 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1741571055, now seen corresponding path program 1 times [2022-12-06 06:02:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:51,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792263872] [2022-12-06 06:02:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792263872] [2022-12-06 06:02:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792263872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589831650] [2022-12-06 06:02:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:51,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:51,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:51,687 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:51,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 06:02:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:02:51,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:51,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:52,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589831650] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:52,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:52,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:52,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184029548] [2022-12-06 06:02:52,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:52,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:52,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:52,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:52,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 06:02:52,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 954 transitions, 29680 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:52,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:52,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 06:02:52,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:55,332 INFO L130 PetriNetUnfolder]: 4235/7054 cut-off events. [2022-12-06 06:02:55,333 INFO L131 PetriNetUnfolder]: For 711589/711589 co-relation queries the response was YES. [2022-12-06 06:02:55,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87465 conditions, 7054 events. 4235/7054 cut-off events. For 711589/711589 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 49282 event pairs, 709 based on Foata normal form. 40/7084 useless extension candidates. Maximal degree in co-relation 87328. Up to 5741 conditions per place. [2022-12-06 06:02:55,420 INFO L137 encePairwiseOnDemand]: 8/44 looper letters, 742 selfloop transitions, 340 changer transitions 3/1085 dead transitions. [2022-12-06 06:02:55,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1085 transitions, 33780 flow [2022-12-06 06:02:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 06:02:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 06:02:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 156 transitions. [2022-12-06 06:02:55,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14772727272727273 [2022-12-06 06:02:55,421 INFO L175 Difference]: Start difference. First operand has 339 places, 954 transitions, 29680 flow. Second operand 24 states and 156 transitions. [2022-12-06 06:02:55,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1085 transitions, 33780 flow [2022-12-06 06:02:58,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 1085 transitions, 33672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:02:58,875 INFO L231 Difference]: Finished difference. Result has 364 places, 992 transitions, 32046 flow [2022-12-06 06:02:58,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=29572, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=32046, PETRI_PLACES=364, PETRI_TRANSITIONS=992} [2022-12-06 06:02:58,876 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 346 predicate places. [2022-12-06 06:02:58,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:58,876 INFO L89 Accepts]: Start accepts. Operand has 364 places, 992 transitions, 32046 flow [2022-12-06 06:02:58,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:58,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:58,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 364 places, 992 transitions, 32046 flow [2022-12-06 06:02:58,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 364 places, 992 transitions, 32046 flow [2022-12-06 06:02:59,436 INFO L130 PetriNetUnfolder]: 864/2053 cut-off events. [2022-12-06 06:02:59,437 INFO L131 PetriNetUnfolder]: For 185506/185719 co-relation queries the response was YES. [2022-12-06 06:02:59,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31069 conditions, 2053 events. 864/2053 cut-off events. For 185506/185719 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 17372 event pairs, 1 based on Foata normal form. 1/2046 useless extension candidates. Maximal degree in co-relation 30931. Up to 1104 conditions per place. [2022-12-06 06:02:59,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 364 places, 992 transitions, 32046 flow [2022-12-06 06:02:59,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 2932 [2022-12-06 06:02:59,704 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:02:59,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 828 [2022-12-06 06:02:59,704 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 992 transitions, 32147 flow [2022-12-06 06:02:59,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:59,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:59,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:59,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:59,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:59,905 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -93586021, now seen corresponding path program 1 times [2022-12-06 06:02:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714012838] [2022-12-06 06:02:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714012838] [2022-12-06 06:02:59,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714012838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:59,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907157259] [2022-12-06 06:02:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:59,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:59,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:59,931 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:59,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 06:03:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:00,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:03:00,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:00,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:03:00,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907157259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:03:00,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:03:00,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 06:03:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527364860] [2022-12-06 06:03:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:03:00,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:03:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:00,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:03:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:03:00,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 06:03:00,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 992 transitions, 32147 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:00,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:00,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 06:03:00,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:03,181 INFO L130 PetriNetUnfolder]: 4261/7100 cut-off events. [2022-12-06 06:03:03,181 INFO L131 PetriNetUnfolder]: For 738147/738147 co-relation queries the response was YES. [2022-12-06 06:03:03,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90317 conditions, 7100 events. 4261/7100 cut-off events. For 738147/738147 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 50498 event pairs, 719 based on Foata normal form. 32/7122 useless extension candidates. Maximal degree in co-relation 90176. Up to 3781 conditions per place. [2022-12-06 06:03:03,331 INFO L137 encePairwiseOnDemand]: 44/49 looper letters, 1466 selfloop transitions, 6 changer transitions 4/1476 dead transitions. [2022-12-06 06:03:03,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1476 transitions, 50615 flow [2022-12-06 06:03:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:03:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:03:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 06:03:03,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 06:03:03,333 INFO L175 Difference]: Start difference. First operand has 364 places, 992 transitions, 32147 flow. Second operand 4 states and 63 transitions. [2022-12-06 06:03:03,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1476 transitions, 50615 flow [2022-12-06 06:03:08,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 1476 transitions, 50171 flow, removed 174 selfloop flow, removed 7 redundant places. [2022-12-06 06:03:08,929 INFO L231 Difference]: Finished difference. Result has 362 places, 988 transitions, 31730 flow [2022-12-06 06:03:08,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=31682, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=987, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=31730, PETRI_PLACES=362, PETRI_TRANSITIONS=988} [2022-12-06 06:03:08,930 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 344 predicate places. [2022-12-06 06:03:08,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:08,930 INFO L89 Accepts]: Start accepts. Operand has 362 places, 988 transitions, 31730 flow [2022-12-06 06:03:08,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:08,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:08,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 362 places, 988 transitions, 31730 flow [2022-12-06 06:03:08,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 362 places, 988 transitions, 31730 flow [2022-12-06 06:03:09,766 INFO L130 PetriNetUnfolder]: 866/2064 cut-off events. [2022-12-06 06:03:09,766 INFO L131 PetriNetUnfolder]: For 192849/193057 co-relation queries the response was YES. [2022-12-06 06:03:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31815 conditions, 2064 events. 866/2064 cut-off events. For 192849/193057 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 17545 event pairs, 1 based on Foata normal form. 1/2057 useless extension candidates. Maximal degree in co-relation 31674. Up to 1103 conditions per place. [2022-12-06 06:03:09,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 362 places, 988 transitions, 31730 flow [2022-12-06 06:03:09,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 2948 [2022-12-06 06:03:09,858 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:03:09,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 929 [2022-12-06 06:03:09,860 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 988 transitions, 31730 flow [2022-12-06 06:03:09,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:09,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:09,860 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:09,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:10,068 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,SelfDestructingSolverStorable33 [2022-12-06 06:03:10,068 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1741481682, now seen corresponding path program 1 times [2022-12-06 06:03:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:10,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118864097] [2022-12-06 06:03:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:10,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118864097] [2022-12-06 06:03:10,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118864097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:10,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154073830] [2022-12-06 06:03:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:10,276 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:10,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 06:03:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:10,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:03:10,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:10,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154073830] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:10,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:10,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256031768] [2022-12-06 06:03:10,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:10,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:10,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 06:03:10,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 988 transitions, 31730 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:10,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:10,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 06:03:10,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:15,412 INFO L130 PetriNetUnfolder]: 4309/7202 cut-off events. [2022-12-06 06:03:15,413 INFO L131 PetriNetUnfolder]: For 748050/748050 co-relation queries the response was YES. [2022-12-06 06:03:15,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94176 conditions, 7202 events. 4309/7202 cut-off events. For 748050/748050 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 50763 event pairs, 714 based on Foata normal form. 16/7208 useless extension candidates. Maximal degree in co-relation 94032. Up to 5814 conditions per place. [2022-12-06 06:03:15,558 INFO L137 encePairwiseOnDemand]: 8/49 looper letters, 739 selfloop transitions, 361 changer transitions 3/1103 dead transitions. [2022-12-06 06:03:15,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1103 transitions, 35721 flow [2022-12-06 06:03:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 06:03:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 06:03:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 153 transitions. [2022-12-06 06:03:15,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14192949907235622 [2022-12-06 06:03:15,560 INFO L175 Difference]: Start difference. First operand has 362 places, 988 transitions, 31730 flow. Second operand 22 states and 153 transitions. [2022-12-06 06:03:15,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1103 transitions, 35721 flow [2022-12-06 06:03:20,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 1103 transitions, 35720 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:03:20,928 INFO L231 Difference]: Finished difference. Result has 386 places, 1015 transitions, 34032 flow [2022-12-06 06:03:20,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=31729, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=34032, PETRI_PLACES=386, PETRI_TRANSITIONS=1015} [2022-12-06 06:03:20,929 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 368 predicate places. [2022-12-06 06:03:20,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:20,929 INFO L89 Accepts]: Start accepts. Operand has 386 places, 1015 transitions, 34032 flow [2022-12-06 06:03:20,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:20,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:20,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 1015 transitions, 34032 flow [2022-12-06 06:03:20,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 386 places, 1015 transitions, 34032 flow [2022-12-06 06:03:21,525 INFO L130 PetriNetUnfolder]: 881/2105 cut-off events. [2022-12-06 06:03:21,525 INFO L131 PetriNetUnfolder]: For 209902/210093 co-relation queries the response was YES. [2022-12-06 06:03:21,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33333 conditions, 2105 events. 881/2105 cut-off events. For 209902/210093 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 17972 event pairs, 1 based on Foata normal form. 0/2097 useless extension candidates. Maximal degree in co-relation 33187. Up to 1131 conditions per place. [2022-12-06 06:03:21,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 386 places, 1015 transitions, 34032 flow [2022-12-06 06:03:21,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 2996 [2022-12-06 06:03:21,704 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:03:21,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 775 [2022-12-06 06:03:21,704 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 1015 transitions, 34042 flow [2022-12-06 06:03:21,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:21,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:21,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:21,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:21,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:21,909 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -155949155, now seen corresponding path program 1 times [2022-12-06 06:03:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:21,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685750063] [2022-12-06 06:03:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685750063] [2022-12-06 06:03:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685750063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669688165] [2022-12-06 06:03:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:22,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:22,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:22,032 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:22,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 06:03:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:22,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:03:22,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:22,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:22,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669688165] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:22,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:22,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481060400] [2022-12-06 06:03:22,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:22,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:22,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 06:03:22,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 1015 transitions, 34042 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:22,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:22,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 06:03:22,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:26,069 INFO L130 PetriNetUnfolder]: 4369/7320 cut-off events. [2022-12-06 06:03:26,069 INFO L131 PetriNetUnfolder]: For 855031/855031 co-relation queries the response was YES. [2022-12-06 06:03:26,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98154 conditions, 7320 events. 4369/7320 cut-off events. For 855031/855031 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 51964 event pairs, 724 based on Foata normal form. 26/7336 useless extension candidates. Maximal degree in co-relation 98005. Up to 6016 conditions per place. [2022-12-06 06:03:26,247 INFO L137 encePairwiseOnDemand]: 8/51 looper letters, 790 selfloop transitions, 353 changer transitions 4/1147 dead transitions. [2022-12-06 06:03:26,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1147 transitions, 38322 flow [2022-12-06 06:03:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:03:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:03:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 172 transitions. [2022-12-06 06:03:26,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1297134238310709 [2022-12-06 06:03:26,250 INFO L175 Difference]: Start difference. First operand has 386 places, 1015 transitions, 34042 flow. Second operand 26 states and 172 transitions. [2022-12-06 06:03:26,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1147 transitions, 38322 flow [2022-12-06 06:03:32,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1147 transitions, 37936 flow, removed 116 selfloop flow, removed 11 redundant places. [2022-12-06 06:03:32,509 INFO L231 Difference]: Finished difference. Result has 404 places, 1043 transitions, 35933 flow [2022-12-06 06:03:32,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=33660, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1015, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=35933, PETRI_PLACES=404, PETRI_TRANSITIONS=1043} [2022-12-06 06:03:32,511 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 386 predicate places. [2022-12-06 06:03:32,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:32,526 INFO L89 Accepts]: Start accepts. Operand has 404 places, 1043 transitions, 35933 flow [2022-12-06 06:03:32,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:32,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:32,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 404 places, 1043 transitions, 35933 flow [2022-12-06 06:03:32,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 404 places, 1043 transitions, 35933 flow [2022-12-06 06:03:33,384 INFO L130 PetriNetUnfolder]: 895/2150 cut-off events. [2022-12-06 06:03:33,384 INFO L131 PetriNetUnfolder]: For 231225/231435 co-relation queries the response was YES. [2022-12-06 06:03:33,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34823 conditions, 2150 events. 895/2150 cut-off events. For 231225/231435 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 18514 event pairs, 1 based on Foata normal form. 0/2142 useless extension candidates. Maximal degree in co-relation 34672. Up to 1154 conditions per place. [2022-12-06 06:03:33,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 404 places, 1043 transitions, 35933 flow [2022-12-06 06:03:33,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 3054 [2022-12-06 06:03:33,587 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:03:33,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1062 [2022-12-06 06:03:33,588 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 1043 transitions, 36056 flow [2022-12-06 06:03:33,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:33,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:33,588 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:33,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:33,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:33,793 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:33,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:33,794 INFO L85 PathProgramCache]: Analyzing trace with hash -155052945, now seen corresponding path program 1 times [2022-12-06 06:03:33,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:33,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133854425] [2022-12-06 06:03:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:33,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:33,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133854425] [2022-12-06 06:03:33,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133854425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:03:33,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:03:33,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:03:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345807956] [2022-12-06 06:03:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:03:33,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:03:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:03:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:03:33,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:03:33,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1043 transitions, 36056 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:33,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:33,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:03:33,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:36,892 INFO L130 PetriNetUnfolder]: 4365/7316 cut-off events. [2022-12-06 06:03:36,892 INFO L131 PetriNetUnfolder]: For 910491/910491 co-relation queries the response was YES. [2022-12-06 06:03:36,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100129 conditions, 7316 events. 4365/7316 cut-off events. For 910491/910491 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 53466 event pairs, 435 based on Foata normal form. 10/7316 useless extension candidates. Maximal degree in co-relation 99975. Up to 3445 conditions per place. [2022-12-06 06:03:37,026 INFO L137 encePairwiseOnDemand]: 31/54 looper letters, 1495 selfloop transitions, 59 changer transitions 6/1560 dead transitions. [2022-12-06 06:03:37,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1560 transitions, 56614 flow [2022-12-06 06:03:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:03:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:03:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 06:03:37,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-06 06:03:37,028 INFO L175 Difference]: Start difference. First operand has 404 places, 1043 transitions, 36056 flow. Second operand 4 states and 77 transitions. [2022-12-06 06:03:37,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1560 transitions, 56614 flow [2022-12-06 06:03:43,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1560 transitions, 55893 flow, removed 263 selfloop flow, removed 12 redundant places. [2022-12-06 06:03:43,388 INFO L231 Difference]: Finished difference. Result has 397 places, 1039 transitions, 35481 flow [2022-12-06 06:03:43,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=35284, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=979, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=35481, PETRI_PLACES=397, PETRI_TRANSITIONS=1039} [2022-12-06 06:03:43,390 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 379 predicate places. [2022-12-06 06:03:43,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:43,390 INFO L89 Accepts]: Start accepts. Operand has 397 places, 1039 transitions, 35481 flow [2022-12-06 06:03:43,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:43,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:43,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 1039 transitions, 35481 flow [2022-12-06 06:03:43,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 1039 transitions, 35481 flow [2022-12-06 06:03:43,993 INFO L130 PetriNetUnfolder]: 887/2143 cut-off events. [2022-12-06 06:03:43,993 INFO L131 PetriNetUnfolder]: For 242176/242380 co-relation queries the response was YES. [2022-12-06 06:03:44,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35274 conditions, 2143 events. 887/2143 cut-off events. For 242176/242380 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 18530 event pairs, 1 based on Foata normal form. 1/2136 useless extension candidates. Maximal degree in co-relation 35120. Up to 1147 conditions per place. [2022-12-06 06:03:44,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 1039 transitions, 35481 flow [2022-12-06 06:03:44,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 3050 [2022-12-06 06:03:44,064 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:03:44,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 674 [2022-12-06 06:03:44,064 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 1039 transitions, 35481 flow [2022-12-06 06:03:44,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:44,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:44,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:44,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 06:03:44,065 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:44,065 INFO L85 PathProgramCache]: Analyzing trace with hash -96356584, now seen corresponding path program 1 times [2022-12-06 06:03:44,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:44,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200894530] [2022-12-06 06:03:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:44,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200894530] [2022-12-06 06:03:44,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200894530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:44,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131474273] [2022-12-06 06:03:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:44,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:44,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:44,182 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:44,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 06:03:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:44,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:03:44,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:44,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:44,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131474273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:44,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:44,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835749941] [2022-12-06 06:03:44,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:44,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:44,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:44,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:03:44,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1039 transitions, 35481 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:44,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:44,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:03:44,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:48,505 INFO L130 PetriNetUnfolder]: 4609/7742 cut-off events. [2022-12-06 06:03:48,505 INFO L131 PetriNetUnfolder]: For 1040783/1040783 co-relation queries the response was YES. [2022-12-06 06:03:48,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108175 conditions, 7742 events. 4609/7742 cut-off events. For 1040783/1040783 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 55719 event pairs, 512 based on Foata normal form. 48/7780 useless extension candidates. Maximal degree in co-relation 108018. Up to 4996 conditions per place. [2022-12-06 06:03:48,668 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 593 selfloop transitions, 635 changer transitions 0/1228 dead transitions. [2022-12-06 06:03:48,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1228 transitions, 42000 flow [2022-12-06 06:03:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:03:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:03:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 188 transitions. [2022-12-06 06:03:48,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1339031339031339 [2022-12-06 06:03:48,669 INFO L175 Difference]: Start difference. First operand has 397 places, 1039 transitions, 35481 flow. Second operand 26 states and 188 transitions. [2022-12-06 06:03:48,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 1228 transitions, 42000 flow [2022-12-06 06:03:55,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 1228 transitions, 41932 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 06:03:55,764 INFO L231 Difference]: Finished difference. Result has 432 places, 1115 transitions, 40544 flow [2022-12-06 06:03:55,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=35413, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1039, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=567, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=40544, PETRI_PLACES=432, PETRI_TRANSITIONS=1115} [2022-12-06 06:03:55,765 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 414 predicate places. [2022-12-06 06:03:55,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:55,765 INFO L89 Accepts]: Start accepts. Operand has 432 places, 1115 transitions, 40544 flow [2022-12-06 06:03:55,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:55,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:55,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 1115 transitions, 40544 flow [2022-12-06 06:03:55,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 1115 transitions, 40544 flow [2022-12-06 06:03:56,728 INFO L130 PetriNetUnfolder]: 941/2275 cut-off events. [2022-12-06 06:03:56,728 INFO L131 PetriNetUnfolder]: For 280475/280670 co-relation queries the response was YES. [2022-12-06 06:03:56,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39150 conditions, 2275 events. 941/2275 cut-off events. For 280475/280670 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 19992 event pairs, 1 based on Foata normal form. 1/2268 useless extension candidates. Maximal degree in co-relation 38984. Up to 1240 conditions per place. [2022-12-06 06:03:56,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 432 places, 1115 transitions, 40544 flow [2022-12-06 06:03:56,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 3252 [2022-12-06 06:03:56,861 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:03:56,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1097 [2022-12-06 06:03:56,862 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 1115 transitions, 40544 flow [2022-12-06 06:03:56,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:56,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:56,862 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:56,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:57,068 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 06:03:57,068 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1495698012, now seen corresponding path program 1 times [2022-12-06 06:03:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:57,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760613227] [2022-12-06 06:03:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:57,132 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 06:03:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:57,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760613227] [2022-12-06 06:03:57,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760613227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:57,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536242375] [2022-12-06 06:03:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:57,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:57,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:57,134 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:57,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 06:03:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:57,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 06:03:57,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:57,243 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 06:03:57,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:03:57,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536242375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:03:57,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:03:57,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 06:03:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911948366] [2022-12-06 06:03:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:03:57,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:03:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:03:57,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:03:57,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:03:57,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1115 transitions, 40544 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 06:03:57,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:57,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:03:57,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:00,932 INFO L130 PetriNetUnfolder]: 4970/8302 cut-off events. [2022-12-06 06:04:00,932 INFO L131 PetriNetUnfolder]: For 1209131/1209131 co-relation queries the response was YES. [2022-12-06 06:04:01,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122318 conditions, 8302 events. 4970/8302 cut-off events. For 1209131/1209131 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 61107 event pairs, 680 based on Foata normal form. 146/8438 useless extension candidates. Maximal degree in co-relation 122149. Up to 4249 conditions per place. [2022-12-06 06:04:01,191 INFO L137 encePairwiseOnDemand]: 34/54 looper letters, 1510 selfloop transitions, 206 changer transitions 6/1722 dead transitions. [2022-12-06 06:04:01,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 1722 transitions, 66251 flow [2022-12-06 06:04:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:04:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:04:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 06:04:01,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24867724867724866 [2022-12-06 06:04:01,192 INFO L175 Difference]: Start difference. First operand has 432 places, 1115 transitions, 40544 flow. Second operand 7 states and 94 transitions. [2022-12-06 06:04:01,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 1722 transitions, 66251 flow [2022-12-06 06:04:07,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 1722 transitions, 64431 flow, removed 756 selfloop flow, removed 12 redundant places. [2022-12-06 06:04:07,750 INFO L231 Difference]: Finished difference. Result has 430 places, 1137 transitions, 41282 flow [2022-12-06 06:04:07,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=38186, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1080, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=41282, PETRI_PLACES=430, PETRI_TRANSITIONS=1137} [2022-12-06 06:04:07,752 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 412 predicate places. [2022-12-06 06:04:07,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:07,752 INFO L89 Accepts]: Start accepts. Operand has 430 places, 1137 transitions, 41282 flow [2022-12-06 06:04:07,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:07,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:07,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 1137 transitions, 41282 flow [2022-12-06 06:04:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 1137 transitions, 41282 flow [2022-12-06 06:04:08,612 INFO L130 PetriNetUnfolder]: 1024/2504 cut-off events. [2022-12-06 06:04:08,613 INFO L131 PetriNetUnfolder]: For 322178/322388 co-relation queries the response was YES. [2022-12-06 06:04:08,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43762 conditions, 2504 events. 1024/2504 cut-off events. For 322178/322388 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 22676 event pairs, 1 based on Foata normal form. 6/2503 useless extension candidates. Maximal degree in co-relation 43597. Up to 1355 conditions per place. [2022-12-06 06:04:08,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 1137 transitions, 41282 flow [2022-12-06 06:04:08,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 3522 [2022-12-06 06:04:08,776 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:04:08,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1025 [2022-12-06 06:04:08,777 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1137 transitions, 41282 flow [2022-12-06 06:04:08,777 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 06:04:08,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:08,778 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:08,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 06:04:08,983 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 06:04:08,983 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:04:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1823362163, now seen corresponding path program 1 times [2022-12-06 06:04:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:08,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986132201] [2022-12-06 06:04:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:09,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986132201] [2022-12-06 06:04:09,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986132201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058959509] [2022-12-06 06:04:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:09,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:09,128 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:04:09,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 06:04:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:09,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:04:09,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:09,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:04:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:09,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058959509] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:04:09,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:04:09,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:04:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549922353] [2022-12-06 06:04:09,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:04:09,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:04:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:09,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:04:09,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:04:09,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:04:09,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1137 transitions, 41282 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:09,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:09,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:04:09,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:14,571 INFO L130 PetriNetUnfolder]: 5096/8558 cut-off events. [2022-12-06 06:04:14,571 INFO L131 PetriNetUnfolder]: For 1301992/1301992 co-relation queries the response was YES. [2022-12-06 06:04:14,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126548 conditions, 8558 events. 5096/8558 cut-off events. For 1301992/1301992 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 62746 event pairs, 785 based on Foata normal form. 70/8622 useless extension candidates. Maximal degree in co-relation 126380. Up to 6687 conditions per place. [2022-12-06 06:04:14,706 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 864 selfloop transitions, 484 changer transitions 12/1360 dead transitions. [2022-12-06 06:04:14,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 1360 transitions, 48974 flow [2022-12-06 06:04:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 06:04:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 06:04:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 203 transitions. [2022-12-06 06:04:14,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11391694725028058 [2022-12-06 06:04:14,708 INFO L175 Difference]: Start difference. First operand has 430 places, 1137 transitions, 41282 flow. Second operand 33 states and 203 transitions. [2022-12-06 06:04:14,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 1360 transitions, 48974 flow [2022-12-06 06:04:21,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 1360 transitions, 47928 flow, removed 520 selfloop flow, removed 2 redundant places. [2022-12-06 06:04:21,926 INFO L231 Difference]: Finished difference. Result has 466 places, 1198 transitions, 44672 flow [2022-12-06 06:04:21,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=40302, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=436, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=44672, PETRI_PLACES=466, PETRI_TRANSITIONS=1198} [2022-12-06 06:04:21,927 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 448 predicate places. [2022-12-06 06:04:21,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:21,927 INFO L89 Accepts]: Start accepts. Operand has 466 places, 1198 transitions, 44672 flow [2022-12-06 06:04:21,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:21,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:21,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 466 places, 1198 transitions, 44672 flow [2022-12-06 06:04:21,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 1198 transitions, 44672 flow [2022-12-06 06:04:22,880 INFO L130 PetriNetUnfolder]: 1076/2621 cut-off events. [2022-12-06 06:04:22,881 INFO L131 PetriNetUnfolder]: For 354441/354633 co-relation queries the response was YES. [2022-12-06 06:04:22,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46567 conditions, 2621 events. 1076/2621 cut-off events. For 354441/354633 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 23911 event pairs, 1 based on Foata normal form. 3/2617 useless extension candidates. Maximal degree in co-relation 46395. Up to 1437 conditions per place. [2022-12-06 06:04:22,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 466 places, 1198 transitions, 44672 flow [2022-12-06 06:04:22,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 3650 [2022-12-06 06:04:23,038 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:04:23,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1111 [2022-12-06 06:04:23,038 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 1198 transitions, 44687 flow [2022-12-06 06:04:23,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:23,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:23,039 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:23,043 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 06:04:23,239 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 06:04:23,239 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:04:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -874417656, now seen corresponding path program 2 times [2022-12-06 06:04:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:23,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365558539] [2022-12-06 06:04:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:23,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365558539] [2022-12-06 06:04:23,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365558539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:23,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592717891] [2022-12-06 06:04:23,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:04:23,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:23,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:23,328 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:04:23,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 06:04:23,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:04:23,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:04:23,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 06:04:23,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:23,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:04:23,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592717891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:04:23,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:04:23,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-12-06 06:04:23,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209057729] [2022-12-06 06:04:23,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:04:23,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:04:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:23,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:04:23,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:04:23,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 06:04:23,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1198 transitions, 44687 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:23,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:23,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 06:04:23,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:27,483 INFO L130 PetriNetUnfolder]: 4866/8252 cut-off events. [2022-12-06 06:04:27,484 INFO L131 PetriNetUnfolder]: For 1175740/1175740 co-relation queries the response was YES. [2022-12-06 06:04:27,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123788 conditions, 8252 events. 4866/8252 cut-off events. For 1175740/1175740 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 63051 event pairs, 772 based on Foata normal form. 88/8334 useless extension candidates. Maximal degree in co-relation 123613. Up to 3856 conditions per place. [2022-12-06 06:04:27,604 INFO L137 encePairwiseOnDemand]: 46/56 looper letters, 1816 selfloop transitions, 31 changer transitions 84/1931 dead transitions. [2022-12-06 06:04:27,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1931 transitions, 75702 flow [2022-12-06 06:04:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:04:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:04:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 06:04:27,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2022-12-06 06:04:27,605 INFO L175 Difference]: Start difference. First operand has 466 places, 1198 transitions, 44687 flow. Second operand 6 states and 95 transitions. [2022-12-06 06:04:27,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1931 transitions, 75702 flow [2022-12-06 06:04:33,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 1931 transitions, 73882 flow, removed 744 selfloop flow, removed 15 redundant places. [2022-12-06 06:04:33,468 INFO L231 Difference]: Finished difference. Result has 458 places, 1183 transitions, 43177 flow [2022-12-06 06:04:33,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=42704, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=43177, PETRI_PLACES=458, PETRI_TRANSITIONS=1183} [2022-12-06 06:04:33,469 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 440 predicate places. [2022-12-06 06:04:33,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:33,470 INFO L89 Accepts]: Start accepts. Operand has 458 places, 1183 transitions, 43177 flow [2022-12-06 06:04:33,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:33,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:33,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 458 places, 1183 transitions, 43177 flow [2022-12-06 06:04:33,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 1183 transitions, 43177 flow [2022-12-06 06:04:34,377 INFO L130 PetriNetUnfolder]: 1017/2551 cut-off events. [2022-12-06 06:04:34,377 INFO L131 PetriNetUnfolder]: For 346968/347175 co-relation queries the response was YES. [2022-12-06 06:04:34,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45659 conditions, 2551 events. 1017/2551 cut-off events. For 346968/347175 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 23653 event pairs, 2 based on Foata normal form. 15/2560 useless extension candidates. Maximal degree in co-relation 45486. Up to 1320 conditions per place. [2022-12-06 06:04:34,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 458 places, 1183 transitions, 43177 flow [2022-12-06 06:04:34,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 3606 [2022-12-06 06:04:34,449 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:04:34,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 981 [2022-12-06 06:04:34,450 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 1183 transitions, 43177 flow [2022-12-06 06:04:34,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:34,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:34,450 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:34,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 06:04:34,651 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 06:04:34,651 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:04:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1079803568, now seen corresponding path program 1 times [2022-12-06 06:04:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:34,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183646193] [2022-12-06 06:04:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:34,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183646193] [2022-12-06 06:04:34,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183646193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:34,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396448040] [2022-12-06 06:04:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:34,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:34,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:34,784 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:04:34,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 06:04:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:34,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:04:34,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:34,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:04:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:35,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396448040] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:04:35,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:04:35,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 06:04:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622367099] [2022-12-06 06:04:35,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:04:35,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 06:04:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 06:04:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-12-06 06:04:35,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 06:04:35,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 1183 transitions, 43177 flow. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:35,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:35,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 06:04:35,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:40,482 INFO L130 PetriNetUnfolder]: 5127/8774 cut-off events. [2022-12-06 06:04:40,482 INFO L131 PetriNetUnfolder]: For 1567030/1567030 co-relation queries the response was YES. [2022-12-06 06:04:40,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133412 conditions, 8774 events. 5127/8774 cut-off events. For 1567030/1567030 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 65597 event pairs, 769 based on Foata normal form. 109/8877 useless extension candidates. Maximal degree in co-relation 133236. Up to 6433 conditions per place. [2022-12-06 06:04:40,630 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 945 selfloop transitions, 558 changer transitions 3/1506 dead transitions. [2022-12-06 06:04:40,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1506 transitions, 53724 flow [2022-12-06 06:04:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 06:04:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 06:04:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 211 transitions. [2022-12-06 06:04:40,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11774553571428571 [2022-12-06 06:04:40,631 INFO L175 Difference]: Start difference. First operand has 458 places, 1183 transitions, 43177 flow. Second operand 32 states and 211 transitions. [2022-12-06 06:04:40,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1506 transitions, 53724 flow [2022-12-06 06:04:48,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 1506 transitions, 53665 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-06 06:04:49,034 INFO L231 Difference]: Finished difference. Result has 494 places, 1302 transitions, 49947 flow [2022-12-06 06:04:49,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=43118, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=49947, PETRI_PLACES=494, PETRI_TRANSITIONS=1302} [2022-12-06 06:04:49,035 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 476 predicate places. [2022-12-06 06:04:49,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:49,035 INFO L89 Accepts]: Start accepts. Operand has 494 places, 1302 transitions, 49947 flow [2022-12-06 06:04:49,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:49,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:49,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 494 places, 1302 transitions, 49947 flow [2022-12-06 06:04:49,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 494 places, 1302 transitions, 49947 flow [2022-12-06 06:04:49,985 INFO L130 PetriNetUnfolder]: 1104/2791 cut-off events. [2022-12-06 06:04:49,985 INFO L131 PetriNetUnfolder]: For 391095/391293 co-relation queries the response was YES. [2022-12-06 06:04:50,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51803 conditions, 2791 events. 1104/2791 cut-off events. For 391095/391293 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 25792 event pairs, 1 based on Foata normal form. 15/2803 useless extension candidates. Maximal degree in co-relation 51622. Up to 1480 conditions per place. [2022-12-06 06:04:50,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 494 places, 1302 transitions, 49947 flow [2022-12-06 06:04:50,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 3900 [2022-12-06 06:04:50,221 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:04:50,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:04:50,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= 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 06:04:50,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:04:50,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:04:50,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:04:50,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:04:50,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= 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 06:04:50,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= 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 06:04:50,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:04:50,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (< v_~x~0_35 14)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (<= v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|) (<= v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 6) (= 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 06:04:51,205 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:04:51,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2171 [2022-12-06 06:04:51,206 INFO L495 AbstractCegarLoop]: Abstraction has has 494 places, 1302 transitions, 52088 flow [2022-12-06 06:04:51,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:51,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:51,206 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:51,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-06 06:04:51,411 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 06:04:51,411 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:04:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1865608395, now seen corresponding path program 2 times [2022-12-06 06:04:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:51,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873131891] [2022-12-06 06:04:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:51,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873131891] [2022-12-06 06:04:51,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873131891] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:51,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740192257] [2022-12-06 06:04:51,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:04:51,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:51,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:51,451 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:04:51,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 06:04:51,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:04:51,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:04:51,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 06:04:51,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:51,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:04:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740192257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:04:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:04:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-06 06:04:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385921731] [2022-12-06 06:04:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:04:51,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:04:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:04:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:04:51,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 06:04:51,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1302 transitions, 52088 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:51,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:51,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 06:04:51,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:57,887 INFO L130 PetriNetUnfolder]: 5377/9126 cut-off events. [2022-12-06 06:04:57,888 INFO L131 PetriNetUnfolder]: For 1471144/1471144 co-relation queries the response was YES. [2022-12-06 06:04:58,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145083 conditions, 9126 events. 5377/9126 cut-off events. For 1471144/1471144 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 70554 event pairs, 743 based on Foata normal form. 124/9244 useless extension candidates. Maximal degree in co-relation 144899. Up to 4583 conditions per place. [2022-12-06 06:04:58,100 INFO L137 encePairwiseOnDemand]: 59/71 looper letters, 1838 selfloop transitions, 178 changer transitions 84/2100 dead transitions. [2022-12-06 06:04:58,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 2100 transitions, 87806 flow [2022-12-06 06:04:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:04:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:04:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-06 06:04:58,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24949698189134809 [2022-12-06 06:04:58,101 INFO L175 Difference]: Start difference. First operand has 494 places, 1302 transitions, 52088 flow. Second operand 7 states and 124 transitions. [2022-12-06 06:04:58,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 2100 transitions, 87806 flow [2022-12-06 06:05:09,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 2100 transitions, 80564 flow, removed 3356 selfloop flow, removed 21 redundant places. [2022-12-06 06:05:10,063 INFO L231 Difference]: Finished difference. Result has 483 places, 1346 transitions, 49532 flow [2022-12-06 06:05:10,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=46053, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=49532, PETRI_PLACES=483, PETRI_TRANSITIONS=1346} [2022-12-06 06:05:10,065 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 465 predicate places. [2022-12-06 06:05:10,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:10,065 INFO L89 Accepts]: Start accepts. Operand has 483 places, 1346 transitions, 49532 flow [2022-12-06 06:05:10,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:10,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:10,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 483 places, 1346 transitions, 49532 flow [2022-12-06 06:05:10,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 483 places, 1346 transitions, 49532 flow [2022-12-06 06:05:11,402 INFO L130 PetriNetUnfolder]: 1155/2937 cut-off events. [2022-12-06 06:05:11,403 INFO L131 PetriNetUnfolder]: For 325034/325243 co-relation queries the response was YES. [2022-12-06 06:05:11,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52998 conditions, 2937 events. 1155/2937 cut-off events. For 325034/325243 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 27854 event pairs, 6 based on Foata normal form. 29/2962 useless extension candidates. Maximal degree in co-relation 52825. Up to 1442 conditions per place. [2022-12-06 06:05:11,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 483 places, 1346 transitions, 49532 flow [2022-12-06 06:05:11,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 4180 [2022-12-06 06:05:11,529 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:05:11,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1469 [2022-12-06 06:05:11,534 INFO L495 AbstractCegarLoop]: Abstraction has has 483 places, 1346 transitions, 49532 flow [2022-12-06 06:05:11,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:11,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:11,535 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:11,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 06:05:11,739 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 06:05:11,739 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting L695-5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:05:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1159874769, now seen corresponding path program 1 times [2022-12-06 06:05:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:11,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95323726] [2022-12-06 06:05:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:12,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:12,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95323726] [2022-12-06 06:05:12,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95323726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:12,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459616610] [2022-12-06 06:05:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:12,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:12,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:12,030 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:05:12,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 06:05:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:12,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:05:12,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:12,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:12,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459616610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:12,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:12,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 06:05:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125054594] [2022-12-06 06:05:12,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:12,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 06:05:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 06:05:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-12-06 06:05:12,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 06:05:12,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 1346 transitions, 49532 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:12,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:12,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 06:05:12,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:21,796 INFO L130 PetriNetUnfolder]: 5964/10217 cut-off events. [2022-12-06 06:05:21,797 INFO L131 PetriNetUnfolder]: For 1247879/1247879 co-relation queries the response was YES. [2022-12-06 06:05:21,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155359 conditions, 10217 events. 5964/10217 cut-off events. For 1247879/1247879 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 78909 event pairs, 567 based on Foata normal form. 109/10316 useless extension candidates. Maximal degree in co-relation 155183. Up to 6544 conditions per place. [2022-12-06 06:05:22,042 INFO L137 encePairwiseOnDemand]: 12/69 looper letters, 964 selfloop transitions, 861 changer transitions 3/1828 dead transitions. [2022-12-06 06:05:22,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 1828 transitions, 65776 flow [2022-12-06 06:05:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 06:05:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 06:05:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 292 transitions. [2022-12-06 06:05:22,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10579710144927536 [2022-12-06 06:05:22,043 INFO L175 Difference]: Start difference. First operand has 483 places, 1346 transitions, 49532 flow. Second operand 40 states and 292 transitions. [2022-12-06 06:05:22,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 1828 transitions, 65776 flow [2022-12-06 06:05:33,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 1828 transitions, 65226 flow, removed 267 selfloop flow, removed 3 redundant places. [2022-12-06 06:05:33,127 INFO L231 Difference]: Finished difference. Result has 533 places, 1578 transitions, 61379 flow [2022-12-06 06:05:33,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=48819, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=654, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=61379, PETRI_PLACES=533, PETRI_TRANSITIONS=1578} [2022-12-06 06:05:33,129 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 515 predicate places. [2022-12-06 06:05:33,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:33,129 INFO L89 Accepts]: Start accepts. Operand has 533 places, 1578 transitions, 61379 flow [2022-12-06 06:05:33,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:33,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:33,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 533 places, 1578 transitions, 61379 flow [2022-12-06 06:05:33,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 533 places, 1578 transitions, 61379 flow [2022-12-06 06:05:34,779 INFO L130 PetriNetUnfolder]: 1252/3237 cut-off events. [2022-12-06 06:05:34,779 INFO L131 PetriNetUnfolder]: For 411543/411761 co-relation queries the response was YES. [2022-12-06 06:05:34,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61429 conditions, 3237 events. 1252/3237 cut-off events. For 411543/411761 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 31437 event pairs, 6 based on Foata normal form. 30/3263 useless extension candidates. Maximal degree in co-relation 61240. Up to 1648 conditions per place. [2022-12-06 06:05:35,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 533 places, 1578 transitions, 61379 flow [2022-12-06 06:05:35,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 4710 [2022-12-06 06:05:35,342 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:05:35,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2214 [2022-12-06 06:05:35,343 INFO L495 AbstractCegarLoop]: Abstraction has has 533 places, 1578 transitions, 61487 flow [2022-12-06 06:05:35,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:35,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:35,343 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:35,348 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 06:05:35,544 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 06:05:35,544 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:05:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1278667160, now seen corresponding path program 1 times [2022-12-06 06:05:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:35,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864982837] [2022-12-06 06:05:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:35,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:35,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864982837] [2022-12-06 06:05:35,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864982837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:35,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271647514] [2022-12-06 06:05:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:35,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:35,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:35,681 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:05:35,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 06:05:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:35,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:05:35,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:35,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:36,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271647514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:36,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:36,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:05:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746112196] [2022-12-06 06:05:36,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:36,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:05:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:05:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:05:36,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 06:05:36,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 1578 transitions, 61487 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:36,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:36,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 06:05:36,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:44,325 INFO L130 PetriNetUnfolder]: 6638/11395 cut-off events. [2022-12-06 06:05:44,325 INFO L131 PetriNetUnfolder]: For 1686845/1686845 co-relation queries the response was YES. [2022-12-06 06:05:44,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183009 conditions, 11395 events. 6638/11395 cut-off events. For 1686845/1686845 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 89815 event pairs, 624 based on Foata normal form. 105/11490 useless extension candidates. Maximal degree in co-relation 182817. Up to 6743 conditions per place. [2022-12-06 06:05:44,655 INFO L137 encePairwiseOnDemand]: 13/70 looper letters, 985 selfloop transitions, 1007 changer transitions 1/1993 dead transitions. [2022-12-06 06:05:44,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 1993 transitions, 77370 flow [2022-12-06 06:05:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 06:05:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 06:05:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 235 transitions. [2022-12-06 06:05:44,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10829493087557604 [2022-12-06 06:05:44,657 INFO L175 Difference]: Start difference. First operand has 533 places, 1578 transitions, 61487 flow. Second operand 31 states and 235 transitions. [2022-12-06 06:05:44,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 1993 transitions, 77370 flow [2022-12-06 06:05:56,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 1993 transitions, 74942 flow, removed 1097 selfloop flow, removed 12 redundant places. [2022-12-06 06:05:56,220 INFO L231 Difference]: Finished difference. Result has 563 places, 1755 transitions, 70883 flow [2022-12-06 06:05:56,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=58982, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=840, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=70883, PETRI_PLACES=563, PETRI_TRANSITIONS=1755} [2022-12-06 06:05:56,221 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 545 predicate places. [2022-12-06 06:05:56,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:56,221 INFO L89 Accepts]: Start accepts. Operand has 563 places, 1755 transitions, 70883 flow [2022-12-06 06:05:56,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:56,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:56,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 563 places, 1755 transitions, 70883 flow [2022-12-06 06:05:56,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 563 places, 1755 transitions, 70883 flow [2022-12-06 06:05:57,838 INFO L130 PetriNetUnfolder]: 1377/3582 cut-off events. [2022-12-06 06:05:57,838 INFO L131 PetriNetUnfolder]: For 529192/529406 co-relation queries the response was YES. [2022-12-06 06:05:57,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70909 conditions, 3582 events. 1377/3582 cut-off events. For 529192/529406 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 35526 event pairs, 6 based on Foata normal form. 25/3603 useless extension candidates. Maximal degree in co-relation 70710. Up to 1869 conditions per place. [2022-12-06 06:05:57,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 563 places, 1755 transitions, 70883 flow [2022-12-06 06:05:57,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 5170 [2022-12-06 06:05:57,949 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:05:57,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1729 [2022-12-06 06:05:57,950 INFO L495 AbstractCegarLoop]: Abstraction has has 563 places, 1755 transitions, 70883 flow [2022-12-06 06:05:57,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:57,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:57,950 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:57,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 06:05:58,152 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 06:05:58,153 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:05:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash -112643054, now seen corresponding path program 1 times [2022-12-06 06:05:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:58,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920312397] [2022-12-06 06:05:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:58,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:58,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920312397] [2022-12-06 06:05:58,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920312397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:58,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113259124] [2022-12-06 06:05:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:58,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:58,249 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:05:58,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 06:05:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:58,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:05:58,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:58,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:58,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113259124] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:58,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:58,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:05:58,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875809355] [2022-12-06 06:05:58,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:58,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:05:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:05:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:05:58,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 06:05:58,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 1755 transitions, 70883 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:05:58,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:58,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 06:05:58,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:06:06,815 INFO L130 PetriNetUnfolder]: 6670/11459 cut-off events. [2022-12-06 06:06:06,815 INFO L131 PetriNetUnfolder]: For 1631890/1631890 co-relation queries the response was YES. [2022-12-06 06:06:06,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187296 conditions, 11459 events. 6670/11459 cut-off events. For 1631890/1631890 co-relation queries the response was YES. Maximal size of possible extension queue 1230. Compared 90511 event pairs, 1326 based on Foata normal form. 24/11473 useless extension candidates. Maximal degree in co-relation 187094. Up to 10078 conditions per place. [2022-12-06 06:06:07,035 INFO L137 encePairwiseOnDemand]: 21/68 looper letters, 1517 selfloop transitions, 376 changer transitions 0/1893 dead transitions. [2022-12-06 06:06:07,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 1893 transitions, 77216 flow [2022-12-06 06:06:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 06:06:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 06:06:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 172 transitions. [2022-12-06 06:06:07,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11497326203208556 [2022-12-06 06:06:07,037 INFO L175 Difference]: Start difference. First operand has 563 places, 1755 transitions, 70883 flow. Second operand 22 states and 172 transitions. [2022-12-06 06:06:07,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 1893 transitions, 77216 flow [2022-12-06 06:06:19,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 1893 transitions, 74309 flow, removed 1373 selfloop flow, removed 9 redundant places. [2022-12-06 06:06:19,314 INFO L231 Difference]: Finished difference. Result has 579 places, 1771 transitions, 70098 flow [2022-12-06 06:06:19,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=68048, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=70098, PETRI_PLACES=579, PETRI_TRANSITIONS=1771} [2022-12-06 06:06:19,315 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 561 predicate places. [2022-12-06 06:06:19,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:06:19,315 INFO L89 Accepts]: Start accepts. Operand has 579 places, 1771 transitions, 70098 flow [2022-12-06 06:06:19,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:06:19,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:06:19,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 579 places, 1771 transitions, 70098 flow [2022-12-06 06:06:19,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 579 places, 1771 transitions, 70098 flow [2022-12-06 06:06:20,839 INFO L130 PetriNetUnfolder]: 1394/3606 cut-off events. [2022-12-06 06:06:20,840 INFO L131 PetriNetUnfolder]: For 556724/556957 co-relation queries the response was YES. [2022-12-06 06:06:20,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70354 conditions, 3606 events. 1394/3606 cut-off events. For 556724/556957 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 35674 event pairs, 6 based on Foata normal form. 28/3630 useless extension candidates. Maximal degree in co-relation 70150. Up to 1763 conditions per place. [2022-12-06 06:06:20,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 579 places, 1771 transitions, 70098 flow [2022-12-06 06:06:20,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 5202 [2022-12-06 06:06:21,184 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:06:21,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1870 [2022-12-06 06:06:21,185 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 1771 transitions, 70183 flow [2022-12-06 06:06:21,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:06:21,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:06:21,185 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:06:21,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 06:06:21,390 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 06:06:21,390 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:06:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:06:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1859664561, now seen corresponding path program 1 times [2022-12-06 06:06:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:06:21,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869378173] [2022-12-06 06:06:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:06:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:06:21,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869378173] [2022-12-06 06:06:21,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869378173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:06:21,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743419070] [2022-12-06 06:06:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:21,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:06:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:06:21,521 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:06:21,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 06:06:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:21,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:06:21,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:06:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:21,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:06:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:21,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743419070] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:06:21,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:06:21,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:06:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890381655] [2022-12-06 06:06:21,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:06:21,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:06:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:06:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:06:21,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:06:21,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 06:06:21,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 1771 transitions, 70183 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:06:21,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:06:21,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 06:06:21,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:06:32,211 INFO L130 PetriNetUnfolder]: 7362/12645 cut-off events. [2022-12-06 06:06:32,211 INFO L131 PetriNetUnfolder]: For 2303720/2303720 co-relation queries the response was YES. [2022-12-06 06:06:32,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206492 conditions, 12645 events. 7362/12645 cut-off events. For 2303720/2303720 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 101125 event pairs, 584 based on Foata normal form. 134/12769 useless extension candidates. Maximal degree in co-relation 206285. Up to 7356 conditions per place. [2022-12-06 06:06:32,436 INFO L137 encePairwiseOnDemand]: 11/72 looper letters, 1107 selfloop transitions, 1098 changer transitions 9/2214 dead transitions. [2022-12-06 06:06:32,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 2214 transitions, 85707 flow [2022-12-06 06:06:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 06:06:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 06:06:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 256 transitions. [2022-12-06 06:06:32,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09876543209876543 [2022-12-06 06:06:32,437 INFO L175 Difference]: Start difference. First operand has 579 places, 1771 transitions, 70183 flow. Second operand 36 states and 256 transitions. [2022-12-06 06:06:32,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 2214 transitions, 85707 flow [2022-12-06 06:06:46,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 2214 transitions, 85342 flow, removed 115 selfloop flow, removed 9 redundant places. [2022-12-06 06:06:46,484 INFO L231 Difference]: Finished difference. Result has 617 places, 1939 transitions, 80803 flow [2022-12-06 06:06:46,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=69770, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=954, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=80803, PETRI_PLACES=617, PETRI_TRANSITIONS=1939} [2022-12-06 06:06:46,485 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 599 predicate places. [2022-12-06 06:06:46,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:06:46,486 INFO L89 Accepts]: Start accepts. Operand has 617 places, 1939 transitions, 80803 flow [2022-12-06 06:06:46,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:06:46,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:06:46,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 617 places, 1939 transitions, 80803 flow [2022-12-06 06:06:46,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 617 places, 1939 transitions, 80803 flow [2022-12-06 06:06:48,261 INFO L130 PetriNetUnfolder]: 1534/3976 cut-off events. [2022-12-06 06:06:48,261 INFO L131 PetriNetUnfolder]: For 716598/716839 co-relation queries the response was YES. [2022-12-06 06:06:48,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82181 conditions, 3976 events. 1534/3976 cut-off events. For 716598/716839 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 40102 event pairs, 8 based on Foata normal form. 26/3998 useless extension candidates. Maximal degree in co-relation 81964. Up to 2020 conditions per place. [2022-12-06 06:06:48,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 617 places, 1939 transitions, 80803 flow [2022-12-06 06:06:48,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 5682 [2022-12-06 06:06:48,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-06 06:06:48,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L705-6-->L705-6: Formula: (and (= (+ (* 233 v_~cur~0_117) (* 144 v_~prev~0_145) v_~prev~0_143) v_~next~0_74) (= (+ (* 233 v_~prev~0_145) (* 377 v_~cur~0_117)) v_~prev~0_143) (= (+ 14 v_~x~0_131) v_~x~0_129) (< v_~x~0_131 1) (= v_~cur~0_115 v_~next~0_74)) InVars {~prev~0=v_~prev~0_145, ~cur~0=v_~cur~0_117, ~x~0=v_~x~0_131} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_79|, ~next~0=v_~next~0_74, ~prev~0=v_~prev~0_143, ~cur~0=v_~cur~0_115, ~x~0=v_~x~0_129} 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 6) (= 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 06:06:48,740 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 6)) 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 [433] L705-6-->L695-5: Formula: (and (= v_~x~0_349 (+ 14 v_~x~0_350)) (= (+ (* 233 v_~cur~0_281) v_~prev~0_361 (* 144 v_~prev~0_362)) v_~next~0_175) (< v_~x~0_350 1) (< v_~q~0_361 6) (= (+ (* 377 v_~cur~0_281) (* 233 v_~prev~0_362)) v_~prev~0_361) (= v_~next~0_175 v_~cur~0_280) (= v_~j~0_515 (+ v_~j~0_516 v_~i~0_541)) (= (+ v_~q~0_361 1) v_~q~0_360)) InVars {~j~0=v_~j~0_516, ~prev~0=v_~prev~0_362, ~i~0=v_~i~0_541, ~q~0=v_~q~0_361, ~cur~0=v_~cur~0_281, ~x~0=v_~x~0_350} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_209|, ~j~0=v_~j~0_515, ~next~0=v_~next~0_175, ~prev~0=v_~prev~0_361, ~i~0=v_~i~0_541, ~q~0=v_~q~0_360, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_254|, ~cur~0=v_~cur~0_280, ~x~0=v_~x~0_349} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-06 06:06:48,831 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:06:48,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2347 [2022-12-06 06:06:48,832 INFO L495 AbstractCegarLoop]: Abstraction has has 617 places, 1939 transitions, 80859 flow [2022-12-06 06:06:48,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:06:48,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:06:48,832 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:06:48,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 06:06:49,038 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 06:06:49,038 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:06:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:06:49,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1813259390, now seen corresponding path program 1 times [2022-12-06 06:06:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:06:49,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994963108] [2022-12-06 06:06:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:06:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:06:49,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994963108] [2022-12-06 06:06:49,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994963108] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:06:49,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228396847] [2022-12-06 06:06:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:49,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:06:49,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:06:49,146 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:06:49,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 06:06:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:49,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:06:49,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:06:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:49,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:06:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:49,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228396847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:06:49,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:06:49,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:06:49,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511357793] [2022-12-06 06:06:49,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:06:49,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:06:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:06:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:06:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:06:49,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 06:06:49,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 1939 transitions, 80859 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:06:49,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:06:49,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 06:06:49,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:00,915 INFO L130 PetriNetUnfolder]: 7546/13025 cut-off events. [2022-12-06 06:07:00,916 INFO L131 PetriNetUnfolder]: For 2343450/2343450 co-relation queries the response was YES. [2022-12-06 06:07:01,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219245 conditions, 13025 events. 7546/13025 cut-off events. For 2343450/2343450 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 105571 event pairs, 1126 based on Foata normal form. 74/13089 useless extension candidates. Maximal degree in co-relation 219025. Up to 9883 conditions per place. [2022-12-06 06:07:01,178 INFO L137 encePairwiseOnDemand]: 11/73 looper letters, 1465 selfloop transitions, 785 changer transitions 9/2259 dead transitions. [2022-12-06 06:07:01,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 2259 transitions, 92480 flow [2022-12-06 06:07:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 06:07:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 06:07:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 204 transitions. [2022-12-06 06:07:01,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09636277751535191 [2022-12-06 06:07:01,180 INFO L175 Difference]: Start difference. First operand has 617 places, 1939 transitions, 80859 flow. Second operand 29 states and 204 transitions. [2022-12-06 06:07:01,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 2259 transitions, 92480 flow [2022-12-06 06:07:19,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 2259 transitions, 89968 flow, removed 1172 selfloop flow, removed 11 redundant places. [2022-12-06 06:07:19,993 INFO L231 Difference]: Finished difference. Result has 641 places, 2029 transitions, 85043 flow [2022-12-06 06:07:19,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=78525, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=699, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=85043, PETRI_PLACES=641, PETRI_TRANSITIONS=2029} [2022-12-06 06:07:19,994 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 623 predicate places. [2022-12-06 06:07:19,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:19,995 INFO L89 Accepts]: Start accepts. Operand has 641 places, 2029 transitions, 85043 flow [2022-12-06 06:07:20,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:20,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:20,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 641 places, 2029 transitions, 85043 flow [2022-12-06 06:07:20,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 640 places, 2029 transitions, 85043 flow [2022-12-06 06:07:22,160 INFO L130 PetriNetUnfolder]: 1574/4139 cut-off events. [2022-12-06 06:07:22,160 INFO L131 PetriNetUnfolder]: For 736112/736399 co-relation queries the response was YES. [2022-12-06 06:07:22,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84762 conditions, 4139 events. 1574/4139 cut-off events. For 736112/736399 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 42377 event pairs, 9 based on Foata normal form. 30/4165 useless extension candidates. Maximal degree in co-relation 84538. Up to 2090 conditions per place. [2022-12-06 06:07:22,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 640 places, 2029 transitions, 85043 flow [2022-12-06 06:07:22,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 5890 [2022-12-06 06:07:22,324 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:07:22,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2331 [2022-12-06 06:07:22,325 INFO L495 AbstractCegarLoop]: Abstraction has has 640 places, 2029 transitions, 85043 flow [2022-12-06 06:07:22,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:07:22,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:07:22,325 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:07:22,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-06 06:07:22,530 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 06:07:22,530 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:07:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:07:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1709168396, now seen corresponding path program 1 times [2022-12-06 06:07:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:07:22,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922291797] [2022-12-06 06:07:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:07:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:07:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922291797] [2022-12-06 06:07:22,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922291797] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:07:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137221106] [2022-12-06 06:07:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:22,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:07:22,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:07:22,643 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:07:22,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 06:07:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:22,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:07:22,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:07:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:23,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:07:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:23,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137221106] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:07:23,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:07:23,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:07:23,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953837481] [2022-12-06 06:07:23,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:07:23,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:07:23,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:07:23,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:07:23,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:07:23,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 06:07:23,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 2029 transitions, 85043 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:07:23,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:07:23,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 06:07:23,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:35,493 INFO L130 PetriNetUnfolder]: 8319/14305 cut-off events. [2022-12-06 06:07:35,494 INFO L131 PetriNetUnfolder]: For 2742685/2742685 co-relation queries the response was YES. [2022-12-06 06:07:35,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246092 conditions, 14305 events. 8319/14305 cut-off events. For 2742685/2742685 co-relation queries the response was YES. Maximal size of possible extension queue 1470. Compared 116903 event pairs, 398 based on Foata normal form. 42/14337 useless extension candidates. Maximal degree in co-relation 245865. Up to 6022 conditions per place. [2022-12-06 06:07:35,796 INFO L137 encePairwiseOnDemand]: 11/73 looper letters, 892 selfloop transitions, 1517 changer transitions 0/2409 dead transitions. [2022-12-06 06:07:35,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 2409 transitions, 100715 flow [2022-12-06 06:07:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 06:07:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 06:07:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 196 transitions. [2022-12-06 06:07:35,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12204234122042341 [2022-12-06 06:07:35,798 INFO L175 Difference]: Start difference. First operand has 640 places, 2029 transitions, 85043 flow. Second operand 22 states and 196 transitions. [2022-12-06 06:07:35,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 2409 transitions, 100715 flow [2022-12-06 06:07:59,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 2409 transitions, 98931 flow, removed 844 selfloop flow, removed 8 redundant places. [2022-12-06 06:07:59,224 INFO L231 Difference]: Finished difference. Result has 659 places, 2182 transitions, 95807 flow [2022-12-06 06:07:59,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=83481, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1382, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=95807, PETRI_PLACES=659, PETRI_TRANSITIONS=2182} [2022-12-06 06:07:59,226 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 641 predicate places. [2022-12-06 06:07:59,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:59,226 INFO L89 Accepts]: Start accepts. Operand has 659 places, 2182 transitions, 95807 flow [2022-12-06 06:07:59,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:59,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:59,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 659 places, 2182 transitions, 95807 flow [2022-12-06 06:07:59,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 659 places, 2182 transitions, 95807 flow [2022-12-06 06:08:01,962 INFO L130 PetriNetUnfolder]: 1723/4491 cut-off events. [2022-12-06 06:08:01,963 INFO L131 PetriNetUnfolder]: For 955285/955589 co-relation queries the response was YES. [2022-12-06 06:08:02,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97974 conditions, 4491 events. 1723/4491 cut-off events. For 955285/955589 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 46507 event pairs, 20 based on Foata normal form. 43/4530 useless extension candidates. Maximal degree in co-relation 97744. Up to 2293 conditions per place. [2022-12-06 06:08:02,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 659 places, 2182 transitions, 95807 flow [2022-12-06 06:08:02,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 6384 [2022-12-06 06:08:02,132 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:08:02,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2906 [2022-12-06 06:08:02,133 INFO L495 AbstractCegarLoop]: Abstraction has has 659 places, 2182 transitions, 95807 flow [2022-12-06 06:08:02,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:08:02,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:08:02,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:08:02,139 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 06:08:02,337 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 06:08:02,338 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 06:08:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:08:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1707960698, now seen corresponding path program 1 times [2022-12-06 06:08:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:08:02,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49924813] [2022-12-06 06:08:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:08:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:08:02,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:08:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49924813] [2022-12-06 06:08:02,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49924813] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:08:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526775641] [2022-12-06 06:08:02,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:02,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:08:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:08:02,445 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:08:02,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 06:08:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:02,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:08:02,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:08:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:08:02,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:08:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:08:02,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526775641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:08:02,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:08:02,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:08:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804272463] [2022-12-06 06:08:02,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:08:02,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:08:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:08:02,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:08:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:08:02,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 06:08:02,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 2182 transitions, 95807 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:08:02,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:08:02,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 06:08:02,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:08:17,909 INFO L130 PetriNetUnfolder]: 8589/14855 cut-off events. [2022-12-06 06:08:17,909 INFO L131 PetriNetUnfolder]: For 3252680/3252680 co-relation queries the response was YES. [2022-12-06 06:08:18,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262122 conditions, 14855 events. 8589/14855 cut-off events. For 3252680/3252680 co-relation queries the response was YES. Maximal size of possible extension queue 1523. Compared 123275 event pairs, 997 based on Foata normal form. 110/14955 useless extension candidates. Maximal degree in co-relation 261889. Up to 10339 conditions per place. [2022-12-06 06:08:18,230 INFO L137 encePairwiseOnDemand]: 11/73 looper letters, 1448 selfloop transitions, 1124 changer transitions 10/2582 dead transitions. [2022-12-06 06:08:18,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 2582 transitions, 111163 flow [2022-12-06 06:08:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 06:08:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 06:08:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 242 transitions. [2022-12-06 06:08:18,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09208523592085235 [2022-12-06 06:08:18,232 INFO L175 Difference]: Start difference. First operand has 659 places, 2182 transitions, 95807 flow. Second operand 36 states and 242 transitions. [2022-12-06 06:08:18,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 2582 transitions, 111163 flow [2022-12-06 06:08:49,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 2582 transitions, 110358 flow, removed 301 selfloop flow, removed 9 redundant places. [2022-12-06 06:08:49,456 INFO L231 Difference]: Finished difference. Result has 692 places, 2300 transitions, 105146 flow [2022-12-06 06:08:49,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=95042, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1082, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=105146, PETRI_PLACES=692, PETRI_TRANSITIONS=2300} [2022-12-06 06:08:49,458 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 674 predicate places. [2022-12-06 06:08:49,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:08:49,458 INFO L89 Accepts]: Start accepts. Operand has 692 places, 2300 transitions, 105146 flow [2022-12-06 06:08:49,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:08:49,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:08:49,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 692 places, 2300 transitions, 105146 flow [2022-12-06 06:08:49,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 692 places, 2300 transitions, 105146 flow [2022-12-06 06:08:53,407 INFO L130 PetriNetUnfolder]: 1791/4705 cut-off events. [2022-12-06 06:08:53,408 INFO L131 PetriNetUnfolder]: For 1003445/1003760 co-relation queries the response was YES. [2022-12-06 06:08:53,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104529 conditions, 4705 events. 1791/4705 cut-off events. For 1003445/1003760 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 49366 event pairs, 23 based on Foata normal form. 43/4744 useless extension candidates. Maximal degree in co-relation 104293. Up to 2422 conditions per place. [2022-12-06 06:08:53,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 692 places, 2300 transitions, 105146 flow [2022-12-06 06:08:53,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 6656 [2022-12-06 06:08:53,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:08:53,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4270 [2022-12-06 06:08:53,728 INFO L495 AbstractCegarLoop]: Abstraction has has 692 places, 2300 transitions, 105166 flow [2022-12-06 06:08:53,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:08:53,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:08:53,729 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:08:53,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-06 06:08:53,934 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 06:08:53,934 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:08:53,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:08:53,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1072120066, now seen corresponding path program 1 times [2022-12-06 06:08:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:08:53,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077762290] [2022-12-06 06:08:53,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:08:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:08:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:08:54,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077762290] [2022-12-06 06:08:54,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077762290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:08:54,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991181416] [2022-12-06 06:08:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:08:54,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:08:54,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:08:54,078 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:08:54,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 06:08:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:08:54,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:08:54,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:08:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:08:54,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:08:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:08:54,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991181416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:08:54,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:08:54,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:08:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910550595] [2022-12-06 06:08:54,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:08:54,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:08:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:08:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:08:54,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:08:54,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 06:08:54,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 2300 transitions, 105166 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:08:54,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:08:54,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 06:08:54,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:09:15,567 INFO L130 PetriNetUnfolder]: 8741/15161 cut-off events. [2022-12-06 06:09:15,567 INFO L131 PetriNetUnfolder]: For 3067096/3067096 co-relation queries the response was YES. [2022-12-06 06:09:15,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272562 conditions, 15161 events. 8741/15161 cut-off events. For 3067096/3067096 co-relation queries the response was YES. Maximal size of possible extension queue 1572. Compared 126853 event pairs, 1936 based on Foata normal form. 44/15195 useless extension candidates. Maximal degree in co-relation 272323. Up to 13374 conditions per place. [2022-12-06 06:09:15,898 INFO L137 encePairwiseOnDemand]: 22/74 looper letters, 2010 selfloop transitions, 501 changer transitions 4/2515 dead transitions. [2022-12-06 06:09:15,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 2515 transitions, 116473 flow [2022-12-06 06:09:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 06:09:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 06:09:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 214 transitions. [2022-12-06 06:09:15,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08763308763308764 [2022-12-06 06:09:15,900 INFO L175 Difference]: Start difference. First operand has 692 places, 2300 transitions, 105166 flow. Second operand 33 states and 214 transitions. [2022-12-06 06:09:15,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 2515 transitions, 116473 flow [2022-12-06 06:09:45,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 2515 transitions, 113726 flow, removed 1211 selfloop flow, removed 14 redundant places. [2022-12-06 06:09:45,841 INFO L231 Difference]: Finished difference. Result has 716 places, 2377 transitions, 108555 flow [2022-12-06 06:09:45,843 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=102567, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=434, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=108555, PETRI_PLACES=716, PETRI_TRANSITIONS=2377} [2022-12-06 06:09:45,843 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 698 predicate places. [2022-12-06 06:09:45,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:09:45,843 INFO L89 Accepts]: Start accepts. Operand has 716 places, 2377 transitions, 108555 flow [2022-12-06 06:09:45,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:09:45,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:09:45,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 716 places, 2377 transitions, 108555 flow [2022-12-06 06:09:45,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 716 places, 2377 transitions, 108555 flow [2022-12-06 06:09:48,675 INFO L130 PetriNetUnfolder]: 1828/4819 cut-off events. [2022-12-06 06:09:48,675 INFO L131 PetriNetUnfolder]: For 1085105/1085430 co-relation queries the response was YES. [2022-12-06 06:09:48,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107449 conditions, 4819 events. 1828/4819 cut-off events. For 1085105/1085430 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 50814 event pairs, 21 based on Foata normal form. 43/4858 useless extension candidates. Maximal degree in co-relation 107206. Up to 2437 conditions per place. [2022-12-06 06:09:48,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 716 places, 2377 transitions, 108555 flow [2022-12-06 06:09:48,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 6808 [2022-12-06 06:09:49,332 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:09:49,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3489 [2022-12-06 06:09:49,332 INFO L495 AbstractCegarLoop]: Abstraction has has 716 places, 2377 transitions, 108815 flow [2022-12-06 06:09:49,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:09:49,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:09:49,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:09:49,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-06 06:09:49,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:09:49,533 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:09:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:09:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1706747916, now seen corresponding path program 1 times [2022-12-06 06:09:49,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:09:49,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580306566] [2022-12-06 06:09:49,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:49,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:09:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:09:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:09:49,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580306566] [2022-12-06 06:09:49,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580306566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:09:49,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773147341] [2022-12-06 06:09:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:49,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:09:49,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:09:49,650 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:09:49,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 06:09:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:49,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:09:49,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:09:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:09:49,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:09:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:09:50,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773147341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:09:50,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:09:50,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:09:50,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302377264] [2022-12-06 06:09:50,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:09:50,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:09:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:09:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:09:50,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:09:50,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 06:09:50,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 2377 transitions, 108815 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:09:50,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:09:50,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 06:09:50,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:10:08,439 INFO L130 PetriNetUnfolder]: 9565/16595 cut-off events. [2022-12-06 06:10:08,440 INFO L131 PetriNetUnfolder]: For 3788955/3788955 co-relation queries the response was YES. [2022-12-06 06:10:08,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301351 conditions, 16595 events. 9565/16595 cut-off events. For 3788955/3788955 co-relation queries the response was YES. Maximal size of possible extension queue 1739. Compared 140636 event pairs, 640 based on Foata normal form. 68/16653 useless extension candidates. Maximal degree in co-relation 301105. Up to 8860 conditions per place. [2022-12-06 06:10:08,804 INFO L137 encePairwiseOnDemand]: 11/81 looper letters, 1220 selfloop transitions, 1696 changer transitions 6/2922 dead transitions. [2022-12-06 06:10:08,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 2922 transitions, 129451 flow [2022-12-06 06:10:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 06:10:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 06:10:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 271 transitions. [2022-12-06 06:10:08,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09042375709042376 [2022-12-06 06:10:08,806 INFO L175 Difference]: Start difference. First operand has 716 places, 2377 transitions, 108815 flow. Second operand 37 states and 271 transitions. [2022-12-06 06:10:08,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 2922 transitions, 129451 flow [2022-12-06 06:10:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 2922 transitions, 128649 flow, removed 309 selfloop flow, removed 14 redundant places. [2022-12-06 06:10:43,095 INFO L231 Difference]: Finished difference. Result has 749 places, 2577 transitions, 123279 flow [2022-12-06 06:10:43,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=108035, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1534, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=123279, PETRI_PLACES=749, PETRI_TRANSITIONS=2577} [2022-12-06 06:10:43,097 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 731 predicate places. [2022-12-06 06:10:43,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:10:43,098 INFO L89 Accepts]: Start accepts. Operand has 749 places, 2577 transitions, 123279 flow [2022-12-06 06:10:43,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:10:43,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:10:43,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 749 places, 2577 transitions, 123279 flow [2022-12-06 06:10:43,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 749 places, 2577 transitions, 123279 flow [2022-12-06 06:10:46,807 INFO L130 PetriNetUnfolder]: 1978/5225 cut-off events. [2022-12-06 06:10:46,808 INFO L131 PetriNetUnfolder]: For 1265730/1266057 co-relation queries the response was YES. [2022-12-06 06:10:46,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121574 conditions, 5225 events. 1978/5225 cut-off events. For 1265730/1266057 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 55961 event pairs, 21 based on Foata normal form. 43/5264 useless extension candidates. Maximal degree in co-relation 121320. Up to 2703 conditions per place. [2022-12-06 06:10:47,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 749 places, 2577 transitions, 123279 flow [2022-12-06 06:10:47,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 7390 [2022-12-06 06:10:47,084 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:10:47,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3987 [2022-12-06 06:10:47,084 INFO L495 AbstractCegarLoop]: Abstraction has has 749 places, 2577 transitions, 123315 flow [2022-12-06 06:10:47,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:10:47,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:10:47,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:10:47,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-06 06:10:47,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:10:47,290 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:10:47,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:10:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash -112522929, now seen corresponding path program 1 times [2022-12-06 06:10:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:10:47,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465916705] [2022-12-06 06:10:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:10:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:10:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:10:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:10:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:10:47,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465916705] [2022-12-06 06:10:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465916705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:10:47,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180426728] [2022-12-06 06:10:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:10:47,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:10:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:10:47,456 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:10:47,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 06:10:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:10:47,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:10:47,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:10:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:10:47,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:10:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:10:47,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180426728] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:10:47,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:10:47,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:10:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773115055] [2022-12-06 06:10:47,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:10:47,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:10:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:10:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:10:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:10:47,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 83 [2022-12-06 06:10:47,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 2577 transitions, 123315 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:10:47,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:10:47,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 83 [2022-12-06 06:10:47,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:11:08,323 INFO L130 PetriNetUnfolder]: 9655/16787 cut-off events. [2022-12-06 06:11:08,323 INFO L131 PetriNetUnfolder]: For 3705971/3705971 co-relation queries the response was YES. [2022-12-06 06:11:08,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313360 conditions, 16787 events. 9655/16787 cut-off events. For 3705971/3705971 co-relation queries the response was YES. Maximal size of possible extension queue 1763. Compared 143327 event pairs, 2298 based on Foata normal form. 32/16809 useless extension candidates. Maximal degree in co-relation 313103. Up to 14854 conditions per place. [2022-12-06 06:11:08,720 INFO L137 encePairwiseOnDemand]: 24/83 looper letters, 2218 selfloop transitions, 542 changer transitions 2/2762 dead transitions. [2022-12-06 06:11:08,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 2762 transitions, 134202 flow [2022-12-06 06:11:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:11:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:11:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2022-12-06 06:11:08,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09221501390176089 [2022-12-06 06:11:08,721 INFO L175 Difference]: Start difference. First operand has 749 places, 2577 transitions, 123315 flow. Second operand 26 states and 199 transitions. [2022-12-06 06:11:08,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 2762 transitions, 134202 flow [2022-12-06 06:12:01,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 762 places, 2762 transitions, 128547 flow, removed 2674 selfloop flow, removed 12 redundant places. [2022-12-06 06:12:01,344 INFO L231 Difference]: Finished difference. Result has 766 places, 2633 transitions, 122946 flow [2022-12-06 06:12:01,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=117746, PETRI_DIFFERENCE_MINUEND_PLACES=737, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=500, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=122946, PETRI_PLACES=766, PETRI_TRANSITIONS=2633} [2022-12-06 06:12:01,347 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 748 predicate places. [2022-12-06 06:12:01,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:12:01,347 INFO L89 Accepts]: Start accepts. Operand has 766 places, 2633 transitions, 122946 flow [2022-12-06 06:12:01,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:12:01,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:12:01,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 766 places, 2633 transitions, 122946 flow [2022-12-06 06:12:01,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 766 places, 2633 transitions, 122946 flow [2022-12-06 06:12:06,192 INFO L130 PetriNetUnfolder]: 2004/5303 cut-off events. [2022-12-06 06:12:06,192 INFO L131 PetriNetUnfolder]: For 1312520/1312846 co-relation queries the response was YES. [2022-12-06 06:12:06,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120885 conditions, 5303 events. 2004/5303 cut-off events. For 1312520/1312846 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 56923 event pairs, 22 based on Foata normal form. 44/5343 useless extension candidates. Maximal degree in co-relation 120628. Up to 2638 conditions per place. [2022-12-06 06:12:06,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 766 places, 2633 transitions, 122946 flow [2022-12-06 06:12:06,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 7496 [2022-12-06 06:12:06,555 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:12:06,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5208 [2022-12-06 06:12:06,555 INFO L495 AbstractCegarLoop]: Abstraction has has 766 places, 2633 transitions, 122986 flow [2022-12-06 06:12:06,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:12:06,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:12:06,556 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:12:06,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-06 06:12:06,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:12:06,756 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:12:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:12:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -513818870, now seen corresponding path program 1 times [2022-12-06 06:12:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:12:06,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745543231] [2022-12-06 06:12:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:12:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:12:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:12:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:12:06,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:12:06,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745543231] [2022-12-06 06:12:06,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745543231] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:12:06,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541576876] [2022-12-06 06:12:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:12:06,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:12:06,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:12:06,980 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:12:06,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 06:12:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:12:07,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:12:07,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:12:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:12:07,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:12:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:12:07,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541576876] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:12:07,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:12:07,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:12:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329863019] [2022-12-06 06:12:07,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:12:07,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:12:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:12:07,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:12:07,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:12:07,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-06 06:12:07,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 766 places, 2633 transitions, 122986 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:12:07,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:12:07,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-06 06:12:07,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:12:41,575 INFO L130 PetriNetUnfolder]: 9804/17075 cut-off events. [2022-12-06 06:12:41,575 INFO L131 PetriNetUnfolder]: For 4164051/4164051 co-relation queries the response was YES. [2022-12-06 06:12:41,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313318 conditions, 17075 events. 9804/17075 cut-off events. For 4164051/4164051 co-relation queries the response was YES. Maximal size of possible extension queue 1792. Compared 146641 event pairs, 2182 based on Foata normal form. 76/17141 useless extension candidates. Maximal degree in co-relation 313058. Up to 14743 conditions per place. [2022-12-06 06:12:42,009 INFO L137 encePairwiseOnDemand]: 18/85 looper letters, 2225 selfloop transitions, 620 changer transitions 17/2862 dead transitions. [2022-12-06 06:12:42,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 2862 transitions, 134684 flow [2022-12-06 06:12:42,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 06:12:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 06:12:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 227 transitions. [2022-12-06 06:12:42,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08092691622103387 [2022-12-06 06:12:42,011 INFO L175 Difference]: Start difference. First operand has 766 places, 2633 transitions, 122986 flow. Second operand 33 states and 227 transitions. [2022-12-06 06:12:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 798 places, 2862 transitions, 134684 flow [2022-12-06 06:13:29,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 2862 transitions, 133948 flow, removed 261 selfloop flow, removed 11 redundant places. [2022-12-06 06:13:30,104 INFO L231 Difference]: Finished difference. Result has 792 places, 2692 transitions, 127873 flow [2022-12-06 06:13:30,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=122250, PETRI_DIFFERENCE_MINUEND_PLACES=755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=569, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=127873, PETRI_PLACES=792, PETRI_TRANSITIONS=2692} [2022-12-06 06:13:30,107 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 774 predicate places. [2022-12-06 06:13:30,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:13:30,107 INFO L89 Accepts]: Start accepts. Operand has 792 places, 2692 transitions, 127873 flow [2022-12-06 06:13:30,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:13:30,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:13:30,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 792 places, 2692 transitions, 127873 flow [2022-12-06 06:13:30,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 792 places, 2692 transitions, 127873 flow [2022-12-06 06:13:35,328 INFO L130 PetriNetUnfolder]: 2036/5423 cut-off events. [2022-12-06 06:13:35,328 INFO L131 PetriNetUnfolder]: For 1389943/1390237 co-relation queries the response was YES. [2022-12-06 06:13:35,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125151 conditions, 5423 events. 2036/5423 cut-off events. For 1389943/1390237 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 58743 event pairs, 22 based on Foata normal form. 44/5463 useless extension candidates. Maximal degree in co-relation 124889. Up to 2695 conditions per place. [2022-12-06 06:13:35,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 792 places, 2692 transitions, 127873 flow [2022-12-06 06:13:35,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 7644 [2022-12-06 06:13:35,816 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:13:35,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5710 [2022-12-06 06:13:35,817 INFO L495 AbstractCegarLoop]: Abstraction has has 792 places, 2692 transitions, 127928 flow [2022-12-06 06:13:35,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:13:35,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:13:35,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:13:35,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-06 06:13:36,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-06 06:13:36,024 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:13:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:13:36,024 INFO L85 PathProgramCache]: Analyzing trace with hash -111945368, now seen corresponding path program 1 times [2022-12-06 06:13:36,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:13:36,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841124240] [2022-12-06 06:13:36,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:13:36,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:13:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:13:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:13:36,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:13:36,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841124240] [2022-12-06 06:13:36,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841124240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:13:36,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:13:36,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:13:36,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895141516] [2022-12-06 06:13:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:13:36,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:13:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:13:36,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:13:36,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:13:36,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 87 [2022-12-06 06:13:36,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 2692 transitions, 127928 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:13:36,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:13:36,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 87 [2022-12-06 06:13:36,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:13:59,385 INFO L130 PetriNetUnfolder]: 9780/17035 cut-off events. [2022-12-06 06:13:59,386 INFO L131 PetriNetUnfolder]: For 3796156/3796156 co-relation queries the response was YES. [2022-12-06 06:13:59,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315766 conditions, 17035 events. 9780/17035 cut-off events. For 3796156/3796156 co-relation queries the response was YES. Maximal size of possible extension queue 1779. Compared 147166 event pairs, 3193 based on Foata normal form. 2/17027 useless extension candidates. Maximal degree in co-relation 315501. Up to 16762 conditions per place. [2022-12-06 06:13:59,778 INFO L137 encePairwiseOnDemand]: 66/87 looper letters, 2648 selfloop transitions, 51 changer transitions 0/2699 dead transitions. [2022-12-06 06:13:59,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 2699 transitions, 133066 flow [2022-12-06 06:13:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:13:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:13:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-12-06 06:13:59,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36398467432950193 [2022-12-06 06:13:59,779 INFO L175 Difference]: Start difference. First operand has 792 places, 2692 transitions, 127928 flow. Second operand 3 states and 95 transitions. [2022-12-06 06:13:59,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 2699 transitions, 133066 flow [2022-12-06 06:15:03,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 2699 transitions, 132052 flow, removed 419 selfloop flow, removed 14 redundant places. [2022-12-06 06:15:03,765 INFO L231 Difference]: Finished difference. Result has 780 places, 2684 transitions, 126559 flow [2022-12-06 06:15:03,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=126457, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126559, PETRI_PLACES=780, PETRI_TRANSITIONS=2684} [2022-12-06 06:15:03,768 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 762 predicate places. [2022-12-06 06:15:03,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:03,769 INFO L89 Accepts]: Start accepts. Operand has 780 places, 2684 transitions, 126559 flow [2022-12-06 06:15:03,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:03,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:03,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 780 places, 2684 transitions, 126559 flow [2022-12-06 06:15:03,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 780 places, 2684 transitions, 126559 flow Received shutdown request... [2022-12-06 06:15:04,798 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:15:04,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 06:15:04,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 06:15:04,812 WARN L619 AbstractCegarLoop]: Verification canceled: while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 780 places, 2684 transitions, 126559 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 780 places, 2684 transitions, 126559 flow,while PetriNetUnfolder was constructing finite prefix that currently has 14460 conditions, 701 events (80/700 cut-off events. For 73946/74075 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 10168 event pairs, 0 based on Foata normal form. 5/1271 useless extension candidates. Maximal degree in co-relation 14215. Up to 205 conditions per place.). [2022-12-06 06:15:04,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 06:15:04,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 06:15:04,814 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:04,817 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:15:04,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:15:04,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:15:04 BasicIcfg [2022-12-06 06:15:04,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:15:04,831 INFO L158 Benchmark]: Toolchain (without parser) took 831011.57ms. Allocated memory was 183.5MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 158.5MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 06:15:04,831 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 159.5MB in the beginning and 159.4MB in the end (delta: 64.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:15:04,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.96ms. Allocated memory is still 183.5MB. Free memory was 158.5MB in the beginning and 137.8MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 06:15:04,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.13ms. Allocated memory is still 183.5MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:15:04,833 INFO L158 Benchmark]: Boogie Preprocessor took 40.69ms. Allocated memory is still 183.5MB. Free memory was 135.7MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:15:04,834 INFO L158 Benchmark]: RCFGBuilder took 638.52ms. Allocated memory is still 183.5MB. Free memory was 133.6MB in the beginning and 120.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 06:15:04,834 INFO L158 Benchmark]: TraceAbstraction took 829520.88ms. Allocated memory was 183.5MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 119.5MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 06:15:04,836 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 159.5MB in the beginning and 159.4MB in the end (delta: 64.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 702.96ms. Allocated memory is still 183.5MB. Free memory was 158.5MB in the beginning and 137.8MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.13ms. Allocated memory is still 183.5MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.69ms. Allocated memory is still 183.5MB. Free memory was 135.7MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 638.52ms. Allocated memory is still 183.5MB. Free memory was 133.6MB in the beginning and 120.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 829520.88ms. Allocated memory was 183.5MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 119.5MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 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: 52, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 52, dependent conditional: 0, dependent unconditional: 52, 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, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 150, Positive conditional cache size: 150, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 240, Positive conditional cache size: 240, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 20 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 258, Positive conditional cache size: 258, 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, 28 PlacesBefore, 27 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 290, Positive conditional cache size: 290, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 45 PlacesBefore, 45 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 483, Positive conditional cache size: 483, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 485, Positive conditional cache size: 485, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 51 PlacesBefore, 51 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 489, Positive conditional cache size: 489, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 489, Positive conditional cache size: 489, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 80 PlacesBefore, 80 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 593, Positive conditional cache size: 593, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 99 PlacesBefore, 99 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 15, independent: 7, independent conditional: 7, 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): 657, Positive cache size: 657, Positive conditional cache size: 657, 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, 107 PlacesBefore, 107 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 717, Positive cache size: 717, Positive conditional cache size: 717, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 118 PlacesBefore, 118 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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): 900, Positive cache size: 900, Positive conditional cache size: 900, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 900, Positive conditional cache size: 900, 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, 144 PlacesBefore, 144 PlacesAfterwards, 291 TransitionsBefore, 291 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 963, Positive cache size: 963, Positive conditional cache size: 963, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 165 PlacesBefore, 165 PlacesAfterwards, 365 TransitionsBefore, 365 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 963, Positive cache size: 963, Positive conditional cache size: 963, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 179 PlacesBefore, 179 PlacesAfterwards, 387 TransitionsBefore, 387 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1091, Positive cache size: 1091, Positive conditional cache size: 1091, 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, 180 PlacesBefore, 180 PlacesAfterwards, 393 TransitionsBefore, 393 TransitionsAfterwards, 1148 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): 1091, Positive cache size: 1091, Positive conditional cache size: 1091, 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, 209 PlacesBefore, 209 PlacesAfterwards, 465 TransitionsBefore, 465 TransitionsAfterwards, 1344 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1162, Positive cache size: 1162, Positive conditional cache size: 1162, 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, 223 PlacesBefore, 223 PlacesAfterwards, 517 TransitionsBefore, 517 TransitionsAfterwards, 1532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1237, Positive cache size: 1237, Positive conditional cache size: 1237, 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, 253 PlacesBefore, 253 PlacesAfterwards, 607 TransitionsBefore, 607 TransitionsAfterwards, 1770 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: 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: 3, independent: 2, independent conditional: 2, 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): 1421, Positive cache size: 1421, Positive conditional cache size: 1421, 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, 244 PlacesBefore, 244 PlacesAfterwards, 603 TransitionsBefore, 603 TransitionsAfterwards, 1806 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): 1421, Positive cache size: 1421, Positive conditional cache size: 1421, 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, 247 PlacesBefore, 247 PlacesAfterwards, 603 TransitionsBefore, 603 TransitionsAfterwards, 1778 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): 1421, Positive cache size: 1421, Positive conditional cache size: 1421, 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, 252 PlacesBefore, 252 PlacesAfterwards, 599 TransitionsBefore, 599 TransitionsAfterwards, 1786 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): 1421, Positive cache size: 1421, Positive conditional cache size: 1421, 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, 291 PlacesBefore, 291 PlacesAfterwards, 717 TransitionsBefore, 717 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 1598, Positive cache size: 1598, Positive conditional cache size: 1598, 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, 311 PlacesBefore, 311 PlacesAfterwards, 864 TransitionsBefore, 864 TransitionsAfterwards, 2748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1830, Positive cache size: 1830, Positive conditional cache size: 1830, 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, 324 PlacesBefore, 324 PlacesAfterwards, 930 TransitionsBefore, 930 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1831, Positive cache size: 1831, Positive conditional cache size: 1831, 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, 344 PlacesBefore, 344 PlacesAfterwards, 968 TransitionsBefore, 968 TransitionsAfterwards, 2942 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): 1831, Positive cache size: 1831, Positive conditional cache size: 1831, 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, 339 PlacesBefore, 339 PlacesAfterwards, 954 TransitionsBefore, 954 TransitionsAfterwards, 2874 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): 1831, Positive cache size: 1831, Positive conditional cache size: 1831, 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, 364 PlacesBefore, 364 PlacesAfterwards, 992 TransitionsBefore, 992 TransitionsAfterwards, 2932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 2126, Positive cache size: 2126, Positive conditional cache size: 2126, 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, 362 PlacesBefore, 362 PlacesAfterwards, 988 TransitionsBefore, 988 TransitionsAfterwards, 2948 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): 2126, Positive cache size: 2126, Positive conditional cache size: 2126, 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, 386 PlacesBefore, 386 PlacesAfterwards, 1015 TransitionsBefore, 1015 TransitionsAfterwards, 2996 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2201, Positive cache size: 2201, Positive conditional cache size: 2201, 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, 404 PlacesBefore, 404 PlacesAfterwards, 1043 TransitionsBefore, 1043 TransitionsAfterwards, 3054 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2471, Positive cache size: 2471, Positive conditional cache size: 2471, 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, 397 PlacesBefore, 397 PlacesAfterwards, 1039 TransitionsBefore, 1039 TransitionsAfterwards, 3050 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): 2471, Positive cache size: 2471, Positive conditional cache size: 2471, 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, 432 PlacesBefore, 432 PlacesAfterwards, 1115 TransitionsBefore, 1115 TransitionsAfterwards, 3252 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): 2471, Positive cache size: 2471, Positive conditional cache size: 2471, 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, 430 PlacesBefore, 430 PlacesAfterwards, 1137 TransitionsBefore, 1137 TransitionsAfterwards, 3522 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): 2471, Positive cache size: 2471, Positive conditional cache size: 2471, 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, 466 PlacesBefore, 466 PlacesAfterwards, 1198 TransitionsBefore, 1198 TransitionsAfterwards, 3650 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2611, Positive cache size: 2611, Positive conditional cache size: 2611, 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, 458 PlacesBefore, 458 PlacesAfterwards, 1183 TransitionsBefore, 1183 TransitionsAfterwards, 3606 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): 2611, Positive cache size: 2611, Positive conditional cache size: 2611, 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: 1.1s, 494 PlacesBefore, 494 PlacesAfterwards, 1302 TransitionsBefore, 1302 TransitionsAfterwards, 3900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 96, 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: 96, independent: 91, independent conditional: 91, 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): 2992, Positive cache size: 2992, Positive conditional cache size: 2992, 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, 483 PlacesBefore, 483 PlacesAfterwards, 1346 TransitionsBefore, 1346 TransitionsAfterwards, 4180 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): 2992, Positive cache size: 2992, Positive conditional cache size: 2992, 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, 533 PlacesBefore, 533 PlacesAfterwards, 1578 TransitionsBefore, 1578 TransitionsAfterwards, 4710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 12, independent: 6, independent conditional: 6, 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): 3187, Positive cache size: 3187, Positive conditional cache size: 3187, 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, 563 PlacesBefore, 563 PlacesAfterwards, 1755 TransitionsBefore, 1755 TransitionsAfterwards, 5170 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): 3187, Positive cache size: 3187, Positive conditional cache size: 3187, 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, 579 PlacesBefore, 579 PlacesAfterwards, 1771 TransitionsBefore, 1771 TransitionsAfterwards, 5202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3347, Positive cache size: 3347, Positive conditional cache size: 3347, 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, 617 PlacesBefore, 617 PlacesAfterwards, 1939 TransitionsBefore, 1939 TransitionsAfterwards, 5682 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 3422, Positive cache size: 3422, Positive conditional cache size: 3422, 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, 640 PlacesBefore, 640 PlacesAfterwards, 2029 TransitionsBefore, 2029 TransitionsAfterwards, 5890 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): 3422, Positive cache size: 3422, Positive conditional cache size: 3422, 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, 659 PlacesBefore, 659 PlacesAfterwards, 2182 TransitionsBefore, 2182 TransitionsAfterwards, 6384 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): 3422, Positive cache size: 3422, Positive conditional cache size: 3422, 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, 692 PlacesBefore, 692 PlacesAfterwards, 2300 TransitionsBefore, 2300 TransitionsAfterwards, 6656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3492, Positive cache size: 3492, Positive conditional cache size: 3492, 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, 716 PlacesBefore, 716 PlacesAfterwards, 2377 TransitionsBefore, 2377 TransitionsAfterwards, 6808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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): 3938, Positive cache size: 3938, Positive conditional cache size: 3938, 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, 749 PlacesBefore, 749 PlacesAfterwards, 2577 TransitionsBefore, 2577 TransitionsAfterwards, 7390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4088, Positive cache size: 4088, Positive conditional cache size: 4088, 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, 766 PlacesBefore, 766 PlacesAfterwards, 2633 TransitionsBefore, 2633 TransitionsAfterwards, 7496 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4165, Positive cache size: 4165, Positive conditional cache size: 4165, 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, 792 PlacesBefore, 792 PlacesAfterwards, 2692 TransitionsBefore, 2692 TransitionsAfterwards, 7644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4315, Positive cache size: 4315, Positive conditional cache size: 4315, 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 PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 780 places, 2684 transitions, 126559 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 780 places, 2684 transitions, 126559 flow,while PetriNetUnfolder was constructing finite prefix that currently has 14460 conditions, 701 events (80/700 cut-off events. For 73946/74075 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 10168 event pairs, 0 based on Foata normal form. 5/1271 useless extension candidates. Maximal degree in co-relation 14215. Up to 205 conditions per place.). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 780 places, 2684 transitions, 126559 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 780 places, 2684 transitions, 126559 flow,while PetriNetUnfolder was constructing finite prefix that currently has 14460 conditions, 701 events (80/700 cut-off events. For 73946/74075 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 10168 event pairs, 0 based on Foata normal form. 5/1271 useless extension candidates. Maximal degree in co-relation 14215. Up to 205 conditions per place.). - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 780 places, 2684 transitions, 126559 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 780 places, 2684 transitions, 126559 flow,while PetriNetUnfolder was constructing finite prefix that currently has 14460 conditions, 701 events (80/700 cut-off events. For 73946/74075 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 10168 event pairs, 0 based on Foata normal form. 5/1271 useless extension candidates. Maximal degree in co-relation 14215. Up to 205 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 829.3s, OverallIterations: 55, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 731.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6246 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6246 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 15.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22100 IncrementalHoareTripleChecker+Invalid, 29485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7385 mSolverCounterUnsat, 0 mSDtfsCounter, 22100 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1730 GetRequests, 562 SyntacticMatches, 2 SemanticMatches, 1166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8015 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127928occurred in iteration=54, InterpolantAutomatonStates: 911, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 1473 ConstructedInterpolants, 0 QuantifiedInterpolants, 20875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7606 ConjunctsInSsa, 607 ConjunctsInUnsatCore, 146 InterpolantComputations, 13 PerfectInterpolantSequences, 101/476 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