/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-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:07:52,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:07:52,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:07:52,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:07:52,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:07:52,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:07:52,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:07:52,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:07:52,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:07:52,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:07:52,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:07:52,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:07:52,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:07:52,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:07:52,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:07:52,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:07:52,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:07:52,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:07:52,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:07:52,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:07:52,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:07:52,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:07:52,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:07:52,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:07:52,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:07:52,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:07:52,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:07:52,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:07:52,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:07:52,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:07:52,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:07:52,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:07:52,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:07:52,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:07:52,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:07:52,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:07:52,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:07:52,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:07:52,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:07:52,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:07:52,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:07:52,816 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-06 03:07:52,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:07:52,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:07:52,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:07:52,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:07:52,841 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:07:52,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:07:52,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:07:52,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:07:52,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:07:52,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:07:52,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:07:52,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:07:52,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:07:52,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:07:52,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:07:52,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:07:52,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:07:52,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:07:52,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:07:52,844 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-06 03:07:53,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:07:53,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:07:53,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:07:53,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:07:53,137 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:07:53,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2022-12-06 03:07:54,135 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:07:54,324 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:07:54,324 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2022-12-06 03:07:54,349 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96182038/dc98e041d24a4d36a1490dee6ec6b5fc/FLAG924ed1dbe [2022-12-06 03:07:54,363 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96182038/dc98e041d24a4d36a1490dee6ec6b5fc [2022-12-06 03:07:54,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:07:54,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:07:54,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:07:54,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:07:54,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:07:54,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535b9890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54, skipping insertion in model container [2022-12-06 03:07:54,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:07:54,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:07:54,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,556 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-mult-4.wvr.c[2612,2625] [2022-12-06 03:07:54,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:07:54,570 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:07:54,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:07:54,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:07:54,604 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-mult-4.wvr.c[2612,2625] [2022-12-06 03:07:54,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:07:54,617 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:07:54,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54 WrapperNode [2022-12-06 03:07:54,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:07:54,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:07:54,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:07:54,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:07:54,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,667 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2022-12-06 03:07:54,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:07:54,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:07:54,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:07:54,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:07:54,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:07:54,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:07:54,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:07:54,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:07:54,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (1/1) ... [2022-12-06 03:07:54,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:07:54,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:07:54,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:07:54,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:07:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:07:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:07:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:07:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:07:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:07:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 03:07:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 03:07:54,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:07:54,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:07:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:07:54,760 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:07:54,827 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:07:54,829 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:07:54,988 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:07:55,021 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:07:55,021 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 03:07:55,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:07:55 BoogieIcfgContainer [2022-12-06 03:07:55,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:07:55,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:07:55,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:07:55,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:07:55,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:07:54" (1/3) ... [2022-12-06 03:07:55,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78690c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:07:55, skipping insertion in model container [2022-12-06 03:07:55,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:07:54" (2/3) ... [2022-12-06 03:07:55,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78690c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:07:55, skipping insertion in model container [2022-12-06 03:07:55,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:07:55" (3/3) ... [2022-12-06 03:07:55,028 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2022-12-06 03:07:55,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:07:55,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:07:55,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:07:55,191 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 03:07:55,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 126 transitions, 284 flow [2022-12-06 03:07:55,304 INFO L130 PetriNetUnfolder]: 10/122 cut-off events. [2022-12-06 03:07:55,304 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:07:55,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 122 events. 10/122 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-12-06 03:07:55,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 126 transitions, 284 flow [2022-12-06 03:07:55,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 110 transitions, 244 flow [2022-12-06 03:07:55,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:07:55,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 110 transitions, 244 flow [2022-12-06 03:07:55,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 110 transitions, 244 flow [2022-12-06 03:07:55,376 INFO L130 PetriNetUnfolder]: 10/110 cut-off events. [2022-12-06 03:07:55,376 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:07:55,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 110 events. 10/110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-12-06 03:07:55,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 110 transitions, 244 flow [2022-12-06 03:07:55,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-06 03:07:59,030 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 03:07:59,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:07:59,043 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;@cebd178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:07:59,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 03:07:59,047 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 03:07:59,047 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 03:07:59,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:07:59,048 INFO L213 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] [2022-12-06 03:07:59,048 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-06 03:07:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:07:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash -514425640, now seen corresponding path program 1 times [2022-12-06 03:07:59,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:07:59,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116994003] [2022-12-06 03:07:59,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:07:59,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:07:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:07:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:07:59,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:07:59,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116994003] [2022-12-06 03:07:59,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116994003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:07:59,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:07:59,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 03:07:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671403744] [2022-12-06 03:07:59,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:07:59,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:07:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:07:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:07:59,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:07:59,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 03:07:59,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:07:59,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:07:59,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 03:07:59,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:07:59,585 INFO L130 PetriNetUnfolder]: 1343/1736 cut-off events. [2022-12-06 03:07:59,585 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-06 03:07:59,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 1736 events. 1343/1736 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5934 event pairs, 215 based on Foata normal form. 1/1045 useless extension candidates. Maximal degree in co-relation 2691. Up to 1515 conditions per place. [2022-12-06 03:07:59,595 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 39 selfloop transitions, 3 changer transitions 3/49 dead transitions. [2022-12-06 03:07:59,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 233 flow [2022-12-06 03:07:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:07:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:07:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 03:07:59,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-06 03:07:59,605 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-06 03:07:59,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:07:59,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 49 transitions, 233 flow [2022-12-06 03:07:59,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 49 transitions, 233 flow [2022-12-06 03:07:59,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 03:07:59,616 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:07:59,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 03:07:59,618 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 49 transitions, 233 flow [2022-12-06 03:07:59,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:07:59,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:07:59,618 INFO L213 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] [2022-12-06 03:07:59,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:07:59,618 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-06 03:07:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:07:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1434159477, now seen corresponding path program 1 times [2022-12-06 03:07:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:07:59,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763333370] [2022-12-06 03:07:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:07:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:07:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:07:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:07:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:07:59,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763333370] [2022-12-06 03:07:59,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763333370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:07:59,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:07:59,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:07:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604121729] [2022-12-06 03:07:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:07:59,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:07:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:07:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:07:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:07:59,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:07:59,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 49 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:07:59,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:07:59,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:07:59,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:00,171 INFO L130 PetriNetUnfolder]: 2039/2817 cut-off events. [2022-12-06 03:08:00,171 INFO L131 PetriNetUnfolder]: For 542/580 co-relation queries the response was YES. [2022-12-06 03:08:00,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8483 conditions, 2817 events. 2039/2817 cut-off events. For 542/580 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12333 event pairs, 215 based on Foata normal form. 2/2046 useless extension candidates. Maximal degree in co-relation 6187. Up to 2103 conditions per place. [2022-12-06 03:08:00,185 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 96 selfloop transitions, 4 changer transitions 31/133 dead transitions. [2022-12-06 03:08:00,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 133 transitions, 905 flow [2022-12-06 03:08:00,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:08:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:08:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-06 03:08:00,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6344827586206897 [2022-12-06 03:08:00,188 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-06 03:08:00,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:00,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 133 transitions, 905 flow [2022-12-06 03:08:00,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 133 transitions, 905 flow [2022-12-06 03:08:00,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 03:08:00,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:00,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 03:08:00,203 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 133 transitions, 905 flow [2022-12-06 03:08:00,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:00,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:00,204 INFO L213 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] [2022-12-06 03:08:00,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:08:00,204 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-06 03:08:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash -288431369, now seen corresponding path program 2 times [2022-12-06 03:08:00,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:00,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728024121] [2022-12-06 03:08:00,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:00,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:00,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728024121] [2022-12-06 03:08:00,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728024121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:08:00,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:08:00,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:08:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834551885] [2022-12-06 03:08:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:00,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:08:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:08:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:08:00,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:08:00,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 133 transitions, 905 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:00,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:00,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:08:00,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:00,759 INFO L130 PetriNetUnfolder]: 2968/4243 cut-off events. [2022-12-06 03:08:00,759 INFO L131 PetriNetUnfolder]: For 2834/2916 co-relation queries the response was YES. [2022-12-06 03:08:00,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16562 conditions, 4243 events. 2968/4243 cut-off events. For 2834/2916 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21582 event pairs, 299 based on Foata normal form. 9/3382 useless extension candidates. Maximal degree in co-relation 15600. Up to 2732 conditions per place. [2022-12-06 03:08:00,782 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 177 selfloop transitions, 16 changer transitions 137/332 dead transitions. [2022-12-06 03:08:00,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 332 transitions, 2901 flow [2022-12-06 03:08:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:08:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:08:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-06 03:08:00,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-06 03:08:00,785 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 03:08:00,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:00,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 332 transitions, 2901 flow [2022-12-06 03:08:00,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 332 transitions, 2901 flow [2022-12-06 03:08:00,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 03:08:00,837 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:00,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 03:08:00,838 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 332 transitions, 2901 flow [2022-12-06 03:08:00,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:00,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:00,839 INFO L213 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] [2022-12-06 03:08:00,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:08:00,839 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-06 03:08:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1707795993, now seen corresponding path program 3 times [2022-12-06 03:08:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:00,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899248427] [2022-12-06 03:08:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899248427] [2022-12-06 03:08:00,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899248427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:08:00,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:08:00,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:08:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022303617] [2022-12-06 03:08:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:00,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:08:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:00,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:08:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:08:00,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:08:00,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 332 transitions, 2901 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:00,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:00,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:08:00,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:01,220 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([437] L72-4-->L72-4: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (+ |v_thread4Thread1of1ForFork1_~i~3#1_26| 1) |v_thread4Thread1of1ForFork1_~i~3#1_25|) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_26| 4294967296) (mod v_~N~0_45 4294967296)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_104 4294967296)) 1 0)) (= v_~counter~0_104 (+ v_~c~0_48 v_~counter~0_103)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_104, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_26|, ~N~0=v_~N~0_45} OutVars{~counter~0=v_~counter~0_103, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_25|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_17|, ~N~0=v_~N~0_45, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][263], [thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 132#true, 83#L95-1true, 41#L72-4true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 153#(= thread3Thread1of1ForFork3_~i~2 0), 34#L51-4true, 106#L41-4true, 39#L62-4true, thread1Thread1of1ForFork0InUse, 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,220 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 03:08:01,221 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 03:08:01,221 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 03:08:01,221 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 03:08:01,221 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([469] L72-4-->thread4EXIT: Formula: (and (not (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_In_2| 4294967296) (mod v_~N~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork1_#res#1.base_Out_4| 0)) InVars {thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|, ~N~0=v_~N~0_In_5} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_Out_4|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_5, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#res#1.offset][264], [thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 132#true, 83#L95-1true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 153#(= thread3Thread1of1ForFork3_~i~2 0), 87#thread4EXITtrue, 34#L51-4true, 106#L41-4true, 39#L62-4true, thread1Thread1of1ForFork0InUse, 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,221 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2022-12-06 03:08:01,221 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 03:08:01,221 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 03:08:01,222 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 03:08:01,251 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([437] L72-4-->L72-4: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (+ |v_thread4Thread1of1ForFork1_~i~3#1_26| 1) |v_thread4Thread1of1ForFork1_~i~3#1_25|) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_26| 4294967296) (mod v_~N~0_45 4294967296)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_104 4294967296)) 1 0)) (= v_~counter~0_104 (+ v_~c~0_48 v_~counter~0_103)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_104, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_26|, ~N~0=v_~N~0_45} OutVars{~counter~0=v_~counter~0_103, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_25|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_17|, ~N~0=v_~N~0_45, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][263], [thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 132#true, 83#L95-1true, 41#L72-4true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 153#(= thread3Thread1of1ForFork3_~i~2 0), 34#L51-4true, 39#L62-4true, 64#thread1EXITtrue, thread1Thread1of1ForFork0InUse, 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,251 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 03:08:01,251 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 03:08:01,252 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 03:08:01,252 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 03:08:01,252 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([469] L72-4-->thread4EXIT: Formula: (and (not (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_In_2| 4294967296) (mod v_~N~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork1_#res#1.base_Out_4| 0)) InVars {thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|, ~N~0=v_~N~0_In_5} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_Out_4|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_5, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#res#1.offset][264], [thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 132#true, 83#L95-1true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 153#(= thread3Thread1of1ForFork3_~i~2 0), 87#thread4EXITtrue, 34#L51-4true, 39#L62-4true, 64#thread1EXITtrue, thread1Thread1of1ForFork0InUse, 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,254 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2022-12-06 03:08:01,254 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-06 03:08:01,257 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-06 03:08:01,257 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 03:08:01,298 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([437] L72-4-->L72-4: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (+ |v_thread4Thread1of1ForFork1_~i~3#1_26| 1) |v_thread4Thread1of1ForFork1_~i~3#1_25|) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_26| 4294967296) (mod v_~N~0_45 4294967296)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_104 4294967296)) 1 0)) (= v_~counter~0_104 (+ v_~c~0_48 v_~counter~0_103)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_104, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_26|, ~N~0=v_~N~0_45} OutVars{~counter~0=v_~counter~0_103, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_25|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_17|, ~N~0=v_~N~0_45, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][263], [thread4Thread1of1ForFork1InUse, 34#L51-4true, thread2Thread1of1ForFork2InUse, 132#true, 39#L62-4true, 41#L72-4true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), thread1Thread1of1ForFork0NotInUse, 82#L95-2true, 153#(= thread3Thread1of1ForFork3_~i~2 0), 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,299 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,299 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 03:08:01,299 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 03:08:01,299 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,299 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([469] L72-4-->thread4EXIT: Formula: (and (not (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_In_2| 4294967296) (mod v_~N~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork1_#res#1.base_Out_4| 0)) InVars {thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|, ~N~0=v_~N~0_In_5} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_Out_4|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_5, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#res#1.offset][264], [thread4Thread1of1ForFork1InUse, 34#L51-4true, thread2Thread1of1ForFork2InUse, 132#true, 39#L62-4true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), thread1Thread1of1ForFork0NotInUse, 82#L95-2true, 153#(= thread3Thread1of1ForFork3_~i~2 0), 87#thread4EXITtrue, 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,299 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,299 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 03:08:01,299 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 03:08:01,299 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,336 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([437] L72-4-->L72-4: Formula: (and (not (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (+ |v_thread4Thread1of1ForFork1_~i~3#1_26| 1) |v_thread4Thread1of1ForFork1_~i~3#1_25|) (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_26| 4294967296) (mod v_~N~0_45 4294967296)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| (ite (< 0 (mod v_~counter~0_104 4294967296)) 1 0)) (= v_~counter~0_104 (+ v_~c~0_48 v_~counter~0_103)) (= |v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|)) InVars {~counter~0=v_~counter~0_104, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_26|, ~N~0=v_~N~0_45} OutVars{~counter~0=v_~counter~0_103, ~c~0=v_~c~0_48, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_25|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_17|, ~N~0=v_~N~0_45, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_~i~3#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post4#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][263], [57#L96-1true, thread4Thread1of1ForFork1InUse, 34#L51-4true, thread2Thread1of1ForFork2InUse, 132#true, 39#L62-4true, 41#L72-4true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), thread1Thread1of1ForFork0NotInUse, 153#(= thread3Thread1of1ForFork3_~i~2 0), 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,336 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 03:08:01,336 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,337 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,337 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 03:08:01,337 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([469] L72-4-->thread4EXIT: Formula: (and (not (< (mod |v_thread4Thread1of1ForFork1_~i~3#1_In_2| 4294967296) (mod v_~N~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork1_#res#1.base_Out_4| 0)) InVars {thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|, ~N~0=v_~N~0_In_5} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_Out_4|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_5, thread4Thread1of1ForFork1_~i~3#1=|v_thread4Thread1of1ForFork1_~i~3#1_In_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#res#1.offset][264], [57#L96-1true, thread4Thread1of1ForFork1InUse, 34#L51-4true, thread2Thread1of1ForFork2InUse, 132#true, 39#L62-4true, 137#(= |thread2Thread1of1ForFork2_~i~1#1| 0), thread1Thread1of1ForFork0NotInUse, 153#(= thread3Thread1of1ForFork3_~i~2 0), 87#thread4EXITtrue, 144#true, thread3Thread1of1ForFork3InUse]) [2022-12-06 03:08:01,337 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 03:08:01,337 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,337 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 03:08:01,337 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 03:08:01,418 INFO L130 PetriNetUnfolder]: 3770/5387 cut-off events. [2022-12-06 03:08:01,418 INFO L131 PetriNetUnfolder]: For 5626/5688 co-relation queries the response was YES. [2022-12-06 03:08:01,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26315 conditions, 5387 events. 3770/5387 cut-off events. For 5626/5688 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 28415 event pairs, 295 based on Foata normal form. 25/4283 useless extension candidates. Maximal degree in co-relation 24934. Up to 3684 conditions per place. [2022-12-06 03:08:01,457 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 269 selfloop transitions, 13 changer transitions 340/624 dead transitions. [2022-12-06 03:08:01,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 624 transitions, 6715 flow [2022-12-06 03:08:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:08:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:08:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 03:08:01,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-06 03:08:01,461 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 03:08:01,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:01,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 624 transitions, 6715 flow [2022-12-06 03:08:01,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 624 transitions, 6715 flow [2022-12-06 03:08:01,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 03:08:01,496 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:01,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 03:08:01,502 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 624 transitions, 6715 flow [2022-12-06 03:08:01,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:01,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:01,503 INFO L213 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] [2022-12-06 03:08:01,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 03:08:01,503 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-06 03:08:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:01,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1612510987, now seen corresponding path program 4 times [2022-12-06 03:08:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:01,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006333541] [2022-12-06 03:08:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:01,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006333541] [2022-12-06 03:08:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006333541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:08:01,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:08:01,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:08:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520350749] [2022-12-06 03:08:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:01,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:08:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:08:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:08:01,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:08:01,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 624 transitions, 6715 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:01,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:01,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:08:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:02,412 INFO L130 PetriNetUnfolder]: 5518/7907 cut-off events. [2022-12-06 03:08:02,412 INFO L131 PetriNetUnfolder]: For 20935/21758 co-relation queries the response was YES. [2022-12-06 03:08:02,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44504 conditions, 7907 events. 5518/7907 cut-off events. For 20935/21758 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 42578 event pairs, 280 based on Foata normal form. 254/6697 useless extension candidates. Maximal degree in co-relation 42475. Up to 5269 conditions per place. [2022-12-06 03:08:02,455 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 543 selfloop transitions, 24 changer transitions 728/1303 dead transitions. [2022-12-06 03:08:02,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 1303 transitions, 16532 flow [2022-12-06 03:08:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:08:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:08:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 03:08:02,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-06 03:08:02,457 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-06 03:08:02,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:02,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 1303 transitions, 16532 flow [2022-12-06 03:08:02,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 1303 transitions, 16532 flow [2022-12-06 03:08:02,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 03:08:02,517 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:02,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 03:08:02,518 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 1303 transitions, 16532 flow [2022-12-06 03:08:02,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:02,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:02,519 INFO L213 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] [2022-12-06 03:08:02,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 03:08:02,519 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-06 03:08:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash 274818229, now seen corresponding path program 5 times [2022-12-06 03:08:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:02,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969704349] [2022-12-06 03:08:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:02,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:02,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969704349] [2022-12-06 03:08:02,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969704349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:08:02,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:08:02,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:08:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631705634] [2022-12-06 03:08:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:02,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:08:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:02,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:08:02,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:08:02,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:08:02,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 1303 transitions, 16532 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:02,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:02,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:08:02,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:03,813 INFO L130 PetriNetUnfolder]: 6112/8767 cut-off events. [2022-12-06 03:08:03,813 INFO L131 PetriNetUnfolder]: For 35417/37121 co-relation queries the response was YES. [2022-12-06 03:08:03,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57387 conditions, 8767 events. 6112/8767 cut-off events. For 35417/37121 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 47847 event pairs, 294 based on Foata normal form. 677/7814 useless extension candidates. Maximal degree in co-relation 54961. Up to 6043 conditions per place. [2022-12-06 03:08:03,885 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 594 selfloop transitions, 31 changer transitions 780/1413 dead transitions. [2022-12-06 03:08:03,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 1413 transitions, 20698 flow [2022-12-06 03:08:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:08:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:08:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 03:08:03,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-06 03:08:03,887 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 03:08:03,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:03,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 1413 transitions, 20698 flow [2022-12-06 03:08:03,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 1413 transitions, 20698 flow [2022-12-06 03:08:03,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 03:08:03,979 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:03,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 03:08:03,980 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 1413 transitions, 20698 flow [2022-12-06 03:08:03,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:03,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:03,980 INFO L213 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] [2022-12-06 03:08:03,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 03:08:03,981 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-06 03:08:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1961618435, now seen corresponding path program 6 times [2022-12-06 03:08:03,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:03,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401490965] [2022-12-06 03:08:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:04,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401490965] [2022-12-06 03:08:04,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401490965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:08:04,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:08:04,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:08:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180178442] [2022-12-06 03:08:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:04,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:08:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:08:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:08:04,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:08:04,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 1413 transitions, 20698 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:04,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:04,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:08:04,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:05,266 INFO L130 PetriNetUnfolder]: 6003/8440 cut-off events. [2022-12-06 03:08:05,266 INFO L131 PetriNetUnfolder]: For 46189/48591 co-relation queries the response was YES. [2022-12-06 03:08:05,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62888 conditions, 8440 events. 6003/8440 cut-off events. For 46189/48591 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 44107 event pairs, 348 based on Foata normal form. 1293/8044 useless extension candidates. Maximal degree in co-relation 60745. Up to 5779 conditions per place. [2022-12-06 03:08:05,299 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 381 selfloop transitions, 50 changer transitions 885/1323 dead transitions. [2022-12-06 03:08:05,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 1323 transitions, 21938 flow [2022-12-06 03:08:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:08:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:08:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 03:08:05,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2022-12-06 03:08:05,301 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-06 03:08:05,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:05,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 1323 transitions, 21938 flow [2022-12-06 03:08:05,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 1323 transitions, 21938 flow [2022-12-06 03:08:05,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 03:08:05,344 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:05,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 03:08:05,345 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 1323 transitions, 21938 flow [2022-12-06 03:08:05,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:05,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:05,345 INFO L213 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-06 03:08:05,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 03:08:05,346 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-06 03:08:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash 736549969, now seen corresponding path program 1 times [2022-12-06 03:08:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:05,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197475372] [2022-12-06 03:08:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:05,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:05,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197475372] [2022-12-06 03:08:05,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197475372] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:05,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297951768] [2022-12-06 03:08:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:05,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:05,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:05,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:05,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:08:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:05,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:05,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:05,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:05,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297951768] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:05,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 03:08:05,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-06 03:08:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763767894] [2022-12-06 03:08:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:05,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:08:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:08:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:08:05,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:08:05,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 1323 transitions, 21938 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:05,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:05,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:08:05,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:07,214 INFO L130 PetriNetUnfolder]: 6640/9290 cut-off events. [2022-12-06 03:08:07,214 INFO L131 PetriNetUnfolder]: For 67767/69538 co-relation queries the response was YES. [2022-12-06 03:08:07,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77864 conditions, 9290 events. 6640/9290 cut-off events. For 67767/69538 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 48996 event pairs, 482 based on Foata normal form. 585/8050 useless extension candidates. Maximal degree in co-relation 75480. Up to 6579 conditions per place. [2022-12-06 03:08:07,318 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 481 selfloop transitions, 33 changer transitions 908/1429 dead transitions. [2022-12-06 03:08:07,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 1429 transitions, 26515 flow [2022-12-06 03:08:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:08:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:08:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 03:08:07,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-06 03:08:07,321 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2022-12-06 03:08:07,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:07,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 1429 transitions, 26515 flow [2022-12-06 03:08:07,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 1429 transitions, 26515 flow [2022-12-06 03:08:07,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 03:08:07,395 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:07,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 03:08:07,397 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 1429 transitions, 26515 flow [2022-12-06 03:08:07,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:07,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:07,397 INFO L213 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-06 03:08:07,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:08:07,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:07,603 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-06 03:08:07,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -359419358, now seen corresponding path program 1 times [2022-12-06 03:08:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:07,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103948393] [2022-12-06 03:08:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:07,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:07,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103948393] [2022-12-06 03:08:07,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103948393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:07,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465783537] [2022-12-06 03:08:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:07,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:07,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:07,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:07,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:08:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:07,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:07,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:07,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465783537] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:07,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 03:08:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 7 [2022-12-06 03:08:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595207433] [2022-12-06 03:08:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:07,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:08:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:07,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:08:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:08:07,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:08:07,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 1429 transitions, 26515 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:07,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:07,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:08:07,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:09,416 INFO L130 PetriNetUnfolder]: 7108/9901 cut-off events. [2022-12-06 03:08:09,416 INFO L131 PetriNetUnfolder]: For 92031/93634 co-relation queries the response was YES. [2022-12-06 03:08:09,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92190 conditions, 9901 events. 7108/9901 cut-off events. For 92031/93634 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 52135 event pairs, 488 based on Foata normal form. 398/8349 useless extension candidates. Maximal degree in co-relation 89557. Up to 7145 conditions per place. [2022-12-06 03:08:09,468 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 545 selfloop transitions, 34 changer transitions 921/1506 dead transitions. [2022-12-06 03:08:09,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 1506 transitions, 30891 flow [2022-12-06 03:08:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:08:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:08:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 03:08:09,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2022-12-06 03:08:09,469 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-06 03:08:09,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:09,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 1506 transitions, 30891 flow [2022-12-06 03:08:09,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 1506 transitions, 30891 flow [2022-12-06 03:08:09,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 03:08:09,540 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:09,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 03:08:09,541 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 1506 transitions, 30891 flow [2022-12-06 03:08:09,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:09,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:09,541 INFO L213 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-06 03:08:09,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:08:09,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 03:08:09,748 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-06 03:08:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1957751141, now seen corresponding path program 2 times [2022-12-06 03:08:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337295535] [2022-12-06 03:08:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:09,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337295535] [2022-12-06 03:08:09,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337295535] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:09,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992316821] [2022-12-06 03:08:09,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:08:09,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:09,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:09,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:09,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:08:09,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:08:09,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:08:09,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:09,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:10,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:10,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992316821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:08:10,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:08:10,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-06 03:08:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884558231] [2022-12-06 03:08:10,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:08:10,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:08:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:10,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:08:10,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:08:10,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:08:10,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 1506 transitions, 30891 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:10,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:10,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:08:10,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:12,052 INFO L130 PetriNetUnfolder]: 8372/11588 cut-off events. [2022-12-06 03:08:12,053 INFO L131 PetriNetUnfolder]: For 131942/134699 co-relation queries the response was YES. [2022-12-06 03:08:12,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119117 conditions, 11588 events. 8372/11588 cut-off events. For 131942/134699 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 61489 event pairs, 560 based on Foata normal form. 1150/10454 useless extension candidates. Maximal degree in co-relation 116235. Up to 8695 conditions per place. [2022-12-06 03:08:12,117 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 669 selfloop transitions, 77 changer transitions 967/1716 dead transitions. [2022-12-06 03:08:12,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 1716 transitions, 38631 flow [2022-12-06 03:08:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:08:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:08:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-06 03:08:12,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 03:08:12,119 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-06 03:08:12,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:12,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 1716 transitions, 38631 flow [2022-12-06 03:08:12,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 1716 transitions, 38631 flow [2022-12-06 03:08:12,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 03:08:12,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:12,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 03:08:12,203 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 1716 transitions, 38631 flow [2022-12-06 03:08:12,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:12,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:12,203 INFO L213 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-06 03:08:12,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 03:08:12,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:12,408 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-06 03:08:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash 494210866, now seen corresponding path program 2 times [2022-12-06 03:08:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:12,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129230124] [2022-12-06 03:08:12,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:12,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:12,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129230124] [2022-12-06 03:08:12,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129230124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:12,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203546519] [2022-12-06 03:08:12,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:08:12,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:12,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:12,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:12,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:08:12,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:08:12,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:08:12,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:12,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:12,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203546519] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:08:12,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:08:12,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 03:08:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105978648] [2022-12-06 03:08:12,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:08:12,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 03:08:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 03:08:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 03:08:12,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:08:12,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 1716 transitions, 38631 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:12,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:12,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:08:12,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:15,436 INFO L130 PetriNetUnfolder]: 9015/12468 cut-off events. [2022-12-06 03:08:15,437 INFO L131 PetriNetUnfolder]: For 161946/165355 co-relation queries the response was YES. [2022-12-06 03:08:15,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139746 conditions, 12468 events. 9015/12468 cut-off events. For 161946/165355 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 66635 event pairs, 578 based on Foata normal form. 1197/11309 useless extension candidates. Maximal degree in co-relation 136260. Up to 8761 conditions per place. [2022-12-06 03:08:15,500 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 730 selfloop transitions, 112 changer transitions 1285/2128 dead transitions. [2022-12-06 03:08:15,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 2128 transitions, 52094 flow [2022-12-06 03:08:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:08:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:08:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2022-12-06 03:08:15,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-06 03:08:15,501 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2022-12-06 03:08:15,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:15,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 2128 transitions, 52094 flow [2022-12-06 03:08:15,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 2128 transitions, 52094 flow [2022-12-06 03:08:15,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 03:08:15,594 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:15,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 03:08:15,595 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 2128 transitions, 52094 flow [2022-12-06 03:08:15,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:15,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:15,596 INFO L213 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-06 03:08:15,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:08:15,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:15,804 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-06 03:08:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1766801691, now seen corresponding path program 3 times [2022-12-06 03:08:15,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:15,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308257695] [2022-12-06 03:08:15,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308257695] [2022-12-06 03:08:15,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308257695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314097313] [2022-12-06 03:08:15,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:08:15,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:15,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:15,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:15,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:08:15,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:08:15,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:08:15,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:15,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:16,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:16,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314097313] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:08:16,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:08:16,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2022-12-06 03:08:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701100117] [2022-12-06 03:08:16,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:08:16,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 03:08:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 03:08:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 03:08:16,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:08:16,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 2128 transitions, 52094 flow. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:16,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:16,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:08:16,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:18,863 INFO L130 PetriNetUnfolder]: 8972/12321 cut-off events. [2022-12-06 03:08:18,864 INFO L131 PetriNetUnfolder]: For 167001/170525 co-relation queries the response was YES. [2022-12-06 03:08:18,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150160 conditions, 12321 events. 8972/12321 cut-off events. For 167001/170525 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 64250 event pairs, 564 based on Foata normal form. 1312/11345 useless extension candidates. Maximal degree in co-relation 146633. Up to 8648 conditions per place. [2022-12-06 03:08:18,934 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 696 selfloop transitions, 159 changer transitions 1245/2101 dead transitions. [2022-12-06 03:08:18,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 2101 transitions, 55500 flow [2022-12-06 03:08:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 03:08:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 03:08:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-12-06 03:08:18,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2022-12-06 03:08:18,936 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-06 03:08:18,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:18,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 2101 transitions, 55500 flow [2022-12-06 03:08:19,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 2101 transitions, 55500 flow [2022-12-06 03:08:19,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 03:08:19,030 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:19,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 03:08:19,031 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 2101 transitions, 55500 flow [2022-12-06 03:08:19,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:19,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:19,031 INFO L213 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-06 03:08:19,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:08:19,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 03:08:19,236 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-06 03:08:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash 156808547, now seen corresponding path program 1 times [2022-12-06 03:08:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:19,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543862004] [2022-12-06 03:08:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:08:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:19,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543862004] [2022-12-06 03:08:19,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543862004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:19,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118135925] [2022-12-06 03:08:19,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:19,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:19,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:19,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:19,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:08:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:19,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:19,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:08:19,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:19,513 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-06 03:08:19,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118135925] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:19,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 03:08:19,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-06 03:08:19,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78750072] [2022-12-06 03:08:19,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:08:19,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:08:19,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:19,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:08:19,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:08:19,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:08:19,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 2101 transitions, 55500 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:19,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:19,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:08:19,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:23,002 INFO L130 PetriNetUnfolder]: 10169/13908 cut-off events. [2022-12-06 03:08:23,002 INFO L131 PetriNetUnfolder]: For 206966/209355 co-relation queries the response was YES. [2022-12-06 03:08:23,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182944 conditions, 13908 events. 10169/13908 cut-off events. For 206966/209355 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 72978 event pairs, 578 based on Foata normal form. 334/11805 useless extension candidates. Maximal degree in co-relation 179090. Up to 10115 conditions per place. [2022-12-06 03:08:23,116 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 1048 selfloop transitions, 71 changer transitions 1245/2387 dead transitions. [2022-12-06 03:08:23,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 2387 transitions, 67710 flow [2022-12-06 03:08:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:08:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:08:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 03:08:23,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-06 03:08:23,117 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-06 03:08:23,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:23,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 2387 transitions, 67710 flow [2022-12-06 03:08:23,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 2387 transitions, 67710 flow [2022-12-06 03:08:23,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 03:08:23,274 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:23,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 03:08:23,275 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 2387 transitions, 67710 flow [2022-12-06 03:08:23,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:23,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:23,275 INFO L213 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-06 03:08:23,283 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-06 03:08:23,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:23,481 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-06 03:08:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1110157561, now seen corresponding path program 2 times [2022-12-06 03:08:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:23,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431233458] [2022-12-06 03:08:23,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:08:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431233458] [2022-12-06 03:08:23,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431233458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001073405] [2022-12-06 03:08:23,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:08:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:23,620 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:23,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:08:23,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:08:23,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:08:23,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:23,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:08:23,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:08:23,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001073405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:08:23,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:08:23,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-06 03:08:23,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884179054] [2022-12-06 03:08:23,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:08:23,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:08:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:08:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:08:23,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:08:23,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 2387 transitions, 67710 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:23,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:23,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:08:23,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:28,928 INFO L130 PetriNetUnfolder]: 13709/18870 cut-off events. [2022-12-06 03:08:28,928 INFO L131 PetriNetUnfolder]: For 266410/268363 co-relation queries the response was YES. [2022-12-06 03:08:28,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266997 conditions, 18870 events. 13709/18870 cut-off events. For 266410/268363 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 104009 event pairs, 636 based on Foata normal form. 428/16261 useless extension candidates. Maximal degree in co-relation 261645. Up to 13539 conditions per place. [2022-12-06 03:08:29,064 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 1528 selfloop transitions, 271 changer transitions 1877/3693 dead transitions. [2022-12-06 03:08:29,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 3693 transitions, 112057 flow [2022-12-06 03:08:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:08:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:08:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-12-06 03:08:29,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5818965517241379 [2022-12-06 03:08:29,080 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 61 predicate places. [2022-12-06 03:08:29,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:29,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 3693 transitions, 112057 flow [2022-12-06 03:08:29,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 3693 transitions, 112057 flow [2022-12-06 03:08:29,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 03:08:29,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:29,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 03:08:29,257 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 3693 transitions, 112057 flow [2022-12-06 03:08:29,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:29,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:29,257 INFO L213 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-06 03:08:29,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 03:08:29,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:29,462 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-06 03:08:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1162157029, now seen corresponding path program 3 times [2022-12-06 03:08:29,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:29,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574763163] [2022-12-06 03:08:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:08:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:29,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574763163] [2022-12-06 03:08:29,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574763163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:29,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650594675] [2022-12-06 03:08:29,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:08:29,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:29,565 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:29,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:08:29,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:08:29,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:08:29,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:08:29,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:29,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:08:29,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650594675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:08:29,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:08:29,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 03:08:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297311519] [2022-12-06 03:08:29,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:08:29,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 03:08:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 03:08:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 03:08:29,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:08:29,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 3693 transitions, 112057 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:29,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:29,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:08:29,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:38,824 INFO L130 PetriNetUnfolder]: 15266/21027 cut-off events. [2022-12-06 03:08:38,825 INFO L131 PetriNetUnfolder]: For 304722/305899 co-relation queries the response was YES. [2022-12-06 03:08:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317766 conditions, 21027 events. 15266/21027 cut-off events. For 304722/305899 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 116027 event pairs, 644 based on Foata normal form. 218/18287 useless extension candidates. Maximal degree in co-relation 311041. Up to 14479 conditions per place. [2022-12-06 03:08:38,977 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 1702 selfloop transitions, 534 changer transitions 2268/4511 dead transitions. [2022-12-06 03:08:38,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 4511 transitions, 145518 flow [2022-12-06 03:08:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:08:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:08:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-06 03:08:38,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-06 03:08:38,978 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 70 predicate places. [2022-12-06 03:08:38,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:38,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 4511 transitions, 145518 flow [2022-12-06 03:08:39,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 4511 transitions, 145518 flow [2022-12-06 03:08:39,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-06 03:08:39,179 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:39,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 03:08:39,180 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 4511 transitions, 145518 flow [2022-12-06 03:08:39,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:39,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:39,180 INFO L213 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-06 03:08:39,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:08:39,384 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,SelfDestructingSolverStorable14 [2022-12-06 03:08:39,385 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 03:08:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1489414968, now seen corresponding path program 1 times [2022-12-06 03:08:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:39,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072423370] [2022-12-06 03:08:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:39,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:39,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072423370] [2022-12-06 03:08:39,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072423370] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:39,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975846206] [2022-12-06 03:08:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:39,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:39,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:39,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:08:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:39,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:08:39,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:39,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:39,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975846206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:08:39,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:08:39,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 4 [2022-12-06 03:08:39,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912344719] [2022-12-06 03:08:39,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:08:39,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:08:39,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:39,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:08:39,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:08:39,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 03:08:39,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 4511 transitions, 145518 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:39,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:39,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 03:08:39,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:08:53,442 INFO L130 PetriNetUnfolder]: 26385/36226 cut-off events. [2022-12-06 03:08:53,442 INFO L131 PetriNetUnfolder]: For 619743/621397 co-relation queries the response was YES. [2022-12-06 03:08:53,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582072 conditions, 36226 events. 26385/36226 cut-off events. For 619743/621397 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 214419 event pairs, 742 based on Foata normal form. 1256/31784 useless extension candidates. Maximal degree in co-relation 572352. Up to 28299 conditions per place. [2022-12-06 03:08:53,759 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 3234 selfloop transitions, 754 changer transitions 2299/6346 dead transitions. [2022-12-06 03:08:53,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 6346 transitions, 217543 flow [2022-12-06 03:08:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:08:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:08:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 03:08:53,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-06 03:08:53,761 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 73 predicate places. [2022-12-06 03:08:53,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:08:53,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 6346 transitions, 217543 flow [2022-12-06 03:08:54,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 6346 transitions, 217543 flow [2022-12-06 03:08:54,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-06 03:08:54,111 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:08:54,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-06 03:08:54,112 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 6346 transitions, 217543 flow [2022-12-06 03:08:54,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:54,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:08:54,112 INFO L213 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-06 03:08:54,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 03:08:54,314 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,SelfDestructingSolverStorable15 [2022-12-06 03:08:54,314 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 03:08:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:08:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1453693960, now seen corresponding path program 2 times [2022-12-06 03:08:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:08:54,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220969480] [2022-12-06 03:08:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:08:54,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:08:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:08:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:08:54,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220969480] [2022-12-06 03:08:54,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220969480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:08:54,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574144670] [2022-12-06 03:08:54,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:08:54,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:08:54,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:54,479 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:08:54,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:08:54,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:08:54,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:08:54,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:08:54,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:08:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:54,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:08:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:08:54,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574144670] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:08:54,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:08:54,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-12-06 03:08:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455148371] [2022-12-06 03:08:54,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:08:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:08:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:08:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:08:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-06 03:08:54,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 03:08:54,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 6346 transitions, 217543 flow. Second operand has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:08:54,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:08:54,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 03:08:54,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:41,367 INFO L130 PetriNetUnfolder]: 53133/71857 cut-off events. [2022-12-06 03:09:41,367 INFO L131 PetriNetUnfolder]: For 1268797/1271615 co-relation queries the response was YES. [2022-12-06 03:09:41,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229831 conditions, 71857 events. 53133/71857 cut-off events. For 1268797/1271615 co-relation queries the response was YES. Maximal size of possible extension queue 3141. Compared 446533 event pairs, 772 based on Foata normal form. 1336/60634 useless extension candidates. Maximal degree in co-relation 1214075. Up to 61219 conditions per place. [2022-12-06 03:09:42,147 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 5831 selfloop transitions, 2629 changer transitions 2342/10831 dead transitions. [2022-12-06 03:09:42,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 10831 transitions, 392557 flow [2022-12-06 03:09:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:09:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:09:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2022-12-06 03:09:42,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7370689655172413 [2022-12-06 03:09:42,155 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2022-12-06 03:09:42,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:42,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 10831 transitions, 392557 flow [2022-12-06 03:09:43,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 10831 transitions, 392557 flow [2022-12-06 03:09:43,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-06 03:09:43,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:43,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1013 [2022-12-06 03:09:43,168 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 10831 transitions, 392557 flow [2022-12-06 03:09:43,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:43,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:43,169 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:43,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:43,375 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,SelfDestructingSolverStorable16 [2022-12-06 03:09:43,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 03:09:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -150755831, now seen corresponding path program 3 times [2022-12-06 03:09:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:43,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441915478] [2022-12-06 03:09:43,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:09:43,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:43,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441915478] [2022-12-06 03:09:43,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441915478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:43,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174764605] [2022-12-06 03:09:43,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:09:43,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:43,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:43,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:43,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:09:43,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:09:43,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:43,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 03:09:43,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:09:43,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:09:43,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174764605] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:43,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:43,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-06 03:09:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900565787] [2022-12-06 03:09:43,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:09:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:43,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:09:43,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:09:43,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 03:09:43,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 10831 transitions, 392557 flow. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:43,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:43,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 03:09:43,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:44,204 INFO L130 PetriNetUnfolder]: 121497/166538 cut-off events. [2022-12-06 03:14:44,205 INFO L131 PetriNetUnfolder]: For 2268434/2273608 co-relation queries the response was YES. [2022-12-06 03:14:44,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045195 conditions, 166538 events. 121497/166538 cut-off events. For 2268434/2273608 co-relation queries the response was YES. Maximal size of possible extension queue 6183. Compared 1158590 event pairs, 716 based on Foata normal form. 1180/136355 useless extension candidates. Maximal degree in co-relation 3002844. Up to 150850 conditions per place. [2022-12-06 03:14:46,274 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 23959 selfloop transitions, 5956 changer transitions 3015/32937 dead transitions. [2022-12-06 03:14:46,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 32937 transitions, 1259197 flow [2022-12-06 03:14:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 03:14:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 03:14:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 707 transitions. [2022-12-06 03:14:46,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48758620689655174 [2022-12-06 03:14:46,281 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 129 predicate places. [2022-12-06 03:14:46,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:46,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 32937 transitions, 1259197 flow [2022-12-06 03:14:49,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 32937 transitions, 1259197 flow [2022-12-06 03:14:49,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 03:14:49,113 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:14:49,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2833 [2022-12-06 03:14:49,114 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 32937 transitions, 1259197 flow [2022-12-06 03:14:49,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:49,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:49,114 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:49,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:14:49,315 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,SelfDestructingSolverStorable17 [2022-12-06 03:14:49,315 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 03:14:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -388211831, now seen corresponding path program 4 times [2022-12-06 03:14:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:49,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514232454] [2022-12-06 03:14:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:14:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514232454] [2022-12-06 03:14:49,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514232454] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218136690] [2022-12-06 03:14:49,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:14:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:49,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:49,551 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:49,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:14:49,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:14:49,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:14:49,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 03:14:49,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:14:49,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:14:49,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218136690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:49,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:49,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-06 03:14:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122605125] [2022-12-06 03:14:49,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:49,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:14:49,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:49,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:14:49,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:14:49,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 03:14:49,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 32937 transitions, 1259197 flow. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:49,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:49,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 03:14:49,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 03:21:39,058 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:21:39,058 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:21:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 03:21:39,209 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 03:21:39,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 03:21:39,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:21:39,421 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (14states, 2/29 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 1170781 conditions, 61578 events (46275/61577 cut-off events. For 1264548/1267658 co-relation queries the response was YES. Maximal size of possible extension queue 7990. Compared 411745 event pairs, 70 based on Foata normal form. 129/56628 useless extension candidates. Maximal degree in co-relation 1169619. Up to 52885 conditions per place.). [2022-12-06 03:21:39,422 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 03:21:39,423 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 03:21:39,423 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 03:21:39,423 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 03:21:39,423 INFO L458 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 2, 1] [2022-12-06 03:21:39,426 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:21:39,426 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:21:39,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:21:39 BasicIcfg [2022-12-06 03:21:39,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:21:39,428 INFO L158 Benchmark]: Toolchain (without parser) took 825062.24ms. Allocated memory was 189.8MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 165.3MB in the beginning and 812.4MB in the end (delta: -647.1MB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-12-06 03:21:39,428 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 165.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:21:39,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.62ms. Allocated memory is still 189.8MB. Free memory was 164.8MB in the beginning and 152.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 03:21:39,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 189.8MB. Free memory was 152.7MB in the beginning and 151.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:21:39,428 INFO L158 Benchmark]: Boogie Preprocessor took 20.60ms. Allocated memory is still 189.8MB. Free memory was 151.2MB in the beginning and 149.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:21:39,428 INFO L158 Benchmark]: RCFGBuilder took 333.96ms. Allocated memory is still 189.8MB. Free memory was 149.6MB in the beginning and 131.7MB in the end (delta: 17.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 03:21:39,428 INFO L158 Benchmark]: TraceAbstraction took 824402.81ms. Allocated memory was 189.8MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 131.2MB in the beginning and 812.4MB in the end (delta: -681.2MB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-12-06 03:21:39,429 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.09ms. Allocated memory is still 189.8MB. Free memory is still 165.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.62ms. Allocated memory is still 189.8MB. Free memory was 164.8MB in the beginning and 152.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 189.8MB. Free memory was 152.7MB in the beginning and 151.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.60ms. Allocated memory is still 189.8MB. Free memory was 151.2MB in the beginning and 149.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 333.96ms. Allocated memory is still 189.8MB. Free memory was 149.6MB in the beginning and 131.7MB in the end (delta: 17.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 824402.81ms. Allocated memory was 189.8MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 131.2MB in the beginning and 812.4MB in the end (delta: -681.2MB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 113 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 29 TransitionsAfterwards, 2520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 41 ConcurrentYvCompositions, 6 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1305, independent: 1298, independent conditional: 1298, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1305, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1305, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1305, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1305, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1305, independent: 1296, independent conditional: 0, independent unconditional: 1296, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1305, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1305, unknown conditional: 0, unknown unconditional: 1305] , Statistics on independence cache: Total cache size (in pairs): 2091, Positive cache size: 2084, Positive conditional cache size: 0, Positive unconditional cache size: 2084, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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, 40 PlacesBefore, 40 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 332 TransitionsBefore, 332 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 624 TransitionsBefore, 624 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 1303 TransitionsBefore, 1303 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 1413 TransitionsBefore, 1413 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 1323 TransitionsBefore, 1323 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 1429 TransitionsBefore, 1429 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 1506 TransitionsBefore, 1506 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 1716 TransitionsBefore, 1716 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 2128 TransitionsBefore, 2128 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 2101 TransitionsBefore, 2101 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 2387 TransitionsBefore, 2387 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 3693 TransitionsBefore, 3693 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 4511 TransitionsBefore, 4511 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 6346 TransitionsBefore, 6346 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 10831 TransitionsBefore, 10831 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 167 PlacesBefore, 167 PlacesAfterwards, 32937 TransitionsBefore, 32937 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (14states, 2/29 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 1170781 conditions, 61578 events (46275/61577 cut-off events. For 1264548/1267658 co-relation queries the response was YES. Maximal size of possible extension queue 7990. Compared 411745 event pairs, 70 based on Foata normal form. 129/56628 useless extension candidates. Maximal degree in co-relation 1169619. Up to 52885 conditions per place.). - TimeoutResultAtElement [Line: 91]: 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 (14states, 2/29 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 1170781 conditions, 61578 events (46275/61577 cut-off events. For 1264548/1267658 co-relation queries the response was YES. Maximal size of possible extension queue 7990. Compared 411745 event pairs, 70 based on Foata normal form. 129/56628 useless extension candidates. Maximal degree in co-relation 1169619. Up to 52885 conditions per place.). - TimeoutResultAtElement [Line: 93]: 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 (14states, 2/29 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 1170781 conditions, 61578 events (46275/61577 cut-off events. For 1264548/1267658 co-relation queries the response was YES. Maximal size of possible extension queue 7990. Compared 411745 event pairs, 70 based on Foata normal form. 129/56628 useless extension candidates. Maximal degree in co-relation 1169619. Up to 52885 conditions per place.). - TimeoutResultAtElement [Line: 94]: 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 (14states, 2/29 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 1170781 conditions, 61578 events (46275/61577 cut-off events. For 1264548/1267658 co-relation queries the response was YES. Maximal size of possible extension queue 7990. Compared 411745 event pairs, 70 based on Foata normal form. 129/56628 useless extension candidates. Maximal degree in co-relation 1169619. Up to 52885 conditions per place.). - TimeoutResultAtElement [Line: 92]: 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 (14states, 2/29 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 1170781 conditions, 61578 events (46275/61577 cut-off events. For 1264548/1267658 co-relation queries the response was YES. Maximal size of possible extension queue 7990. Compared 411745 event pairs, 70 based on Foata normal form. 129/56628 useless extension candidates. Maximal degree in co-relation 1169619. Up to 52885 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 157 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: 824.2s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 807.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1780 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1780 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6497 IncrementalHoareTripleChecker+Invalid, 6619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 99 mSDtfsCounter, 6497 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 697 SyntacticMatches, 25 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1259197occurred in iteration=18, InterpolantAutomatonStates: 147, 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, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 855 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1149 ConstructedInterpolants, 0 QuantifiedInterpolants, 5803 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2734 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 43 InterpolantComputations, 10 PerfectInterpolantSequences, 61/123 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