/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:26:39,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:26:39,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:26:39,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:26:39,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:26:39,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:26:39,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:26:39,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:26:39,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:26:39,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:26:39,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:26:39,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:26:39,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:26:39,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:26:39,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:26:39,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:26:39,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:26:39,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:26:39,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:26:39,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:26:39,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:26:39,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:26:39,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:26:39,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:26:39,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:26:39,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:26:39,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:26:39,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:26:39,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:26:39,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:26:39,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:26:39,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:26:39,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:26:39,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:26:39,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:26:39,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:26:39,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:26:39,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:26:39,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:26:39,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:26:39,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:26:39,732 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-RepeatedSemanticLbe.epf [2022-12-13 04:26:39,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:26:39,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:26:39,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:26:39,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:26:39,754 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:26:39,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:26:39,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:26:39,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:26:39,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:26:39,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:26:39,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:26:39,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:26:39,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:26:39,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:26:39,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:26:39,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:26:39,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:26:39,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:26:39,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:26:39,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:26:39,757 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:26:40,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:26:40,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:26:40,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:26:40,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:26:40,053 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:26:40,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-13 04:26:41,081 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:26:41,298 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:26:41,300 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-13 04:26:41,329 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67949d5f/5635b84f7e7b41dcb42a92a4f5b25fb1/FLAG9264d74f9 [2022-12-13 04:26:41,340 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67949d5f/5635b84f7e7b41dcb42a92a4f5b25fb1 [2022-12-13 04:26:41,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:26:41,342 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:26:41,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:26:41,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:26:41,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:26:41,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc4e764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41, skipping insertion in model container [2022-12-13 04:26:41,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:26:41,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:26:41,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,554 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-13 04:26:41,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:26:41,573 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:26:41,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:26:41,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:26:41,612 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-13 04:26:41,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:26:41,628 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:26:41,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41 WrapperNode [2022-12-13 04:26:41,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:26:41,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:26:41,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:26:41,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:26:41,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,673 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-12-13 04:26:41,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:26:41,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:26:41,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:26:41,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:26:41,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,714 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:26:41,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:26:41,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:26:41,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:26:41,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (1/1) ... [2022-12-13 04:26:41,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:26:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:26:41,751 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-13 04:26:41,753 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-13 04:26:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:26:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:26:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:26:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:26:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:26:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:26:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:26:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:26:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:26:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:26:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 04:26:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 04:26:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:26:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:26:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:26:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:26:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:26:41,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:26:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:26:41,788 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:26:41,920 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:26:41,921 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:26:42,342 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:26:42,461 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:26:42,461 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 04:26:42,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:26:42 BoogieIcfgContainer [2022-12-13 04:26:42,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:26:42,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:26:42,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:26:42,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:26:42,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:26:41" (1/3) ... [2022-12-13 04:26:42,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046d7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:26:42, skipping insertion in model container [2022-12-13 04:26:42,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:26:41" (2/3) ... [2022-12-13 04:26:42,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046d7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:26:42, skipping insertion in model container [2022-12-13 04:26:42,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:26:42" (3/3) ... [2022-12-13 04:26:42,471 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-12-13 04:26:42,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:26:42,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:26:42,486 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:26:42,561 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 04:26:42,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 226 transitions, 484 flow [2022-12-13 04:26:42,707 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-13 04:26:42,707 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 04:26:42,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 222 events. 19/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-13 04:26:42,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 226 transitions, 484 flow [2022-12-13 04:26:42,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 210 transitions, 444 flow [2022-12-13 04:26:42,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:42,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-13 04:26:42,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 210 transitions, 444 flow [2022-12-13 04:26:42,853 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-12-13 04:26:42,853 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 04:26:42,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 210 events. 19/210 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-13 04:26:42,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-13 04:26:42,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-13 04:26:51,613 INFO L241 LiptonReduction]: Total number of compositions: 175 [2022-12-13 04:26:51,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:26:51,633 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;@1514a104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:26:51,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 04:26:51,638 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-13 04:26:51,639 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 04:26:51,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:51,639 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:26:51,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:26:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1402613233, now seen corresponding path program 1 times [2022-12-13 04:26:51,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:51,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093279627] [2022-12-13 04:26:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:52,319 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-13 04:26:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093279627] [2022-12-13 04:26:52,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093279627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:52,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:52,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:26:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287390164] [2022-12-13 04:26:52,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:52,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:26:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:26:52,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:26:52,353 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-13 04:26:52,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:52,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:52,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-13 04:26:52,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:52,795 INFO L130 PetriNetUnfolder]: 2592/3424 cut-off events. [2022-12-13 04:26:52,795 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-13 04:26:52,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3424 events. 2592/3424 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14384 event pairs, 355 based on Foata normal form. 0/2355 useless extension candidates. Maximal degree in co-relation 5848. Up to 1372 conditions per place. [2022-12-13 04:26:52,810 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 66 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2022-12-13 04:26:52,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 387 flow [2022-12-13 04:26:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:26:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:26:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-13 04:26:52,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2022-12-13 04:26:52,821 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-13 04:26:52,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 84 transitions, 387 flow [2022-12-13 04:26:52,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 75 transitions, 339 flow [2022-12-13 04:26:52,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:52,844 INFO L89 Accepts]: Start accepts. Operand has 47 places, 75 transitions, 339 flow [2022-12-13 04:26:52,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:52,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:52,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 75 transitions, 339 flow [2022-12-13 04:26:52,851 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 75 transitions, 339 flow [2022-12-13 04:26:52,851 INFO L226 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-13 04:26:52,871 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:52,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 04:26:52,872 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 75 transitions, 339 flow [2022-12-13 04:26:52,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:52,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:52,873 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:26:52,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:26:52,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:26:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1996718852, now seen corresponding path program 1 times [2022-12-13 04:26:52,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:52,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126614039] [2022-12-13 04:26:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126614039] [2022-12-13 04:26:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126614039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:52,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:26:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191949235] [2022-12-13 04:26:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:52,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:26:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:26:52,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:26:52,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 04:26:52,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 75 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:52,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:52,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 04:26:52,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:53,431 INFO L130 PetriNetUnfolder]: 3185/4324 cut-off events. [2022-12-13 04:26:53,432 INFO L131 PetriNetUnfolder]: For 761/823 co-relation queries the response was YES. [2022-12-13 04:26:53,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12386 conditions, 4324 events. 3185/4324 cut-off events. For 761/823 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 19781 event pairs, 569 based on Foata normal form. 192/3250 useless extension candidates. Maximal degree in co-relation 7137. Up to 2567 conditions per place. [2022-12-13 04:26:53,452 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 64 selfloop transitions, 2 changer transitions 45/121 dead transitions. [2022-12-13 04:26:53,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 121 transitions, 775 flow [2022-12-13 04:26:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:26:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:26:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 04:26:53,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-13 04:26:53,455 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-13 04:26:53,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 121 transitions, 775 flow [2022-12-13 04:26:53,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 76 transitions, 475 flow [2022-12-13 04:26:53,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:53,493 INFO L89 Accepts]: Start accepts. Operand has 49 places, 76 transitions, 475 flow [2022-12-13 04:26:53,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:53,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:53,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 76 transitions, 475 flow [2022-12-13 04:26:53,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 76 transitions, 475 flow [2022-12-13 04:26:53,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-13 04:26:55,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:26:55,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1825 [2022-12-13 04:26:55,318 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 75 transitions, 469 flow [2022-12-13 04:26:55,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:55,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:55,318 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:26:55,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:26:55,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:26:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1258964321, now seen corresponding path program 1 times [2022-12-13 04:26:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:55,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560030620] [2022-12-13 04:26:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:26:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:55,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560030620] [2022-12-13 04:26:55,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560030620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:26:55,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:26:55,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:26:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135309721] [2022-12-13 04:26:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:26:55,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:26:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:55,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:26:55,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:26:55,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 04:26:55,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 75 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:55,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:55,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 04:26:55,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:26:56,196 INFO L130 PetriNetUnfolder]: 4835/6430 cut-off events. [2022-12-13 04:26:56,196 INFO L131 PetriNetUnfolder]: For 1384/1384 co-relation queries the response was YES. [2022-12-13 04:26:56,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23156 conditions, 6430 events. 4835/6430 cut-off events. For 1384/1384 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 26111 event pairs, 278 based on Foata normal form. 72/5044 useless extension candidates. Maximal degree in co-relation 20140. Up to 4417 conditions per place. [2022-12-13 04:26:56,238 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 150 selfloop transitions, 17 changer transitions 2/169 dead transitions. [2022-12-13 04:26:56,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 169 transitions, 1364 flow [2022-12-13 04:26:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:26:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:26:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-13 04:26:56,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-13 04:26:56,244 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-13 04:26:56,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 169 transitions, 1364 flow [2022-12-13 04:26:56,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 167 transitions, 1348 flow [2022-12-13 04:26:56,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:26:56,304 INFO L89 Accepts]: Start accepts. Operand has 54 places, 167 transitions, 1348 flow [2022-12-13 04:26:56,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:26:56,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:26:56,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 167 transitions, 1348 flow [2022-12-13 04:26:56,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 167 transitions, 1348 flow [2022-12-13 04:26:56,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:26:56,316 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:26:56,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 04:26:56,319 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 167 transitions, 1348 flow [2022-12-13 04:26:56,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:56,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:26:56,319 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:26:56,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:26:56,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:26:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:26:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1021846978, now seen corresponding path program 1 times [2022-12-13 04:26:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:26:56,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314611649] [2022-12-13 04:26:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:26:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:57,070 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-13 04:26:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:26:57,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314611649] [2022-12-13 04:26:57,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314611649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:26:57,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704285264] [2022-12-13 04:26:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:26:57,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:26:57,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:26:57,103 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-13 04:26:57,120 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-13 04:26:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:26:57,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 04:26:57,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:26:57,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 04:26:57,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:26:57,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:26:57,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:26:57,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:26:57,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 04:26:57,805 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-13 04:26:57,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:26:58,412 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-13 04:26:58,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704285264] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:26:58,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:26:58,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 25 [2022-12-13 04:26:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425355990] [2022-12-13 04:26:58,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:26:58,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 04:26:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:26:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 04:26:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=563, Unknown=9, NotChecked=0, Total=702 [2022-12-13 04:26:58,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-13 04:26:58,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 167 transitions, 1348 flow. Second operand has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:26:58,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:26:58,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-13 04:26:58,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:01,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:27:04,991 INFO L130 PetriNetUnfolder]: 16940/22611 cut-off events. [2022-12-13 04:27:04,991 INFO L131 PetriNetUnfolder]: For 10391/10391 co-relation queries the response was YES. [2022-12-13 04:27:05,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101034 conditions, 22611 events. 16940/22611 cut-off events. For 10391/10391 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 109960 event pairs, 1067 based on Foata normal form. 68/17624 useless extension candidates. Maximal degree in co-relation 42175. Up to 15910 conditions per place. [2022-12-13 04:27:05,138 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 733 selfloop transitions, 147 changer transitions 26/920 dead transitions. [2022-12-13 04:27:05,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 920 transitions, 9523 flow [2022-12-13 04:27:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 04:27:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 04:27:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 432 transitions. [2022-12-13 04:27:05,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44081632653061226 [2022-12-13 04:27:05,142 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2022-12-13 04:27:05,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 920 transitions, 9523 flow [2022-12-13 04:27:05,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 894 transitions, 9251 flow [2022-12-13 04:27:05,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:05,339 INFO L89 Accepts]: Start accepts. Operand has 81 places, 894 transitions, 9251 flow [2022-12-13 04:27:05,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:05,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:05,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 894 transitions, 9251 flow [2022-12-13 04:27:05,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 894 transitions, 9251 flow [2022-12-13 04:27:05,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:23,757 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 04:27:23,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18419 [2022-12-13 04:27:23,757 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 890 transitions, 9211 flow [2022-12-13 04:27:23,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:23,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:23,758 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:27:23,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 04:27:23,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:27:23,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:27:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1234036686, now seen corresponding path program 1 times [2022-12-13 04:27:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:23,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508650829] [2022-12-13 04:27:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:25,405 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-13 04:27:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:25,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508650829] [2022-12-13 04:27:25,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508650829] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:27:25,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545680117] [2022-12-13 04:27:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:25,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:27:25,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:27:25,420 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-13 04:27:25,451 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-13 04:27:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:25,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 04:27:25,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:27:25,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:27:25,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 04:27:25,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:27:25,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 04:27:25,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-13 04:27:26,078 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-13 04:27:26,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:27:26,443 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 04:27:26,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2022-12-13 04:27:26,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2022-12-13 04:27:26,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-13 04:27:26,614 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-13 04:27:26,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545680117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:27:26,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:27:26,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2022-12-13 04:27:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514108240] [2022-12-13 04:27:26,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:27:26,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 04:27:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:26,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 04:27:26,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=328, Unknown=2, NotChecked=0, Total=420 [2022-12-13 04:27:26,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 04:27:26,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 890 transitions, 9211 flow. Second operand has 21 states, 21 states have (on average 6.333333333333333) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:26,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:26,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 04:27:26,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:27:38,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:27:43,284 INFO L130 PetriNetUnfolder]: 45647/61013 cut-off events. [2022-12-13 04:27:43,284 INFO L131 PetriNetUnfolder]: For 30850/30850 co-relation queries the response was YES. [2022-12-13 04:27:43,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326739 conditions, 61013 events. 45647/61013 cut-off events. For 30850/30850 co-relation queries the response was YES. Maximal size of possible extension queue 1780. Compared 345151 event pairs, 2637 based on Foata normal form. 49/47363 useless extension candidates. Maximal degree in co-relation 134271. Up to 44968 conditions per place. [2022-12-13 04:27:43,914 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 2376 selfloop transitions, 502 changer transitions 28/2920 dead transitions. [2022-12-13 04:27:43,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 2920 transitions, 36624 flow [2022-12-13 04:27:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 04:27:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 04:27:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 728 transitions. [2022-12-13 04:27:43,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2022-12-13 04:27:43,919 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2022-12-13 04:27:43,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 2920 transitions, 36624 flow [2022-12-13 04:27:44,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 2892 transitions, 36237 flow [2022-12-13 04:27:44,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:27:44,612 INFO L89 Accepts]: Start accepts. Operand has 115 places, 2892 transitions, 36237 flow [2022-12-13 04:27:44,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:27:44,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:27:44,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 2892 transitions, 36237 flow [2022-12-13 04:27:44,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 2892 transitions, 36237 flow [2022-12-13 04:27:44,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:27:44,735 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:27:44,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 04:27:44,736 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 2892 transitions, 36237 flow [2022-12-13 04:27:44,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.333333333333333) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:44,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:27:44,736 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:27:44,756 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-13 04:27:44,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:27:44,942 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:27:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:27:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 318124004, now seen corresponding path program 2 times [2022-12-13 04:27:44,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:27:44,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690631879] [2022-12-13 04:27:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:27:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:27:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:27:46,111 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-13 04:27:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:27:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690631879] [2022-12-13 04:27:46,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690631879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:27:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74850214] [2022-12-13 04:27:46,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:27:46,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:27:46,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:27:46,113 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-13 04:27:46,137 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-13 04:27:46,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:27:46,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:27:46,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 04:27:46,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:27:46,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:27:46,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:27:46,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 04:27:46,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:27:46,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 04:27:46,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 04:27:46,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:27:46,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 04:27:46,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-13 04:27:46,638 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-13 04:27:46,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:27:46,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:27:46,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1362 treesize of output 1302 [2022-12-13 04:27:46,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 643 treesize of output 595 [2022-12-13 04:27:46,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1238 treesize of output 1142 [2022-12-13 04:27:46,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1142 treesize of output 950 [2022-12-13 04:27:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:27:49,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74850214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:27:49,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:27:49,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-12-13 04:27:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202585303] [2022-12-13 04:27:49,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:27:49,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 04:27:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:27:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 04:27:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2022-12-13 04:27:49,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2022-12-13 04:27:49,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 2892 transitions, 36237 flow. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:27:49,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:27:49,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2022-12-13 04:27:49,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:16,458 INFO L130 PetriNetUnfolder]: 74508/99978 cut-off events. [2022-12-13 04:28:16,458 INFO L131 PetriNetUnfolder]: For 69179/69179 co-relation queries the response was YES. [2022-12-13 04:28:16,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620943 conditions, 99978 events. 74508/99978 cut-off events. For 69179/69179 co-relation queries the response was YES. Maximal size of possible extension queue 2996. Compared 609465 event pairs, 4973 based on Foata normal form. 13/77064 useless extension candidates. Maximal degree in co-relation 261452. Up to 74759 conditions per place. [2022-12-13 04:28:17,299 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 4220 selfloop transitions, 619 changer transitions 20/4910 dead transitions. [2022-12-13 04:28:17,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 4910 transitions, 71521 flow [2022-12-13 04:28:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:28:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:28:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 325 transitions. [2022-12-13 04:28:17,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 04:28:17,303 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 88 predicate places. [2022-12-13 04:28:17,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 4910 transitions, 71521 flow [2022-12-13 04:28:18,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 4890 transitions, 71202 flow [2022-12-13 04:28:18,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:28:18,577 INFO L89 Accepts]: Start accepts. Operand has 130 places, 4890 transitions, 71202 flow [2022-12-13 04:28:18,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:28:18,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:28:18,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 4890 transitions, 71202 flow [2022-12-13 04:28:18,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 4890 transitions, 71202 flow [2022-12-13 04:28:18,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:28:18,760 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:28:18,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-13 04:28:18,761 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 4890 transitions, 71202 flow [2022-12-13 04:28:18,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:18,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:28:18,761 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:28:18,767 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-13 04:28:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:28:18,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:28:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:28:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 593034225, now seen corresponding path program 1 times [2022-12-13 04:28:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:28:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045903393] [2022-12-13 04:28:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:28:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:28:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:28:19,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045903393] [2022-12-13 04:28:19,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045903393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:28:19,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163666898] [2022-12-13 04:28:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:28:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:28:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:28:19,576 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-13 04:28:19,578 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-13 04:28:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:28:19,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 04:28:19,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:28:19,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:28:19,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:28:19,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:28:19,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:28:19,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 04:28:19,887 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-13 04:28:19,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:28:19,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_423) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-12-13 04:28:19,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:28:19,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 162 [2022-12-13 04:28:19,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2022-12-13 04:28:19,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-12-13 04:28:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 04:28:20,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163666898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:28:20,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:28:20,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-13 04:28:20,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966190102] [2022-12-13 04:28:20,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:28:20,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 04:28:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:28:20,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 04:28:20,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=193, Unknown=2, NotChecked=28, Total=272 [2022-12-13 04:28:20,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2022-12-13 04:28:20,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 4890 transitions, 71202 flow. Second operand has 17 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:28:20,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:28:20,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2022-12-13 04:28:20,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:28:58,440 INFO L130 PetriNetUnfolder]: 79600/106879 cut-off events. [2022-12-13 04:28:58,441 INFO L131 PetriNetUnfolder]: For 94258/94258 co-relation queries the response was YES. [2022-12-13 04:28:58,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753443 conditions, 106879 events. 79600/106879 cut-off events. For 94258/94258 co-relation queries the response was YES. Maximal size of possible extension queue 3200. Compared 658690 event pairs, 5269 based on Foata normal form. 36/82584 useless extension candidates. Maximal degree in co-relation 296474. Up to 79844 conditions per place. [2022-12-13 04:28:59,185 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 4843 selfloop transitions, 365 changer transitions 6/5265 dead transitions. [2022-12-13 04:28:59,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 5265 transitions, 87115 flow [2022-12-13 04:28:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:28:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:28:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2022-12-13 04:28:59,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5018315018315018 [2022-12-13 04:28:59,187 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2022-12-13 04:28:59,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 5265 transitions, 87115 flow [2022-12-13 04:28:59,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 5259 transitions, 87007 flow [2022-12-13 04:29:00,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:29:00,269 INFO L89 Accepts]: Start accepts. Operand has 136 places, 5259 transitions, 87007 flow [2022-12-13 04:29:00,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:29:00,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:29:00,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 5259 transitions, 87007 flow [2022-12-13 04:29:00,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 5259 transitions, 87007 flow [2022-12-13 04:29:00,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:29:00,428 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:29:00,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 04:29:00,429 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 5259 transitions, 87007 flow [2022-12-13 04:29:00,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:00,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:29:00,429 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:29:00,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 04:29:00,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:29:00,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:29:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:29:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 323496187, now seen corresponding path program 2 times [2022-12-13 04:29:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:29:00,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841758186] [2022-12-13 04:29:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:29:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:29:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:29:02,042 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-13 04:29:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:29:02,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841758186] [2022-12-13 04:29:02,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841758186] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:29:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228935327] [2022-12-13 04:29:02,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:29:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:29:02,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:29:02,044 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-13 04:29:02,046 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-13 04:29:02,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:29:02,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:29:02,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 04:29:02,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:29:02,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:29:02,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:29:02,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:29:02,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:29:02,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:29:02,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:29:02,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 04:29:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:29:02,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:29:02,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:29:02,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 168 [2022-12-13 04:29:02,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2022-12-13 04:29:02,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-12-13 04:29:02,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-12-13 04:29:02,876 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-13 04:29:02,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228935327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:29:02,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:29:02,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 04:29:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196576385] [2022-12-13 04:29:02,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:29:02,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 04:29:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:29:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 04:29:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=339, Unknown=6, NotChecked=0, Total=420 [2022-12-13 04:29:02,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2022-12-13 04:29:02,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 5259 transitions, 87007 flow. Second operand has 21 states, 21 states have (on average 7.238095238095238) internal successors, (152), 21 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:29:02,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:29:02,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2022-12-13 04:29:02,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:29:12,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:29:59,707 INFO L130 PetriNetUnfolder]: 91425/122804 cut-off events. [2022-12-13 04:29:59,708 INFO L131 PetriNetUnfolder]: For 142216/142216 co-relation queries the response was YES. [2022-12-13 04:29:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969456 conditions, 122804 events. 91425/122804 cut-off events. For 142216/142216 co-relation queries the response was YES. Maximal size of possible extension queue 3672. Compared 768954 event pairs, 5901 based on Foata normal form. 6/94771 useless extension candidates. Maximal degree in co-relation 350130. Up to 91921 conditions per place. [2022-12-13 04:30:00,623 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 5290 selfloop transitions, 689 changer transitions 9/6039 dead transitions. [2022-12-13 04:30:00,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 6039 transitions, 111969 flow [2022-12-13 04:30:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 04:30:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 04:30:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 307 transitions. [2022-12-13 04:30:00,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4143049932523617 [2022-12-13 04:30:00,631 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2022-12-13 04:30:00,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 6039 transitions, 111969 flow [2022-12-13 04:30:01,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 6030 transitions, 111789 flow [2022-12-13 04:30:02,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:30:02,160 INFO L89 Accepts]: Start accepts. Operand has 154 places, 6030 transitions, 111789 flow [2022-12-13 04:30:02,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:30:02,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:30:02,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 6030 transitions, 111789 flow [2022-12-13 04:30:02,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 6030 transitions, 111789 flow [2022-12-13 04:30:02,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:30:02,337 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:30:02,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-13 04:30:02,339 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 6030 transitions, 111789 flow [2022-12-13 04:30:02,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.238095238095238) internal successors, (152), 21 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:30:02,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:30:02,339 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:30:02,344 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-13 04:30:02,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:30:02,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:30:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:30:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 75139441, now seen corresponding path program 1 times [2022-12-13 04:30:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:30:02,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388994516] [2022-12-13 04:30:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:30:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:30:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:30:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 04:30:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:30:02,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388994516] [2022-12-13 04:30:02,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388994516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:30:02,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:30:02,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:30:02,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167910853] [2022-12-13 04:30:02,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:30:02,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:30:02,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:30:02,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:30:02,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:30:02,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2022-12-13 04:30:02,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 6030 transitions, 111789 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-13 04:30:02,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:30:02,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2022-12-13 04:30:02,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:30:59,831 INFO L130 PetriNetUnfolder]: 77502/108715 cut-off events. [2022-12-13 04:30:59,831 INFO L131 PetriNetUnfolder]: For 176706/176706 co-relation queries the response was YES. [2022-12-13 04:31:00,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921929 conditions, 108715 events. 77502/108715 cut-off events. For 176706/176706 co-relation queries the response was YES. Maximal size of possible extension queue 3503. Compared 748599 event pairs, 5909 based on Foata normal form. 2762/93841 useless extension candidates. Maximal degree in co-relation 328740. Up to 78090 conditions per place. [2022-12-13 04:31:00,530 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 3692 selfloop transitions, 1 changer transitions 1486/5365 dead transitions. [2022-12-13 04:31:00,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 5365 transitions, 110273 flow [2022-12-13 04:31:00,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:31:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:31:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 04:31:00,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2022-12-13 04:31:00,532 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2022-12-13 04:31:00,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 5365 transitions, 110273 flow [2022-12-13 04:31:01,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 3879 transitions, 79308 flow [2022-12-13 04:31:01,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:31:01,649 INFO L89 Accepts]: Start accepts. Operand has 148 places, 3879 transitions, 79308 flow [2022-12-13 04:31:01,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:31:01,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:31:01,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 3879 transitions, 79308 flow [2022-12-13 04:31:01,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 3879 transitions, 79308 flow [2022-12-13 04:31:01,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:31:01,807 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:31:01,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 04:31:01,808 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 3879 transitions, 79308 flow [2022-12-13 04:31:01,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-13 04:31:01,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:31:01,808 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:31:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:31:01,808 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:31:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:31:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 770888025, now seen corresponding path program 1 times [2022-12-13 04:31:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:31:01,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161600113] [2022-12-13 04:31:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:01,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:31:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:02,784 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-13 04:31:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:31:02,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161600113] [2022-12-13 04:31:02,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161600113] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:31:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583784024] [2022-12-13 04:31:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:02,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:31:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:31:02,787 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-13 04:31:02,788 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-13 04:31:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:02,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 04:31:02,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:31:03,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:31:03,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:31:03,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:31:03,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:31:03,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 04:31:03,229 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-13 04:31:03,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:31:03,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:31:03,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 84 [2022-12-13 04:31:03,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-12-13 04:31:03,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2022-12-13 04:31:03,565 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-13 04:31:03,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583784024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:31:03,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:31:03,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2022-12-13 04:31:03,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603202244] [2022-12-13 04:31:03,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:31:03,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 04:31:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:31:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 04:31:03,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-12-13 04:31:03,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-13 04:31:03,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 3879 transitions, 79308 flow. Second operand has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:03,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:31:03,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-13 04:31:03,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:31:40,330 INFO L130 PetriNetUnfolder]: 67849/92813 cut-off events. [2022-12-13 04:31:40,330 INFO L131 PetriNetUnfolder]: For 187676/187676 co-relation queries the response was YES. [2022-12-13 04:31:40,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872486 conditions, 92813 events. 67849/92813 cut-off events. For 187676/187676 co-relation queries the response was YES. Maximal size of possible extension queue 2955. Compared 592270 event pairs, 4446 based on Foata normal form. 69/77743 useless extension candidates. Maximal degree in co-relation 300658. Up to 66708 conditions per place. [2022-12-13 04:31:41,063 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 4015 selfloop transitions, 551 changer transitions 12/4592 dead transitions. [2022-12-13 04:31:41,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 4592 transitions, 102919 flow [2022-12-13 04:31:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 04:31:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 04:31:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 492 transitions. [2022-12-13 04:31:41,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47953216374269003 [2022-12-13 04:31:41,065 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 132 predicate places. [2022-12-13 04:31:41,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 4592 transitions, 102919 flow [2022-12-13 04:31:41,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 4580 transitions, 102640 flow [2022-12-13 04:31:42,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:31:42,285 INFO L89 Accepts]: Start accepts. Operand has 174 places, 4580 transitions, 102640 flow [2022-12-13 04:31:42,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:31:42,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:31:42,309 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 4580 transitions, 102640 flow [2022-12-13 04:31:42,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 4580 transitions, 102640 flow [2022-12-13 04:31:42,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:31:50,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:31:50,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7988 [2022-12-13 04:31:50,273 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 4579 transitions, 102618 flow [2022-12-13 04:31:50,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 27 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:50,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:31:50,274 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:31:50,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 04:31:50,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:31:50,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:31:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:31:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1709699581, now seen corresponding path program 1 times [2022-12-13 04:31:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:31:50,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291043684] [2022-12-13 04:31:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:31:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:51,826 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-13 04:31:51,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:31:51,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291043684] [2022-12-13 04:31:51,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291043684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:31:51,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613127737] [2022-12-13 04:31:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:31:51,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:31:51,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:31:51,835 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-13 04:31:51,837 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-13 04:31:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:31:51,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 04:31:52,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:31:52,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:31:52,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:31:52,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:31:52,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:31:52,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:31:52,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:31:52,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 04:31:52,505 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-13 04:31:52,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:31:56,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:31:56,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 330 [2022-12-13 04:31:56,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 266 [2022-12-13 04:31:56,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 242 [2022-12-13 04:31:56,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2022-12-13 04:31:57,063 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-13 04:31:57,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613127737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:31:57,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:31:57,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2022-12-13 04:31:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621265151] [2022-12-13 04:31:57,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:31:57,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 04:31:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:31:57,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 04:31:57,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=493, Unknown=6, NotChecked=0, Total=600 [2022-12-13 04:31:57,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 04:31:57,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 4579 transitions, 102618 flow. Second operand has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:31:57,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:31:57,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 04:31:57,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:45,621 INFO L130 PetriNetUnfolder]: 78498/107251 cut-off events. [2022-12-13 04:32:45,622 INFO L131 PetriNetUnfolder]: For 245161/245161 co-relation queries the response was YES. [2022-12-13 04:32:45,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099939 conditions, 107251 events. 78498/107251 cut-off events. For 245161/245161 co-relation queries the response was YES. Maximal size of possible extension queue 3427. Compared 694503 event pairs, 4994 based on Foata normal form. 5/89040 useless extension candidates. Maximal degree in co-relation 349780. Up to 77530 conditions per place. [2022-12-13 04:32:46,551 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 4677 selfloop transitions, 630 changer transitions 12/5333 dead transitions. [2022-12-13 04:32:46,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 5333 transitions, 130264 flow [2022-12-13 04:32:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 04:32:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 04:32:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 263 transitions. [2022-12-13 04:32:46,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.421474358974359 [2022-12-13 04:32:46,553 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places. [2022-12-13 04:32:46,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 5333 transitions, 130264 flow [2022-12-13 04:32:47,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 5321 transitions, 129961 flow [2022-12-13 04:32:48,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:48,070 INFO L89 Accepts]: Start accepts. Operand has 188 places, 5321 transitions, 129961 flow [2022-12-13 04:32:48,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:48,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:48,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 5321 transitions, 129961 flow [2022-12-13 04:32:48,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 5321 transitions, 129961 flow [2022-12-13 04:32:48,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:48,248 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:48,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 04:32:48,248 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 5321 transitions, 129961 flow [2022-12-13 04:32:48,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:48,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:48,249 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:32:48,270 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-13 04:32:48,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:48,456 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:32:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash 523982241, now seen corresponding path program 1 times [2022-12-13 04:32:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:48,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889529885] [2022-12-13 04:32:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:49,509 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-13 04:32:49,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889529885] [2022-12-13 04:32:49,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889529885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:32:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281280717] [2022-12-13 04:32:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:49,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:32:49,511 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-13 04:32:49,514 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-13 04:32:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:49,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 04:32:49,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:32:49,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:32:49,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:32:49,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:32:49,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:32:49,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:32:49,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:32:50,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-13 04:32:50,067 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-13 04:32:50,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:32:52,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:32:52,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1362 treesize of output 1302 [2022-12-13 04:32:52,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 643 treesize of output 595 [2022-12-13 04:32:52,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1238 treesize of output 1142 [2022-12-13 04:32:52,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1142 treesize of output 950 [2022-12-13 04:32:54,243 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-13 04:32:54,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281280717] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:32:54,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:32:54,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 26 [2022-12-13 04:32:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606251196] [2022-12-13 04:32:54,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:32:54,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 04:32:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 04:32:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=646, Unknown=9, NotChecked=0, Total=756 [2022-12-13 04:32:54,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 04:32:54,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 5321 transitions, 129961 flow. Second operand has 28 states, 28 states have (on average 5.714285714285714) internal successors, (160), 28 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:54,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:54,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 04:32:54,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:56,851 INFO L130 PetriNetUnfolder]: 83114/113436 cut-off events. [2022-12-13 04:33:56,851 INFO L131 PetriNetUnfolder]: For 306995/306995 co-relation queries the response was YES. [2022-12-13 04:33:57,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259864 conditions, 113436 events. 83114/113436 cut-off events. For 306995/306995 co-relation queries the response was YES. Maximal size of possible extension queue 3627. Compared 737772 event pairs, 5264 based on Foata normal form. 5/93862 useless extension candidates. Maximal degree in co-relation 378546. Up to 82209 conditions per place. [2022-12-13 04:33:57,993 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 4938 selfloop transitions, 725 changer transitions 9/5686 dead transitions. [2022-12-13 04:33:57,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 5686 transitions, 150218 flow [2022-12-13 04:33:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 04:33:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 04:33:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 439 transitions. [2022-12-13 04:33:57,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40201465201465203 [2022-12-13 04:33:57,995 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2022-12-13 04:33:57,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 5686 transitions, 150218 flow [2022-12-13 04:33:58,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 5677 transitions, 149969 flow [2022-12-13 04:33:59,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:59,620 INFO L89 Accepts]: Start accepts. Operand has 215 places, 5677 transitions, 149969 flow [2022-12-13 04:33:59,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:59,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:59,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 5677 transitions, 149969 flow [2022-12-13 04:33:59,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 5677 transitions, 149969 flow [2022-12-13 04:33:59,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:34:07,938 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:34:07,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8319 [2022-12-13 04:34:07,939 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 5676 transitions, 149943 flow [2022-12-13 04:34:07,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.714285714285714) internal successors, (160), 28 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:07,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:34:07,940 INFO L214 CegarLoopForPetriNet]: trace histogram [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-13 04:34:07,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 04:34:08,144 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,SelfDestructingSolverStorable11 [2022-12-13 04:34:08,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:34:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:34:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1945614214, now seen corresponding path program 1 times [2022-12-13 04:34:08,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:34:08,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211703515] [2022-12-13 04:34:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:34:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:34:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:34:08,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211703515] [2022-12-13 04:34:08,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211703515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:34:08,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380529120] [2022-12-13 04:34:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:08,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:34:08,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:34:08,297 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-13 04:34:08,324 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-13 04:34:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:08,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 04:34:08,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:34:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 04:34:08,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:34:08,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380529120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:34:08,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:34:08,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 04:34:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873766915] [2022-12-13 04:34:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:34:08,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:34:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:34:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:34:08,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:34:08,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-13 04:34:08,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 5676 transitions, 149943 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-13 04:34:08,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:34:08,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-13 04:34:08,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:35:32,489 INFO L130 PetriNetUnfolder]: 101192/139298 cut-off events. [2022-12-13 04:35:32,489 INFO L131 PetriNetUnfolder]: For 361100/361100 co-relation queries the response was YES. [2022-12-13 04:35:32,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691429 conditions, 139298 events. 101192/139298 cut-off events. For 361100/361100 co-relation queries the response was YES. Maximal size of possible extension queue 4379. Compared 944253 event pairs, 5196 based on Foata normal form. 1484/115385 useless extension candidates. Maximal degree in co-relation 405402. Up to 104045 conditions per place. [2022-12-13 04:35:33,813 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 7044 selfloop transitions, 202 changer transitions 311/7815 dead transitions. [2022-12-13 04:35:33,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 7815 transitions, 222311 flow [2022-12-13 04:35:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:35:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:35:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 04:35:33,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 04:35:33,815 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2022-12-13 04:35:33,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 7815 transitions, 222311 flow [2022-12-13 04:35:34,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 7504 transitions, 213249 flow [2022-12-13 04:35:35,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:35:35,774 INFO L89 Accepts]: Start accepts. Operand has 216 places, 7504 transitions, 213249 flow [2022-12-13 04:35:35,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:35:35,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:35:35,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 7504 transitions, 213249 flow [2022-12-13 04:35:36,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 7504 transitions, 213249 flow [2022-12-13 04:35:36,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:35:36,090 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:35:36,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-13 04:35:36,091 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 7504 transitions, 213249 flow [2022-12-13 04:35:36,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-13 04:35:36,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:35:36,091 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:35:36,097 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-13 04:35:36,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 04:35:36,297 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:35:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:35:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2136472408, now seen corresponding path program 3 times [2022-12-13 04:35:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:35:36,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729873990] [2022-12-13 04:35:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:35:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:35:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:35:37,142 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-13 04:35:37,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:35:37,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729873990] [2022-12-13 04:35:37,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729873990] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:35:37,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980635770] [2022-12-13 04:35:37,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 04:35:37,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:35:37,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:35:37,144 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-13 04:35:37,145 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-13 04:35:37,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 04:35:37,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:35:37,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 04:35:37,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:35:37,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 04:35:37,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:35:37,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 04:35:37,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:35:37,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:35:37,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:35:37,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:35:37,757 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-12-13 04:35:37,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 15 [2022-12-13 04:35:37,778 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-13 04:35:37,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:35:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:35:38,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980635770] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:35:38,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:35:38,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-13 04:35:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629543450] [2022-12-13 04:35:38,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:35:38,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 04:35:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:35:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 04:35:38,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=461, Unknown=8, NotChecked=0, Total=552 [2022-12-13 04:35:38,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-13 04:35:38,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 7504 transitions, 213249 flow. Second operand has 24 states, 24 states have (on average 7.25) internal successors, (174), 24 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:35:38,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:35:38,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-13 04:35:38,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:36:11,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 04:36:27,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 04:38:59,470 INFO L130 PetriNetUnfolder]: 121785/168044 cut-off events. [2022-12-13 04:38:59,470 INFO L131 PetriNetUnfolder]: For 485266/485266 co-relation queries the response was YES. [2022-12-13 04:38:59,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2168888 conditions, 168044 events. 121785/168044 cut-off events. For 485266/485266 co-relation queries the response was YES. Maximal size of possible extension queue 5504. Compared 1175492 event pairs, 7186 based on Foata normal form. 14/140583 useless extension candidates. Maximal degree in co-relation 718622. Up to 126443 conditions per place. [2022-12-13 04:39:01,160 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 8498 selfloop transitions, 314 changer transitions 125/9001 dead transitions. [2022-12-13 04:39:01,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 9001 transitions, 273879 flow [2022-12-13 04:39:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 04:39:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 04:39:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 395 transitions. [2022-12-13 04:39:01,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2022-12-13 04:39:01,162 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 194 predicate places. [2022-12-13 04:39:01,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 9001 transitions, 273879 flow [2022-12-13 04:39:02,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 8876 transitions, 269982 flow [2022-12-13 04:39:03,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:03,693 INFO L89 Accepts]: Start accepts. Operand has 236 places, 8876 transitions, 269982 flow [2022-12-13 04:39:03,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:03,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:03,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 8876 transitions, 269982 flow [2022-12-13 04:39:04,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 8876 transitions, 269982 flow [2022-12-13 04:39:04,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:04,071 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:39:04,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 379 [2022-12-13 04:39:04,072 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 8876 transitions, 269982 flow [2022-12-13 04:39:04,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.25) internal successors, (174), 24 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:04,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:04,073 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:04,078 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-13 04:39:04,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 04:39:04,278 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -301873164, now seen corresponding path program 4 times [2022-12-13 04:39:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:04,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763293225] [2022-12-13 04:39:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:05,000 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-13 04:39:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:05,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763293225] [2022-12-13 04:39:05,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763293225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:39:05,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135232858] [2022-12-13 04:39:05,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 04:39:05,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:39:05,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:39:05,002 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-13 04:39:05,033 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-13 04:39:05,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 04:39:05,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:39:05,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 04:39:05,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:39:05,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2022-12-13 04:39:05,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:39:05,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 04:39:05,662 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-12-13 04:39:05,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 15 [2022-12-13 04:39:05,670 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-13 04:39:05,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:39:06,073 INFO L321 Elim1Store]: treesize reduction 26, result has 60.0 percent of original size [2022-12-13 04:39:06,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 245 [2022-12-13 04:39:06,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 154 [2022-12-13 04:39:06,096 INFO L321 Elim1Store]: treesize reduction 27, result has 34.1 percent of original size [2022-12-13 04:39:06,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 150 [2022-12-13 04:39:06,521 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-13 04:39:06,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135232858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:39:06,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:39:06,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 04:39:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316238713] [2022-12-13 04:39:06,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:39:06,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 04:39:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 04:39:06,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=366, Unknown=3, NotChecked=0, Total=462 [2022-12-13 04:39:06,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-13 04:39:06,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 8876 transitions, 269982 flow. Second operand has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 22 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:06,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:06,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-13 04:39:06,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:19,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-13 04:40:01,915 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-13 04:40:01,916 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:40:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 04:40:02,003 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 04:40:02,011 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-13 04:40:02,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 04:40:02,209 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/40 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 485664 conditions, 36760 events (26805/36759 cut-off events. For 172830/172830 co-relation queries the response was YES. Maximal size of possible extension queue 5324. Compared 250338 event pairs, 1846 based on Foata normal form. 63/35600 useless extension candidates. Maximal degree in co-relation 244793. Up to 25566 conditions per place.). [2022-12-13 04:40:02,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 04:40:02,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 04:40:02,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 04:40:02,211 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 04:40:02,211 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:40:02,232 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:40:02,232 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:40:02,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:40:02 BasicIcfg [2022-12-13 04:40:02,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:40:02,235 INFO L158 Benchmark]: Toolchain (without parser) took 800892.59ms. Allocated memory was 225.4MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 199.7MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-13 04:40:02,235 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 225.4MB. Free memory is still 201.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:40:02,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.98ms. Allocated memory is still 225.4MB. Free memory was 199.7MB in the beginning and 184.4MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 04:40:02,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.45ms. Allocated memory is still 225.4MB. Free memory was 184.4MB in the beginning and 181.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 04:40:02,240 INFO L158 Benchmark]: Boogie Preprocessor took 43.58ms. Allocated memory is still 225.4MB. Free memory was 181.2MB in the beginning and 179.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:40:02,240 INFO L158 Benchmark]: RCFGBuilder took 746.55ms. Allocated memory is still 225.4MB. Free memory was 179.1MB in the beginning and 134.6MB in the end (delta: 44.6MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-12-13 04:40:02,240 INFO L158 Benchmark]: TraceAbstraction took 799767.88ms. Allocated memory was 225.4MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 133.0MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-12-13 04:40:02,243 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 225.4MB. Free memory is still 201.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.98ms. Allocated memory is still 225.4MB. Free memory was 199.7MB in the beginning and 184.4MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.45ms. Allocated memory is still 225.4MB. Free memory was 184.4MB in the beginning and 181.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.58ms. Allocated memory is still 225.4MB. Free memory was 181.2MB in the beginning and 179.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 746.55ms. Allocated memory is still 225.4MB. Free memory was 179.1MB in the beginning and 134.6MB in the end (delta: 44.6MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 799767.88ms. Allocated memory was 225.4MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 133.0MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 204 PlacesBefore, 42 PlacesAfterwards, 210 TransitionsBefore, 35 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 31 ConcurrentYvCompositions, 13 ChoiceCompositions, 175 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 948, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 899, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 899, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 962, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 899, unknown conditional: 0, unknown unconditional: 899] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1343, Positive conditional cache size: 0, Positive unconditional cache size: 1343, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 14, independent unconditional: 16, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 30, independent conditional: 4, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 4, independent unconditional: 26, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 49 PlacesBefore, 48 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 32, independent unconditional: 36, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 68, independent conditional: 12, independent unconditional: 56, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 68, independent conditional: 12, independent unconditional: 56, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 72, independent: 67, independent conditional: 11, independent unconditional: 56, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 18.4s, 81 PlacesBefore, 77 PlacesAfterwards, 894 TransitionsBefore, 890 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 115 PlacesBefore, 115 PlacesAfterwards, 2892 TransitionsBefore, 2892 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 130 PlacesBefore, 130 PlacesAfterwards, 4890 TransitionsBefore, 4890 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 136 PlacesBefore, 136 PlacesAfterwards, 5259 TransitionsBefore, 5259 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 154 PlacesBefore, 154 PlacesAfterwards, 6030 TransitionsBefore, 6030 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 148 PlacesBefore, 148 PlacesAfterwards, 3879 TransitionsBefore, 3879 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 7.9s, 174 PlacesBefore, 173 PlacesAfterwards, 4580 TransitionsBefore, 4579 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 188 PlacesBefore, 188 PlacesAfterwards, 5321 TransitionsBefore, 5321 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 8.2s, 215 PlacesBefore, 214 PlacesAfterwards, 5677 TransitionsBefore, 5676 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 216 PlacesBefore, 216 PlacesAfterwards, 7504 TransitionsBefore, 7504 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 236 PlacesBefore, 236 PlacesAfterwards, 8876 TransitionsBefore, 8876 TransitionsAfterwards, 0 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): 13, Positive cache size: 12, Positive conditional cache size: 3, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/40 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 485664 conditions, 36760 events (26805/36759 cut-off events. For 172830/172830 co-relation queries the response was YES. Maximal size of possible extension queue 5324. Compared 250338 event pairs, 1846 based on Foata normal form. 63/35600 useless extension candidates. Maximal degree in co-relation 244793. Up to 25566 conditions per place.). - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/40 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 485664 conditions, 36760 events (26805/36759 cut-off events. For 172830/172830 co-relation queries the response was YES. Maximal size of possible extension queue 5324. Compared 250338 event pairs, 1846 based on Foata normal form. 63/35600 useless extension candidates. Maximal degree in co-relation 244793. Up to 25566 conditions per place.). - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/40 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 485664 conditions, 36760 events (26805/36759 cut-off events. For 172830/172830 co-relation queries the response was YES. Maximal size of possible extension queue 5324. Compared 250338 event pairs, 1846 based on Foata normal form. 63/35600 useless extension candidates. Maximal degree in co-relation 244793. Up to 25566 conditions per place.). - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/40 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 485664 conditions, 36760 events (26805/36759 cut-off events. For 172830/172830 co-relation queries the response was YES. Maximal size of possible extension queue 5324. Compared 250338 event pairs, 1846 based on Foata normal form. 63/35600 useless extension candidates. Maximal degree in co-relation 244793. Up to 25566 conditions per place.). - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/40 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 485664 conditions, 36760 events (26805/36759 cut-off events. For 172830/172830 co-relation queries the response was YES. Maximal size of possible extension queue 5324. Compared 250338 event pairs, 1846 based on Foata normal form. 63/35600 useless extension candidates. Maximal degree in co-relation 244793. Up to 25566 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 240 locations, 5 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: 799.6s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 703.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 572 mSolverCounterUnknown, 6132 SdHoareTripleChecker+Valid, 26.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6132 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 24.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 60 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 901 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14028 IncrementalHoareTripleChecker+Invalid, 15561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 901 mSolverCounterUnsat, 10 mSDtfsCounter, 14028 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 885 GetRequests, 473 SyntacticMatches, 14 SemanticMatches, 398 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269982occurred in iteration=14, InterpolantAutomatonStates: 225, 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.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1024 ConstructedInterpolants, 94 QuantifiedInterpolants, 29449 SizeOfPredicates, 328 NumberOfNonLiveVariables, 3931 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 12/101 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