/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/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:44:18,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:44:18,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:44:18,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:44:18,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:44:18,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:44:18,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:44:18,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:44:18,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:44:18,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:44:18,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:44:18,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:44:18,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:44:18,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:44:18,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:44:18,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:44:18,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:44:18,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:44:18,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:44:18,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:44:18,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:44:18,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:44:18,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:44:18,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:44:18,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:44:18,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:44:18,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:44:18,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:44:18,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:44:18,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:44:18,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:44:18,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:44:18,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:44:18,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:44:18,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:44:18,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:44:18,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:44:18,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:44:18,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:44:18,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:44:18,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:44:18,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:44:18,822 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:44:18,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:44:18,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:44:18,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:44:18,824 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:44:18,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:44:18,825 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:44:18,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:44:18,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:44:18,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:44:18,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:44:18,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:44:18,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:44:18,827 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:44:18,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:44:18,827 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:44:18,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:44:18,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:44:18,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:44:18,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:44:18,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:44:18,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:44:18,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:44:18,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:44:18,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:44:18,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:44:18,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:44:18,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:44:18,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:44:19,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:44:19,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:44:19,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:44:19,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:44:19,192 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:44:19,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-13 03:44:20,216 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:44:20,449 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:44:20,450 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-13 03:44:20,464 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e3c5b46/8e2c23e8095b468db78a4ad9f2e9482a/FLAGe424ee5f3 [2022-12-13 03:44:20,478 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e3c5b46/8e2c23e8095b468db78a4ad9f2e9482a [2022-12-13 03:44:20,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:44:20,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:44:20,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:44:20,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:44:20,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:44:20,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469fc63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20, skipping insertion in model container [2022-12-13 03:44:20,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:44:20,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:44:20,677 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/chl-array-int-subst.wvr.c[2781,2794] [2022-12-13 03:44:20,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:44:20,693 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:44:20,713 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/chl-array-int-subst.wvr.c[2781,2794] [2022-12-13 03:44:20,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:44:20,732 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:44:20,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20 WrapperNode [2022-12-13 03:44:20,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:44:20,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:44:20,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:44:20,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:44:20,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,778 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 281 [2022-12-13 03:44:20,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:44:20,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:44:20,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:44:20,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:44:20,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,812 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:44:20,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:44:20,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:44:20,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:44:20,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (1/1) ... [2022-12-13 03:44:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:44:20,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:44:20,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:44:20,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:44:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:44:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:44:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:44:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:44:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 03:44:20,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 03:44:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 03:44:20,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 03:44:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 03:44:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 03:44:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:44:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 03:44:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:44:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:44:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:44:20,892 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:44:20,984 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:44:20,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:44:21,492 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:44:21,508 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:44:21,508 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 03:44:21,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:44:21 BoogieIcfgContainer [2022-12-13 03:44:21,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:44:21,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:44:21,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:44:21,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:44:21,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:44:20" (1/3) ... [2022-12-13 03:44:21,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3e94e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:44:21, skipping insertion in model container [2022-12-13 03:44:21,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:44:20" (2/3) ... [2022-12-13 03:44:21,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3e94e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:44:21, skipping insertion in model container [2022-12-13 03:44:21,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:44:21" (3/3) ... [2022-12-13 03:44:21,520 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2022-12-13 03:44:21,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:44:21,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:44:21,537 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:44:21,662 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 03:44:21,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 318 transitions, 660 flow [2022-12-13 03:44:21,852 INFO L130 PetriNetUnfolder]: 29/315 cut-off events. [2022-12-13 03:44:21,852 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:44:21,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 315 events. 29/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 510 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-13 03:44:21,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 318 transitions, 660 flow [2022-12-13 03:44:21,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 305 transitions, 628 flow [2022-12-13 03:44:21,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:21,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-13 03:44:21,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 305 transitions, 628 flow [2022-12-13 03:44:22,015 INFO L130 PetriNetUnfolder]: 29/305 cut-off events. [2022-12-13 03:44:22,015 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:44:22,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 305 events. 29/305 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 509 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-13 03:44:22,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-13 03:44:22,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 14784 [2022-12-13 03:44:31,196 INFO L241 LiptonReduction]: Total number of compositions: 269 [2022-12-13 03:44:31,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:44:31,224 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;@523f8e7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:44:31,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:44:31,242 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-13 03:44:31,242 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:44:31,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:31,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:31,244 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 1 more)] === [2022-12-13 03:44:31,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash -33773561, now seen corresponding path program 1 times [2022-12-13 03:44:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:31,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469357333] [2022-12-13 03:44:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:32,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:32,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469357333] [2022-12-13 03:44:32,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469357333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:32,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:32,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:44:32,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419712050] [2022-12-13 03:44:32,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:32,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:44:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:32,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:44:32,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:44:32,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 03:44:32,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 90 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:32,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:32,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 03:44:32,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:33,433 INFO L130 PetriNetUnfolder]: 1997/2838 cut-off events. [2022-12-13 03:44:33,433 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-13 03:44:33,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5910 conditions, 2838 events. 1997/2838 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11942 event pairs, 166 based on Foata normal form. 1/2235 useless extension candidates. Maximal degree in co-relation 2936. Up to 1149 conditions per place. [2022-12-13 03:44:33,446 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 118 selfloop transitions, 14 changer transitions 4/136 dead transitions. [2022-12-13 03:44:33,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 136 transitions, 607 flow [2022-12-13 03:44:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 03:44:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 03:44:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-13 03:44:33,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2022-12-13 03:44:33,460 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-13 03:44:33,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 136 transitions, 607 flow [2022-12-13 03:44:33,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 132 transitions, 585 flow [2022-12-13 03:44:33,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:33,479 INFO L89 Accepts]: Start accepts. Operand has 47 places, 132 transitions, 585 flow [2022-12-13 03:44:33,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:33,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:33,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 132 transitions, 585 flow [2022-12-13 03:44:33,486 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 132 transitions, 585 flow [2022-12-13 03:44:33,486 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:44,549 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:44:44,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11073 [2022-12-13 03:44:44,551 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 129 transitions, 573 flow [2022-12-13 03:44:44,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:44,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:44,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:44,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:44:44,552 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 1 more)] === [2022-12-13 03:44:44,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1804249511, now seen corresponding path program 1 times [2022-12-13 03:44:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:44,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219650799] [2022-12-13 03:44:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219650799] [2022-12-13 03:44:45,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219650799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:45,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:45,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:44:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902691511] [2022-12-13 03:44:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:45,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:44:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:44:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:44:45,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:44:45,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 129 transitions, 573 flow. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:45,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:45,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:44:45,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:45,793 INFO L130 PetriNetUnfolder]: 2007/2873 cut-off events. [2022-12-13 03:44:45,793 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-12-13 03:44:45,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8868 conditions, 2873 events. 2007/2873 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12250 event pairs, 166 based on Foata normal form. 1/2290 useless extension candidates. Maximal degree in co-relation 4476. Up to 1149 conditions per place. [2022-12-13 03:44:45,808 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 140 selfloop transitions, 11 changer transitions 7/158 dead transitions. [2022-12-13 03:44:45,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 158 transitions, 1023 flow [2022-12-13 03:44:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:44:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:44:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 03:44:45,813 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2022-12-13 03:44:45,814 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-13 03:44:45,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 158 transitions, 1023 flow [2022-12-13 03:44:45,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 151 transitions, 972 flow [2022-12-13 03:44:45,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:45,842 INFO L89 Accepts]: Start accepts. Operand has 49 places, 151 transitions, 972 flow [2022-12-13 03:44:45,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:45,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:45,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 151 transitions, 972 flow [2022-12-13 03:44:45,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 151 transitions, 972 flow [2022-12-13 03:44:45,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:45,851 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:44:45,852 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:44:45,853 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 151 transitions, 972 flow [2022-12-13 03:44:45,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:45,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:45,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:45,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:44:45,854 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 1 more)] === [2022-12-13 03:44:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash -254007009, now seen corresponding path program 1 times [2022-12-13 03:44:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:45,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817104726] [2022-12-13 03:44:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:46,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817104726] [2022-12-13 03:44:46,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817104726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:46,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:46,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:44:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103854786] [2022-12-13 03:44:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:46,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:44:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:46,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:44:46,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:44:46,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:44:46,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 151 transitions, 972 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:46,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:46,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:44:46,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:47,413 INFO L130 PetriNetUnfolder]: 3168/4526 cut-off events. [2022-12-13 03:44:47,414 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-13 03:44:47,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18475 conditions, 4526 events. 3168/4526 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20964 event pairs, 193 based on Foata normal form. 1/3590 useless extension candidates. Maximal degree in co-relation 6576. Up to 2910 conditions per place. [2022-12-13 03:44:47,448 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 225 selfloop transitions, 6 changer transitions 4/235 dead transitions. [2022-12-13 03:44:47,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 235 transitions, 1991 flow [2022-12-13 03:44:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:44:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:44:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 03:44:47,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2022-12-13 03:44:47,453 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-13 03:44:47,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 235 transitions, 1991 flow [2022-12-13 03:44:47,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 231 transitions, 1953 flow [2022-12-13 03:44:47,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:47,490 INFO L89 Accepts]: Start accepts. Operand has 53 places, 231 transitions, 1953 flow [2022-12-13 03:44:47,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:47,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:47,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 231 transitions, 1953 flow [2022-12-13 03:44:47,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 231 transitions, 1953 flow [2022-12-13 03:44:47,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:47,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:44:47,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:44:47,499 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 231 transitions, 1953 flow [2022-12-13 03:44:47,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:47,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:47,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:47,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:44:47,500 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 1 more)] === [2022-12-13 03:44:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash -900159463, now seen corresponding path program 2 times [2022-12-13 03:44:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:47,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865123718] [2022-12-13 03:44:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:48,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:48,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865123718] [2022-12-13 03:44:48,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865123718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:48,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:48,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:44:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586103630] [2022-12-13 03:44:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:48,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:44:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:48,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:44:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:44:48,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:44:48,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 231 transitions, 1953 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:48,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:48,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:44:48,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:49,245 INFO L130 PetriNetUnfolder]: 4185/6092 cut-off events. [2022-12-13 03:44:49,246 INFO L131 PetriNetUnfolder]: For 498/498 co-relation queries the response was YES. [2022-12-13 03:44:49,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30966 conditions, 6092 events. 4185/6092 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 30731 event pairs, 220 based on Foata normal form. 2/4994 useless extension candidates. Maximal degree in co-relation 7656. Up to 4399 conditions per place. [2022-12-13 03:44:49,277 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 339 selfloop transitions, 12 changer transitions 14/365 dead transitions. [2022-12-13 03:44:49,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 365 transitions, 3818 flow [2022-12-13 03:44:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:44:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:44:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2022-12-13 03:44:49,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5801282051282052 [2022-12-13 03:44:49,281 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 03:44:49,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 365 transitions, 3818 flow [2022-12-13 03:44:49,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 351 transitions, 3660 flow [2022-12-13 03:44:49,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:49,338 INFO L89 Accepts]: Start accepts. Operand has 60 places, 351 transitions, 3660 flow [2022-12-13 03:44:49,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:49,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:49,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 351 transitions, 3660 flow [2022-12-13 03:44:49,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 351 transitions, 3660 flow [2022-12-13 03:44:49,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:49,351 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:44:49,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 03:44:49,358 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 351 transitions, 3660 flow [2022-12-13 03:44:49,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:49,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:49,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:49,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:44:49,359 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 1 more)] === [2022-12-13 03:44:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash -937204889, now seen corresponding path program 1 times [2022-12-13 03:44:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:49,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911238727] [2022-12-13 03:44:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:49,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:49,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911238727] [2022-12-13 03:44:49,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911238727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:49,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:49,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:44:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016213378] [2022-12-13 03:44:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:49,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:44:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:44:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:44:49,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:44:49,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 351 transitions, 3660 flow. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:49,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:49,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:44:49,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:50,462 INFO L130 PetriNetUnfolder]: 4919/7080 cut-off events. [2022-12-13 03:44:50,463 INFO L131 PetriNetUnfolder]: For 615/615 co-relation queries the response was YES. [2022-12-13 03:44:50,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43089 conditions, 7080 events. 4919/7080 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 35734 event pairs, 377 based on Foata normal form. 1/5787 useless extension candidates. Maximal degree in co-relation 7896. Up to 5602 conditions per place. [2022-12-13 03:44:50,508 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 411 selfloop transitions, 5 changer transitions 9/425 dead transitions. [2022-12-13 03:44:50,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 425 transitions, 5295 flow [2022-12-13 03:44:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:44:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:44:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 03:44:50,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-13 03:44:50,512 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2022-12-13 03:44:50,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 425 transitions, 5295 flow [2022-12-13 03:44:50,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 416 transitions, 5175 flow [2022-12-13 03:44:50,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:50,589 INFO L89 Accepts]: Start accepts. Operand has 63 places, 416 transitions, 5175 flow [2022-12-13 03:44:50,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:50,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:50,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 416 transitions, 5175 flow [2022-12-13 03:44:50,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 416 transitions, 5175 flow [2022-12-13 03:44:50,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:50,602 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:44:50,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 03:44:50,606 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 416 transitions, 5175 flow [2022-12-13 03:44:50,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:50,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:50,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:50,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:44:50,606 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 1 more)] === [2022-12-13 03:44:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1021923035, now seen corresponding path program 1 times [2022-12-13 03:44:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:50,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204886013] [2022-12-13 03:44:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:50,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204886013] [2022-12-13 03:44:50,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204886013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:50,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:50,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:44:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377380057] [2022-12-13 03:44:50,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:50,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:44:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:44:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:44:50,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:44:50,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 416 transitions, 5175 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:50,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:50,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:44:50,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:52,257 INFO L130 PetriNetUnfolder]: 6786/9733 cut-off events. [2022-12-13 03:44:52,257 INFO L131 PetriNetUnfolder]: For 878/878 co-relation queries the response was YES. [2022-12-13 03:44:52,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68993 conditions, 9733 events. 6786/9733 cut-off events. For 878/878 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 50972 event pairs, 655 based on Foata normal form. 2/7846 useless extension candidates. Maximal degree in co-relation 11547. Up to 8556 conditions per place. [2022-12-13 03:44:52,314 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 531 selfloop transitions, 13 changer transitions 18/562 dead transitions. [2022-12-13 03:44:52,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 562 transitions, 8141 flow [2022-12-13 03:44:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:44:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:44:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2022-12-13 03:44:52,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2022-12-13 03:44:52,318 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2022-12-13 03:44:52,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 562 transitions, 8141 flow [2022-12-13 03:44:52,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 544 transitions, 7865 flow [2022-12-13 03:44:52,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:52,419 INFO L89 Accepts]: Start accepts. Operand has 70 places, 544 transitions, 7865 flow [2022-12-13 03:44:52,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:52,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:52,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 544 transitions, 7865 flow [2022-12-13 03:44:52,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 544 transitions, 7865 flow [2022-12-13 03:44:52,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:53,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:44:53,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 844 [2022-12-13 03:44:53,263 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 543 transitions, 7851 flow [2022-12-13 03:44:53,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:53,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:53,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:53,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:44:53,264 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 1 more)] === [2022-12-13 03:44:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash 725382928, now seen corresponding path program 1 times [2022-12-13 03:44:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:53,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708378363] [2022-12-13 03:44:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:53,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708378363] [2022-12-13 03:44:53,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708378363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:53,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:53,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:44:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167916894] [2022-12-13 03:44:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:53,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:44:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:44:53,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:44:53,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 03:44:53,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 543 transitions, 7851 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:53,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:53,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 03:44:53,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:54,311 INFO L130 PetriNetUnfolder]: 3580/5254 cut-off events. [2022-12-13 03:44:54,312 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2022-12-13 03:44:54,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42568 conditions, 5254 events. 3580/5254 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 25819 event pairs, 495 based on Foata normal form. 246/4503 useless extension candidates. Maximal degree in co-relation 8836. Up to 4725 conditions per place. [2022-12-13 03:44:54,349 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 242 selfloop transitions, 5 changer transitions 198/445 dead transitions. [2022-12-13 03:44:54,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 445 transitions, 7327 flow [2022-12-13 03:44:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:44:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:44:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 03:44:54,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-13 03:44:54,351 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-13 03:44:54,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 445 transitions, 7327 flow [2022-12-13 03:44:54,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 247 transitions, 4078 flow [2022-12-13 03:44:54,418 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:54,418 INFO L89 Accepts]: Start accepts. Operand has 56 places, 247 transitions, 4078 flow [2022-12-13 03:44:54,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:54,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:54,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 247 transitions, 4078 flow [2022-12-13 03:44:54,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 247 transitions, 4078 flow [2022-12-13 03:44:54,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:54,429 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:44:54,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:44:54,430 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 247 transitions, 4078 flow [2022-12-13 03:44:54,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:54,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:54,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:54,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:44:54,431 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 1 more)] === [2022-12-13 03:44:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2098555375, now seen corresponding path program 1 times [2022-12-13 03:44:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:54,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040069] [2022-12-13 03:44:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:54,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040069] [2022-12-13 03:44:54,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:54,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:54,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:44:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086409244] [2022-12-13 03:44:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:54,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:44:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:44:54,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:44:54,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 03:44:54,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 247 transitions, 4078 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:54,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:54,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 03:44:54,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:55,447 INFO L130 PetriNetUnfolder]: 4732/6650 cut-off events. [2022-12-13 03:44:55,447 INFO L131 PetriNetUnfolder]: For 498/498 co-relation queries the response was YES. [2022-12-13 03:44:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60453 conditions, 6650 events. 4732/6650 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 31116 event pairs, 648 based on Foata normal form. 1/5200 useless extension candidates. Maximal degree in co-relation 18280. Up to 6651 conditions per place. [2022-12-13 03:44:55,496 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 318 selfloop transitions, 19 changer transitions 29/366 dead transitions. [2022-12-13 03:44:55,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 366 transitions, 6762 flow [2022-12-13 03:44:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:44:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:44:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 03:44:55,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2022-12-13 03:44:55,499 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 03:44:55,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 366 transitions, 6762 flow [2022-12-13 03:44:55,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 337 transitions, 6219 flow [2022-12-13 03:44:55,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:55,581 INFO L89 Accepts]: Start accepts. Operand has 59 places, 337 transitions, 6219 flow [2022-12-13 03:44:55,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:55,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:55,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 337 transitions, 6219 flow [2022-12-13 03:44:55,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 337 transitions, 6219 flow [2022-12-13 03:44:55,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:55,595 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:44:55,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 03:44:55,597 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 337 transitions, 6219 flow [2022-12-13 03:44:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:55,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:55,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:55,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:44:55,598 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 1 more)] === [2022-12-13 03:44:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash -750287580, now seen corresponding path program 1 times [2022-12-13 03:44:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:55,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434041004] [2022-12-13 03:44:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:44:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:55,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434041004] [2022-12-13 03:44:55,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434041004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:55,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:55,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:44:55,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170037198] [2022-12-13 03:44:55,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:55,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:44:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:44:55,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:44:55,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 03:44:55,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 337 transitions, 6219 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:55,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:55,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 03:44:55,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:56,183 INFO L130 PetriNetUnfolder]: 2172/3109 cut-off events. [2022-12-13 03:44:56,184 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-13 03:44:56,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31390 conditions, 3109 events. 2172/3109 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13097 event pairs, 306 based on Foata normal form. 100/2562 useless extension candidates. Maximal degree in co-relation 18540. Up to 3110 conditions per place. [2022-12-13 03:44:56,204 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 150 selfloop transitions, 0 changer transitions 91/241 dead transitions. [2022-12-13 03:44:56,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 241 transitions, 4931 flow [2022-12-13 03:44:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:44:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:44:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 03:44:56,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48026315789473684 [2022-12-13 03:44:56,206 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-13 03:44:56,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 241 transitions, 4931 flow [2022-12-13 03:44:56,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 150 transitions, 3069 flow [2022-12-13 03:44:56,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:56,242 INFO L89 Accepts]: Start accepts. Operand has 56 places, 150 transitions, 3069 flow [2022-12-13 03:44:56,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:56,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:56,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 150 transitions, 3069 flow [2022-12-13 03:44:56,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 150 transitions, 3069 flow [2022-12-13 03:44:56,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:56,251 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:44:56,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:44:56,252 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 150 transitions, 3069 flow [2022-12-13 03:44:56,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:56,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:56,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:56,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:44:56,253 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 1 more)] === [2022-12-13 03:44:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1521690201, now seen corresponding path program 1 times [2022-12-13 03:44:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:56,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308186320] [2022-12-13 03:44:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:56,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:44:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:56,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308186320] [2022-12-13 03:44:56,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308186320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:56,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:56,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:44:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80176054] [2022-12-13 03:44:56,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:56,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:44:56,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:44:56,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:44:56,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:44:56,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 150 transitions, 3069 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:56,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:56,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:44:56,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:57,878 INFO L130 PetriNetUnfolder]: 4907/6883 cut-off events. [2022-12-13 03:44:57,879 INFO L131 PetriNetUnfolder]: For 471/471 co-relation queries the response was YES. [2022-12-13 03:44:57,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76276 conditions, 6883 events. 4907/6883 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 32776 event pairs, 299 based on Foata normal form. 1/5323 useless extension candidates. Maximal degree in co-relation 44726. Up to 6884 conditions per place. [2022-12-13 03:44:57,924 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 299 selfloop transitions, 24 changer transitions 3/326 dead transitions. [2022-12-13 03:44:57,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 326 transitions, 7319 flow [2022-12-13 03:44:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:44:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:44:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2022-12-13 03:44:57,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2022-12-13 03:44:57,926 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2022-12-13 03:44:57,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 326 transitions, 7319 flow [2022-12-13 03:44:57,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 323 transitions, 7247 flow [2022-12-13 03:44:58,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:44:58,003 INFO L89 Accepts]: Start accepts. Operand has 63 places, 323 transitions, 7247 flow [2022-12-13 03:44:58,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:44:58,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:44:58,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 323 transitions, 7247 flow [2022-12-13 03:44:58,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 323 transitions, 7247 flow [2022-12-13 03:44:58,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:44:58,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:44:58,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 572 [2022-12-13 03:44:58,574 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 322 transitions, 7225 flow [2022-12-13 03:44:58,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:58,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:44:58,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:44:58,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:44:58,574 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 1 more)] === [2022-12-13 03:44:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:44:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1147505687, now seen corresponding path program 1 times [2022-12-13 03:44:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:44:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52246433] [2022-12-13 03:44:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:44:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:44:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:44:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:44:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:44:58,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52246433] [2022-12-13 03:44:58,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52246433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:44:58,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:44:58,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:44:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931208722] [2022-12-13 03:44:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:44:58,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:44:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:58,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:44:58,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:44:58,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:44:58,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 322 transitions, 7225 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:44:58,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:58,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:44:58,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:00,652 INFO L130 PetriNetUnfolder]: 5933/8358 cut-off events. [2022-12-13 03:45:00,652 INFO L131 PetriNetUnfolder]: For 504/504 co-relation queries the response was YES. [2022-12-13 03:45:00,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100885 conditions, 8358 events. 5933/8358 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 41526 event pairs, 362 based on Foata normal form. 1/6506 useless extension candidates. Maximal degree in co-relation 69245. Up to 8359 conditions per place. [2022-12-13 03:45:00,726 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 372 selfloop transitions, 35 changer transitions 3/410 dead transitions. [2022-12-13 03:45:00,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 410 transitions, 10017 flow [2022-12-13 03:45:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 03:45:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 03:45:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2022-12-13 03:45:00,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 03:45:00,729 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-13 03:45:00,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 410 transitions, 10017 flow [2022-12-13 03:45:00,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 407 transitions, 9939 flow [2022-12-13 03:45:00,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:00,931 INFO L89 Accepts]: Start accepts. Operand has 71 places, 407 transitions, 9939 flow [2022-12-13 03:45:00,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:00,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:00,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 407 transitions, 9939 flow [2022-12-13 03:45:00,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 407 transitions, 9939 flow [2022-12-13 03:45:00,943 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:00,946 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:00,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 03:45:00,947 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 407 transitions, 9939 flow [2022-12-13 03:45:00,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:00,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:00,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:00,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:45:00,947 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 1 more)] === [2022-12-13 03:45:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1420296297, now seen corresponding path program 2 times [2022-12-13 03:45:00,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:00,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006992567] [2022-12-13 03:45:00,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:00,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:45:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:01,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006992567] [2022-12-13 03:45:01,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006992567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:01,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:01,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:45:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123980281] [2022-12-13 03:45:01,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:01,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:45:01,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:01,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:45:01,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:45:01,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:45:01,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 407 transitions, 9939 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:01,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:01,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:45:01,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:02,828 INFO L130 PetriNetUnfolder]: 6708/9559 cut-off events. [2022-12-13 03:45:02,828 INFO L131 PetriNetUnfolder]: For 601/601 co-relation queries the response was YES. [2022-12-13 03:45:02,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124921 conditions, 9559 events. 6708/9559 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 49563 event pairs, 282 based on Foata normal form. 3/7479 useless extension candidates. Maximal degree in co-relation 90107. Up to 9560 conditions per place. [2022-12-13 03:45:02,890 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 468 selfloop transitions, 31 changer transitions 16/515 dead transitions. [2022-12-13 03:45:02,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 515 transitions, 13615 flow [2022-12-13 03:45:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:45:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:45:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-13 03:45:02,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4945054945054945 [2022-12-13 03:45:02,893 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2022-12-13 03:45:02,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 515 transitions, 13615 flow [2022-12-13 03:45:02,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 499 transitions, 13181 flow [2022-12-13 03:45:02,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:02,995 INFO L89 Accepts]: Start accepts. Operand has 77 places, 499 transitions, 13181 flow [2022-12-13 03:45:03,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:03,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:03,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 499 transitions, 13181 flow [2022-12-13 03:45:03,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 499 transitions, 13181 flow [2022-12-13 03:45:03,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:03,013 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:03,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 03:45:03,013 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 499 transitions, 13181 flow [2022-12-13 03:45:03,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:03,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:03,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:03,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 03:45:03,014 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 1 more)] === [2022-12-13 03:45:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 684551319, now seen corresponding path program 3 times [2022-12-13 03:45:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:03,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550486200] [2022-12-13 03:45:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:45:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:03,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550486200] [2022-12-13 03:45:03,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550486200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:03,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:03,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:45:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245802377] [2022-12-13 03:45:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:03,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:45:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:03,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:45:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:45:03,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:45:03,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 499 transitions, 13181 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:03,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:03,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:45:03,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:05,065 INFO L130 PetriNetUnfolder]: 6274/9115 cut-off events. [2022-12-13 03:45:05,065 INFO L131 PetriNetUnfolder]: For 584/584 co-relation queries the response was YES. [2022-12-13 03:45:05,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128256 conditions, 9115 events. 6274/9115 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 48994 event pairs, 234 based on Foata normal form. 3/7459 useless extension candidates. Maximal degree in co-relation 91215. Up to 9116 conditions per place. [2022-12-13 03:45:05,126 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 527 selfloop transitions, 27 changer transitions 27/581 dead transitions. [2022-12-13 03:45:05,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 581 transitions, 16505 flow [2022-12-13 03:45:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:45:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:45:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2022-12-13 03:45:05,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4908424908424908 [2022-12-13 03:45:05,128 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 45 predicate places. [2022-12-13 03:45:05,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 581 transitions, 16505 flow [2022-12-13 03:45:05,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 554 transitions, 15722 flow [2022-12-13 03:45:05,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:05,216 INFO L89 Accepts]: Start accepts. Operand has 83 places, 554 transitions, 15722 flow [2022-12-13 03:45:05,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:05,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:05,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 554 transitions, 15722 flow [2022-12-13 03:45:05,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 554 transitions, 15722 flow [2022-12-13 03:45:05,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:05,233 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:05,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 03:45:05,233 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 554 transitions, 15722 flow [2022-12-13 03:45:05,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:05,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:05,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:05,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 03:45:05,234 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 1 more)] === [2022-12-13 03:45:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1341647327, now seen corresponding path program 1 times [2022-12-13 03:45:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:05,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435025770] [2022-12-13 03:45:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:45:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:05,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435025770] [2022-12-13 03:45:05,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435025770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:05,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:05,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:45:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398615809] [2022-12-13 03:45:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:05,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:45:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:45:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:45:05,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:45:05,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 554 transitions, 15722 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:05,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:05,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:45:05,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:07,007 INFO L130 PetriNetUnfolder]: 6740/9636 cut-off events. [2022-12-13 03:45:07,008 INFO L131 PetriNetUnfolder]: For 606/606 co-relation queries the response was YES. [2022-12-13 03:45:07,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145235 conditions, 9636 events. 6740/9636 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 50071 event pairs, 322 based on Foata normal form. 0/7973 useless extension candidates. Maximal degree in co-relation 83036. Up to 9637 conditions per place. [2022-12-13 03:45:07,088 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 585 selfloop transitions, 9 changer transitions 0/594 dead transitions. [2022-12-13 03:45:07,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 594 transitions, 18045 flow [2022-12-13 03:45:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:45:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:45:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-13 03:45:07,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 03:45:07,090 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2022-12-13 03:45:07,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 594 transitions, 18045 flow [2022-12-13 03:45:07,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 594 transitions, 18045 flow [2022-12-13 03:45:07,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:07,244 INFO L89 Accepts]: Start accepts. Operand has 87 places, 594 transitions, 18045 flow [2022-12-13 03:45:07,248 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:07,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:07,248 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 594 transitions, 18045 flow [2022-12-13 03:45:07,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 594 transitions, 18045 flow [2022-12-13 03:45:07,257 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:07,260 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:07,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 03:45:07,261 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 594 transitions, 18045 flow [2022-12-13 03:45:07,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:07,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:07,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:07,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 03:45:07,261 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 1 more)] === [2022-12-13 03:45:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:07,262 INFO L85 PathProgramCache]: Analyzing trace with hash -685519196, now seen corresponding path program 1 times [2022-12-13 03:45:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:07,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948084306] [2022-12-13 03:45:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:07,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948084306] [2022-12-13 03:45:07,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948084306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:07,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:07,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:45:07,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059146076] [2022-12-13 03:45:07,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:07,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:45:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:07,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:45:07,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:45:07,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 03:45:07,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 594 transitions, 18045 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:07,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:07,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 03:45:07,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:09,149 INFO L130 PetriNetUnfolder]: 6474/9240 cut-off events. [2022-12-13 03:45:09,149 INFO L131 PetriNetUnfolder]: For 561/561 co-relation queries the response was YES. [2022-12-13 03:45:09,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148491 conditions, 9240 events. 6474/9240 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 47578 event pairs, 288 based on Foata normal form. 26/7661 useless extension candidates. Maximal degree in co-relation 88552. Up to 9241 conditions per place. [2022-12-13 03:45:09,236 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 517 selfloop transitions, 0 changer transitions 45/562 dead transitions. [2022-12-13 03:45:09,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 562 transitions, 18188 flow [2022-12-13 03:45:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:45:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:45:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-13 03:45:09,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 03:45:09,237 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 52 predicate places. [2022-12-13 03:45:09,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 562 transitions, 18188 flow [2022-12-13 03:45:09,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 517 transitions, 16727 flow [2022-12-13 03:45:09,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:09,500 INFO L89 Accepts]: Start accepts. Operand has 83 places, 517 transitions, 16727 flow [2022-12-13 03:45:09,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:09,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:09,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 517 transitions, 16727 flow [2022-12-13 03:45:09,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 517 transitions, 16727 flow [2022-12-13 03:45:09,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:09,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:09,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:45:09,515 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 517 transitions, 16727 flow [2022-12-13 03:45:09,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:09,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:09,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:09,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 03:45:09,515 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 1 more)] === [2022-12-13 03:45:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1303885041, now seen corresponding path program 1 times [2022-12-13 03:45:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:09,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752669470] [2022-12-13 03:45:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:10,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752669470] [2022-12-13 03:45:10,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752669470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:10,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904650892] [2022-12-13 03:45:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:10,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:10,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:10,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:45:10,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 03:45:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:10,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 03:45:10,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:45:10,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 03:45:10,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:45:10,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:45:10,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:45:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:11,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:45:12,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:45:12,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 69 [2022-12-13 03:45:12,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:45:12,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18925 treesize of output 17934 [2022-12-13 03:45:12,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:45:12,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 17901 treesize of output 15877 [2022-12-13 03:45:12,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:45:12,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15853 treesize of output 14853 [2022-12-13 03:45:13,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:45:13,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14829 treesize of output 14341 [2022-12-13 03:45:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:26,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904650892] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:45:26,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:45:26,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 39 [2022-12-13 03:45:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017999205] [2022-12-13 03:45:26,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:45:26,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 03:45:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 03:45:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1290, Unknown=29, NotChecked=0, Total=1482 [2022-12-13 03:45:26,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:45:26,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 517 transitions, 16727 flow. Second operand has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:26,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:26,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:45:26,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:34,186 INFO L130 PetriNetUnfolder]: 11916/17176 cut-off events. [2022-12-13 03:45:34,186 INFO L131 PetriNetUnfolder]: For 1256/1256 co-relation queries the response was YES. [2022-12-13 03:45:34,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293333 conditions, 17176 events. 11916/17176 cut-off events. For 1256/1256 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 97119 event pairs, 597 based on Foata normal form. 0/13643 useless extension candidates. Maximal degree in co-relation 187588. Up to 17177 conditions per place. [2022-12-13 03:45:34,324 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 943 selfloop transitions, 125 changer transitions 0/1068 dead transitions. [2022-12-13 03:45:34,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 1068 transitions, 36816 flow [2022-12-13 03:45:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 03:45:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 03:45:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 538 transitions. [2022-12-13 03:45:34,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41544401544401544 [2022-12-13 03:45:34,327 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2022-12-13 03:45:34,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 1068 transitions, 36816 flow [2022-12-13 03:45:34,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 1068 transitions, 36816 flow [2022-12-13 03:45:34,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:34,742 INFO L89 Accepts]: Start accepts. Operand has 117 places, 1068 transitions, 36816 flow [2022-12-13 03:45:34,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:34,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:34,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 1068 transitions, 36816 flow [2022-12-13 03:45:34,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 1068 transitions, 36816 flow [2022-12-13 03:45:34,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:34,783 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:34,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 03:45:34,784 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 1068 transitions, 36816 flow [2022-12-13 03:45:34,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:34,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:34,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:34,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 03:45:34,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 03:45:34,990 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 1 more)] === [2022-12-13 03:45:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash -847110303, now seen corresponding path program 2 times [2022-12-13 03:45:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:34,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093627650] [2022-12-13 03:45:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:35,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:35,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093627650] [2022-12-13 03:45:35,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093627650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:35,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795540791] [2022-12-13 03:45:35,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 03:45:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:35,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:35,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:45:35,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 03:45:35,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:45:35,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:45:35,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 03:45:35,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:45:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:36,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:45:36,735 INFO L321 Elim1Store]: treesize reduction 22, result has 71.8 percent of original size [2022-12-13 03:45:36,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 64 [2022-12-13 03:45:36,834 INFO L321 Elim1Store]: treesize reduction 45, result has 64.0 percent of original size [2022-12-13 03:45:36,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 101 [2022-12-13 03:45:36,920 INFO L321 Elim1Store]: treesize reduction 74, result has 5.1 percent of original size [2022-12-13 03:45:36,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 13 [2022-12-13 03:45:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:37,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795540791] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:45:37,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:45:37,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2022-12-13 03:45:37,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374997852] [2022-12-13 03:45:37,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:45:37,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 03:45:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 03:45:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 03:45:37,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:45:37,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 1068 transitions, 36816 flow. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:37,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:37,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:45:37,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:43,398 INFO L130 PetriNetUnfolder]: 12532/18086 cut-off events. [2022-12-13 03:45:43,398 INFO L131 PetriNetUnfolder]: For 1355/1355 co-relation queries the response was YES. [2022-12-13 03:45:43,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326936 conditions, 18086 events. 12532/18086 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 103254 event pairs, 611 based on Foata normal form. 0/14317 useless extension candidates. Maximal degree in co-relation 214266. Up to 18087 conditions per place. [2022-12-13 03:45:43,545 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 1110 selfloop transitions, 124 changer transitions 0/1234 dead transitions. [2022-12-13 03:45:43,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1234 transitions, 45012 flow [2022-12-13 03:45:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 03:45:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 03:45:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 286 transitions. [2022-12-13 03:45:43,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.406827880512091 [2022-12-13 03:45:43,552 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 97 predicate places. [2022-12-13 03:45:43,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 1234 transitions, 45012 flow [2022-12-13 03:45:43,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 1234 transitions, 45012 flow [2022-12-13 03:45:43,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:43,796 INFO L89 Accepts]: Start accepts. Operand has 135 places, 1234 transitions, 45012 flow [2022-12-13 03:45:43,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:43,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:43,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 1234 transitions, 45012 flow [2022-12-13 03:45:43,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 1234 transitions, 45012 flow [2022-12-13 03:45:43,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:43,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:43,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 03:45:43,857 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 1234 transitions, 45012 flow [2022-12-13 03:45:43,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:43,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:43,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:43,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 03:45:44,063 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,SelfDestructingSolverStorable16 [2022-12-13 03:45:44,063 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 1 more)] === [2022-12-13 03:45:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 563878597, now seen corresponding path program 3 times [2022-12-13 03:45:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:44,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820531816] [2022-12-13 03:45:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820531816] [2022-12-13 03:45:44,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820531816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425846247] [2022-12-13 03:45:44,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 03:45:44,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:44,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:45:44,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 03:45:45,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 03:45:45,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:45:45,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 03:45:45,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:45:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:45,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:45:45,980 INFO L321 Elim1Store]: treesize reduction 22, result has 71.8 percent of original size [2022-12-13 03:45:45,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 64 [2022-12-13 03:45:46,055 INFO L321 Elim1Store]: treesize reduction 45, result has 64.0 percent of original size [2022-12-13 03:45:46,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 101 [2022-12-13 03:45:46,122 INFO L321 Elim1Store]: treesize reduction 74, result has 5.1 percent of original size [2022-12-13 03:45:46,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 13 [2022-12-13 03:45:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:46,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425846247] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:45:46,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:45:46,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2022-12-13 03:45:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394303379] [2022-12-13 03:45:46,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:45:46,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 03:45:46,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 03:45:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 03:45:46,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:45:46,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 1234 transitions, 45012 flow. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:46,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:46,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:45:46,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:53,324 INFO L130 PetriNetUnfolder]: 12499/17992 cut-off events. [2022-12-13 03:45:53,324 INFO L131 PetriNetUnfolder]: For 1325/1325 co-relation queries the response was YES. [2022-12-13 03:45:53,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343223 conditions, 17992 events. 12499/17992 cut-off events. For 1325/1325 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 102216 event pairs, 571 based on Foata normal form. 0/14319 useless extension candidates. Maximal degree in co-relation 224556. Up to 17993 conditions per place. [2022-12-13 03:45:53,466 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 1137 selfloop transitions, 131 changer transitions 0/1268 dead transitions. [2022-12-13 03:45:53,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1268 transitions, 48778 flow [2022-12-13 03:45:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 03:45:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 03:45:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 306 transitions. [2022-12-13 03:45:53,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4352773826458037 [2022-12-13 03:45:53,468 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2022-12-13 03:45:53,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 1268 transitions, 48778 flow [2022-12-13 03:45:53,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 1268 transitions, 48778 flow [2022-12-13 03:45:53,730 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:53,730 INFO L89 Accepts]: Start accepts. Operand has 153 places, 1268 transitions, 48778 flow [2022-12-13 03:45:53,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:53,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:53,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 1268 transitions, 48778 flow [2022-12-13 03:45:53,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 1268 transitions, 48778 flow [2022-12-13 03:45:53,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:45:53,777 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:53,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 03:45:53,778 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 1268 transitions, 48778 flow [2022-12-13 03:45:53,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:53,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:53,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:53,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 03:45:53,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 03:45:53,988 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 1 more)] === [2022-12-13 03:45:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash 436090821, now seen corresponding path program 4 times [2022-12-13 03:45:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932966962] [2022-12-13 03:45:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:53,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:54,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932966962] [2022-12-13 03:45:54,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932966962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:54,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480951920] [2022-12-13 03:45:54,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 03:45:54,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:54,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:45:54,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 03:45:54,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 03:45:54,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:45:54,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 03:45:54,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:45:54,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 03:45:54,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:45:55,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:45:55,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:45:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:55,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:45:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:55,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480951920] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:45:55,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:45:55,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 34 [2022-12-13 03:45:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61105841] [2022-12-13 03:45:55,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:45:55,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 03:45:55,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 03:45:55,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 03:45:55,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:45:55,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 1268 transitions, 48778 flow. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:55,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:55,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:45:55,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:09,513 INFO L130 PetriNetUnfolder]: 21349/31139 cut-off events. [2022-12-13 03:46:09,513 INFO L131 PetriNetUnfolder]: For 2555/2555 co-relation queries the response was YES. [2022-12-13 03:46:09,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625232 conditions, 31139 events. 21349/31139 cut-off events. For 2555/2555 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 196002 event pairs, 606 based on Foata normal form. 0/25285 useless extension candidates. Maximal degree in co-relation 312916. Up to 31140 conditions per place. [2022-12-13 03:46:09,893 INFO L137 encePairwiseOnDemand]: 20/37 looper letters, 2510 selfloop transitions, 387 changer transitions 0/2897 dead transitions. [2022-12-13 03:46:09,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2897 transitions, 117275 flow [2022-12-13 03:46:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 03:46:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 03:46:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 624 transitions. [2022-12-13 03:46:09,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48185328185328186 [2022-12-13 03:46:09,896 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 147 predicate places. [2022-12-13 03:46:09,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 2897 transitions, 117275 flow [2022-12-13 03:46:10,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 2897 transitions, 117275 flow [2022-12-13 03:46:10,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:10,348 INFO L89 Accepts]: Start accepts. Operand has 185 places, 2897 transitions, 117275 flow [2022-12-13 03:46:10,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:10,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:10,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 2897 transitions, 117275 flow [2022-12-13 03:46:10,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 2897 transitions, 117275 flow [2022-12-13 03:46:10,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:10,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:10,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 03:46:10,446 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 2897 transitions, 117275 flow [2022-12-13 03:46:10,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:46:10,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:10,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:10,451 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-13 03:46:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:10,647 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:46:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 505915053, now seen corresponding path program 5 times [2022-12-13 03:46:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:10,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049023965] [2022-12-13 03:46:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049023965] [2022-12-13 03:46:11,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049023965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:46:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929534362] [2022-12-13 03:46:11,398 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 03:46:11,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:46:11,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:46:11,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 03:46:11,528 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:46:11,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:46:11,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 03:46:11,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:46:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:11,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:46:12,459 INFO L321 Elim1Store]: treesize reduction 28, result has 85.0 percent of original size [2022-12-13 03:46:12,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 190 [2022-12-13 03:46:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:12,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929534362] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:46:12,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:46:12,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2022-12-13 03:46:12,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504894973] [2022-12-13 03:46:12,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:46:12,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 03:46:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:12,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 03:46:12,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2022-12-13 03:46:12,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:46:12,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 2897 transitions, 117275 flow. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:46:12,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:12,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:46:12,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:32,702 INFO L130 PetriNetUnfolder]: 21419/31313 cut-off events. [2022-12-13 03:46:32,702 INFO L131 PetriNetUnfolder]: For 2587/2587 co-relation queries the response was YES. [2022-12-13 03:46:32,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660048 conditions, 31313 events. 21419/31313 cut-off events. For 2587/2587 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 198030 event pairs, 596 based on Foata normal form. 0/25455 useless extension candidates. Maximal degree in co-relation 331836. Up to 31314 conditions per place. [2022-12-13 03:46:32,968 INFO L137 encePairwiseOnDemand]: 19/37 looper letters, 2691 selfloop transitions, 262 changer transitions 0/2953 dead transitions. [2022-12-13 03:46:32,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 2953 transitions, 125463 flow [2022-12-13 03:46:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 03:46:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 03:46:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 474 transitions. [2022-12-13 03:46:32,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4575289575289575 [2022-12-13 03:46:32,970 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 174 predicate places. [2022-12-13 03:46:32,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 2953 transitions, 125463 flow [2022-12-13 03:46:33,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 2953 transitions, 125463 flow [2022-12-13 03:46:33,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:33,461 INFO L89 Accepts]: Start accepts. Operand has 212 places, 2953 transitions, 125463 flow [2022-12-13 03:46:33,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:33,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:33,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 2953 transitions, 125463 flow [2022-12-13 03:46:33,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 2953 transitions, 125463 flow [2022-12-13 03:46:33,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:33,559 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:33,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 03:46:33,559 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 2953 transitions, 125463 flow [2022-12-13 03:46:33,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 32 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:46:33,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:33,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:33,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 03:46:33,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:33,761 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:46:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:33,761 INFO L85 PathProgramCache]: Analyzing trace with hash 653362893, now seen corresponding path program 6 times [2022-12-13 03:46:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:33,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600543526] [2022-12-13 03:46:33,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:33,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600543526] [2022-12-13 03:46:34,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600543526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:46:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592281053] [2022-12-13 03:46:34,492 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 03:46:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:34,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:46:34,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:46:34,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 03:46:34,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 03:46:34,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:46:34,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 03:46:34,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:46:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:35,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:46:35,485 INFO L321 Elim1Store]: treesize reduction 22, result has 71.8 percent of original size [2022-12-13 03:46:35,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 64 [2022-12-13 03:46:35,572 INFO L321 Elim1Store]: treesize reduction 45, result has 64.0 percent of original size [2022-12-13 03:46:35,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 101 [2022-12-13 03:46:35,627 INFO L321 Elim1Store]: treesize reduction 74, result has 5.1 percent of original size [2022-12-13 03:46:35,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 13 [2022-12-13 03:46:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:35,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592281053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:46:35,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:46:35,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2022-12-13 03:46:35,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747230444] [2022-12-13 03:46:35,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:46:35,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 03:46:35,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 03:46:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 03:46:35,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:46:35,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 2953 transitions, 125463 flow. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:46:35,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:35,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:46:35,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:55,394 INFO L130 PetriNetUnfolder]: 21971/32109 cut-off events. [2022-12-13 03:46:55,394 INFO L131 PetriNetUnfolder]: For 2688/2688 co-relation queries the response was YES. [2022-12-13 03:46:55,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708912 conditions, 32109 events. 21971/32109 cut-off events. For 2688/2688 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 203667 event pairs, 570 based on Foata normal form. 0/26115 useless extension candidates. Maximal degree in co-relation 347586. Up to 32110 conditions per place. [2022-12-13 03:46:55,686 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 2920 selfloop transitions, 151 changer transitions 0/3071 dead transitions. [2022-12-13 03:46:55,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 3071 transitions, 136621 flow [2022-12-13 03:46:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 03:46:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 03:46:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 296 transitions. [2022-12-13 03:46:55,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-13 03:46:55,688 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 192 predicate places. [2022-12-13 03:46:55,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 3071 transitions, 136621 flow [2022-12-13 03:46:55,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 3071 transitions, 136621 flow [2022-12-13 03:46:56,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:56,310 INFO L89 Accepts]: Start accepts. Operand has 230 places, 3071 transitions, 136621 flow [2022-12-13 03:46:56,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:56,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:56,335 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 3071 transitions, 136621 flow [2022-12-13 03:46:56,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 3071 transitions, 136621 flow [2022-12-13 03:46:56,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:56,401 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:56,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 03:46:56,402 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 3071 transitions, 136621 flow [2022-12-13 03:46:56,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:46:56,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:56,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:56,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 03:46:56,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:56,604 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:46:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1729103419, now seen corresponding path program 7 times [2022-12-13 03:46:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:56,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96126841] [2022-12-13 03:46:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:57,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96126841] [2022-12-13 03:46:57,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96126841] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:46:57,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720395098] [2022-12-13 03:46:57,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 03:46:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:46:57,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:46:57,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 03:46:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:57,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 03:46:57,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:46:57,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 03:46:57,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:46:57,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:46:57,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:46:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:57,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:46:58,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:46:58,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 69 [2022-12-13 03:46:58,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:46:58,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37869 treesize of output 35854 [2022-12-13 03:46:58,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:46:58,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35821 treesize of output 34821 [2022-12-13 03:46:58,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:46:58,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34797 treesize of output 30725 [2022-12-13 03:46:59,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:46:59,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30701 treesize of output 28677 [2022-12-13 03:47:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:22,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720395098] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:47:22,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:47:22,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 39 [2022-12-13 03:47:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363260911] [2022-12-13 03:47:22,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:47:22,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 03:47:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 03:47:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1302, Unknown=24, NotChecked=0, Total=1482 [2022-12-13 03:47:22,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:47:22,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 3071 transitions, 136621 flow. Second operand has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:47:22,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:22,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:47:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:47:47,363 INFO L130 PetriNetUnfolder]: 24706/36141 cut-off events. [2022-12-13 03:47:47,364 INFO L131 PetriNetUnfolder]: For 3103/3103 co-relation queries the response was YES. [2022-12-13 03:47:47,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833968 conditions, 36141 events. 24706/36141 cut-off events. For 3103/3103 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 233443 event pairs, 494 based on Foata normal form. 0/28999 useless extension candidates. Maximal degree in co-relation 436632. Up to 36142 conditions per place. [2022-12-13 03:47:47,791 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 3388 selfloop transitions, 267 changer transitions 0/3655 dead transitions. [2022-12-13 03:47:47,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 3655 transitions, 169951 flow [2022-12-13 03:47:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 03:47:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 03:47:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 280 transitions. [2022-12-13 03:47:47,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39829302987197723 [2022-12-13 03:47:47,793 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 210 predicate places. [2022-12-13 03:47:47,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 3655 transitions, 169951 flow [2022-12-13 03:47:48,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 3655 transitions, 169951 flow [2022-12-13 03:47:48,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:47:48,481 INFO L89 Accepts]: Start accepts. Operand has 248 places, 3655 transitions, 169951 flow [2022-12-13 03:47:48,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:47:48,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:47:48,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 3655 transitions, 169951 flow [2022-12-13 03:47:48,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 3655 transitions, 169951 flow [2022-12-13 03:47:48,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:47:48,610 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:47:48,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 03:47:48,611 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 3655 transitions, 169951 flow [2022-12-13 03:47:48,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:47:48,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:47:48,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:47:48,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 03:47:48,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:47:48,812 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:47:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:47:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash 210220421, now seen corresponding path program 8 times [2022-12-13 03:47:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:47:48,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527322690] [2022-12-13 03:47:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:47:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:47:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:47:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:47:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527322690] [2022-12-13 03:47:49,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527322690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:47:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303227706] [2022-12-13 03:47:49,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 03:47:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:47:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:47:49,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:47:49,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 03:47:49,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:47:49,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:47:49,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 03:47:49,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:47:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:49,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:47:50,413 INFO L321 Elim1Store]: treesize reduction 22, result has 71.8 percent of original size [2022-12-13 03:47:50,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 64 [2022-12-13 03:47:50,485 INFO L321 Elim1Store]: treesize reduction 45, result has 64.0 percent of original size [2022-12-13 03:47:50,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 101 [2022-12-13 03:47:50,543 INFO L321 Elim1Store]: treesize reduction 74, result has 5.1 percent of original size [2022-12-13 03:47:50,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 13 [2022-12-13 03:47:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:50,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303227706] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:47:50,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:47:50,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2022-12-13 03:47:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645915078] [2022-12-13 03:47:50,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:47:50,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 03:47:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 03:47:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 03:47:50,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:47:50,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 3655 transitions, 169951 flow. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:47:50,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:50,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:47:50,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:48:22,747 INFO L130 PetriNetUnfolder]: 24728/36179 cut-off events. [2022-12-13 03:48:22,748 INFO L131 PetriNetUnfolder]: For 3092/3092 co-relation queries the response was YES. [2022-12-13 03:48:22,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871024 conditions, 36179 events. 24728/36179 cut-off events. For 3092/3092 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 233754 event pairs, 494 based on Foata normal form. 0/29033 useless extension candidates. Maximal degree in co-relation 456476. Up to 36180 conditions per place. [2022-12-13 03:48:23,138 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 3417 selfloop transitions, 252 changer transitions 0/3669 dead transitions. [2022-12-13 03:48:23,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 3669 transitions, 177939 flow [2022-12-13 03:48:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 03:48:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 03:48:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2022-12-13 03:48:23,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4096728307254623 [2022-12-13 03:48:23,139 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 228 predicate places. [2022-12-13 03:48:23,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 3669 transitions, 177939 flow [2022-12-13 03:48:23,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 3669 transitions, 177939 flow [2022-12-13 03:48:23,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:48:23,741 INFO L89 Accepts]: Start accepts. Operand has 266 places, 3669 transitions, 177939 flow [2022-12-13 03:48:23,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:48:23,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:48:23,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 3669 transitions, 177939 flow [2022-12-13 03:48:23,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 3669 transitions, 177939 flow [2022-12-13 03:48:23,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:48:23,917 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:48:23,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 03:48:23,918 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 3669 transitions, 177939 flow [2022-12-13 03:48:23,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:48:23,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:48:23,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:48:23,924 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-13 03:48:24,119 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,SelfDestructingSolverStorable22 [2022-12-13 03:48:24,119 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:48:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:48:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1563245777, now seen corresponding path program 9 times [2022-12-13 03:48:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:48:24,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238647497] [2022-12-13 03:48:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:48:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:48:24,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238647497] [2022-12-13 03:48:24,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238647497] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:48:24,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192903675] [2022-12-13 03:48:24,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 03:48:24,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:48:24,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:48:24,819 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:48:24,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 03:48:25,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 03:48:25,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:48:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 03:48:25,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:48:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:25,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:48:25,915 INFO L321 Elim1Store]: treesize reduction 22, result has 71.8 percent of original size [2022-12-13 03:48:25,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 64 [2022-12-13 03:48:26,005 INFO L321 Elim1Store]: treesize reduction 45, result has 64.0 percent of original size [2022-12-13 03:48:26,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 101 [2022-12-13 03:48:26,063 INFO L321 Elim1Store]: treesize reduction 74, result has 5.1 percent of original size [2022-12-13 03:48:26,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 13 [2022-12-13 03:48:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:26,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192903675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:48:26,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:48:26,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2022-12-13 03:48:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020102255] [2022-12-13 03:48:26,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:48:26,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 03:48:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:48:26,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 03:48:26,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 03:48:26,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:48:26,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 3669 transitions, 177939 flow. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:48:26,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:48:26,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:48:26,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:48:57,040 INFO L130 PetriNetUnfolder]: 24712/36163 cut-off events. [2022-12-13 03:48:57,040 INFO L131 PetriNetUnfolder]: For 3102/3102 co-relation queries the response was YES. [2022-12-13 03:48:57,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906804 conditions, 36163 events. 24712/36163 cut-off events. For 3102/3102 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 233676 event pairs, 458 based on Foata normal form. 0/29033 useless extension candidates. Maximal degree in co-relation 475044. Up to 36164 conditions per place. [2022-12-13 03:48:57,414 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 3411 selfloop transitions, 256 changer transitions 0/3667 dead transitions. [2022-12-13 03:48:57,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 3667 transitions, 185177 flow [2022-12-13 03:48:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 03:48:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 03:48:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 274 transitions. [2022-12-13 03:48:57,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38975817923186346 [2022-12-13 03:48:57,415 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 246 predicate places. [2022-12-13 03:48:57,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 3667 transitions, 185177 flow [2022-12-13 03:48:57,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 3667 transitions, 185177 flow [2022-12-13 03:48:58,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:48:58,202 INFO L89 Accepts]: Start accepts. Operand has 284 places, 3667 transitions, 185177 flow [2022-12-13 03:48:58,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:48:58,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:48:58,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 3667 transitions, 185177 flow [2022-12-13 03:48:58,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 3667 transitions, 185177 flow [2022-12-13 03:48:58,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:48:58,340 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:48:58,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 03:48:58,340 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 3667 transitions, 185177 flow [2022-12-13 03:48:58,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:48:58,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:48:58,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:48:58,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 03:48:58,541 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,SelfDestructingSolverStorable23 [2022-12-13 03:48:58,542 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:48:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:48:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1396331297, now seen corresponding path program 10 times [2022-12-13 03:48:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:48:58,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139471809] [2022-12-13 03:48:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:48:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:59,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:48:59,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139471809] [2022-12-13 03:48:59,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139471809] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:48:59,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387362060] [2022-12-13 03:48:59,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 03:48:59,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:48:59,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:48:59,150 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:48:59,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 03:48:59,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 03:48:59,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:48:59,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 03:48:59,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:48:59,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 03:48:59,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:48:59,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:48:59,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 03:48:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:59,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:49:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:49:00,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387362060] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:49:00,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:49:00,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 34 [2022-12-13 03:49:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069959949] [2022-12-13 03:49:00,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:49:00,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 03:49:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:49:00,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 03:49:00,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 03:49:00,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:49:00,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 3667 transitions, 185177 flow. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:49:00,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:49:00,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:49:00,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:49:57,748 INFO L130 PetriNetUnfolder]: 40918/60488 cut-off events. [2022-12-13 03:49:57,748 INFO L131 PetriNetUnfolder]: For 5246/5246 co-relation queries the response was YES. [2022-12-13 03:49:57,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577198 conditions, 60488 events. 40918/60488 cut-off events. For 5246/5246 co-relation queries the response was YES. Maximal size of possible extension queue 2164. Compared 427924 event pairs, 893 based on Foata normal form. 184/48592 useless extension candidates. Maximal degree in co-relation 508804. Up to 60489 conditions per place. [2022-12-13 03:49:58,463 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 5460 selfloop transitions, 879 changer transitions 0/6339 dead transitions. [2022-12-13 03:49:58,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 6339 transitions, 332889 flow [2022-12-13 03:49:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 03:49:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-13 03:49:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 995 transitions. [2022-12-13 03:49:58,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44819819819819817 [2022-12-13 03:49:58,466 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 305 predicate places. [2022-12-13 03:49:58,466 INFO L82 GeneralOperation]: Start removeDead. Operand has 343 places, 6339 transitions, 332889 flow [2022-12-13 03:49:59,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 343 places, 6339 transitions, 332889 flow [2022-12-13 03:49:59,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:49:59,883 INFO L89 Accepts]: Start accepts. Operand has 343 places, 6339 transitions, 332889 flow [2022-12-13 03:50:00,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:50:00,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:50:00,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 6339 transitions, 332889 flow [2022-12-13 03:50:00,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 6339 transitions, 332889 flow [2022-12-13 03:50:00,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:50:00,254 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:50:00,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 372 [2022-12-13 03:50:00,255 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 6339 transitions, 332889 flow [2022-12-13 03:50:00,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:50:00,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:50:00,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:50:00,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 03:50:00,456 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,SelfDestructingSolverStorable24 [2022-12-13 03:50:00,456 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:50:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:50:00,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1340766333, now seen corresponding path program 11 times [2022-12-13 03:50:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:50:00,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056829322] [2022-12-13 03:50:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:50:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:50:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:50:01,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056829322] [2022-12-13 03:50:01,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056829322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:50:01,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447872158] [2022-12-13 03:50:01,538 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 03:50:01,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:50:01,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:50:01,539 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:50:01,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 03:50:01,663 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:50:01,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:50:01,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 03:50:01,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:50:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:50:01,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:50:01,915 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 03:50:01,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 03:50:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:50:02,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:50:02,837 INFO L321 Elim1Store]: treesize reduction 11, result has 94.1 percent of original size [2022-12-13 03:50:02,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 378 treesize of output 455 [2022-12-13 03:50:02,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:50:02,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 270 [2022-12-13 03:50:02,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:50:02,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 246 [2022-12-13 03:50:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:50:47,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447872158] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:50:47,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:50:47,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 37 [2022-12-13 03:50:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629733986] [2022-12-13 03:50:47,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:50:47,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 03:50:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:50:47,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 03:50:47,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1278, Unknown=14, NotChecked=0, Total=1406 [2022-12-13 03:50:47,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:50:47,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 6339 transitions, 332889 flow. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:50:47,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:50:47,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:50:47,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:52:42,641 INFO L130 PetriNetUnfolder]: 50574/74668 cut-off events. [2022-12-13 03:52:42,641 INFO L131 PetriNetUnfolder]: For 6527/6527 co-relation queries the response was YES. [2022-12-13 03:52:42,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021809 conditions, 74668 events. 50574/74668 cut-off events. For 6527/6527 co-relation queries the response was YES. Maximal size of possible extension queue 2729. Compared 544484 event pairs, 1436 based on Foata normal form. 352/59947 useless extension candidates. Maximal degree in co-relation 629332. Up to 74669 conditions per place. [2022-12-13 03:52:43,523 INFO L137 encePairwiseOnDemand]: 20/37 looper letters, 6876 selfloop transitions, 680 changer transitions 116/7672 dead transitions. [2022-12-13 03:52:43,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 7672 transitions, 418239 flow [2022-12-13 03:52:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 03:52:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 03:52:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 651 transitions. [2022-12-13 03:52:43,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2022-12-13 03:52:43,525 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 339 predicate places. [2022-12-13 03:52:43,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 7672 transitions, 418239 flow [2022-12-13 03:52:44,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 7556 transitions, 411921 flow [2022-12-13 03:52:45,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:52:45,149 INFO L89 Accepts]: Start accepts. Operand has 377 places, 7556 transitions, 411921 flow [2022-12-13 03:52:45,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:52:45,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:52:45,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 377 places, 7556 transitions, 411921 flow [2022-12-13 03:52:45,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 7556 transitions, 411921 flow [2022-12-13 03:52:45,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:52:45,547 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:52:45,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 399 [2022-12-13 03:52:45,548 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 7556 transitions, 411921 flow [2022-12-13 03:52:45,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:52:45,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:52:45,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:52:45,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 03:52:45,749 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,SelfDestructingSolverStorable25 [2022-12-13 03:52:45,750 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:52:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:52:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1496221631, now seen corresponding path program 12 times [2022-12-13 03:52:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:52:45,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022057129] [2022-12-13 03:52:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:52:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:52:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:52:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:52:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:52:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022057129] [2022-12-13 03:52:46,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022057129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:52:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683430578] [2022-12-13 03:52:46,500 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 03:52:46,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:52:46,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:52:46,501 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-13 03:52:46,502 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-13 03:52:46,629 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 03:52:46,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:52:46,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 03:52:46,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:52:46,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:52:46,669 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-12-13 03:52:46,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 38 [2022-12-13 03:52:46,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:52:46,706 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 03:52:46,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 03:52:46,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:52:46,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 03:52:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:52:47,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:52:48,043 INFO L321 Elim1Store]: treesize reduction 11, result has 95.7 percent of original size [2022-12-13 03:52:48,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 452 treesize of output 581 [2022-12-13 03:52:48,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:52:48,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 328 [2022-12-13 03:52:48,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:52:48,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 304 [2022-12-13 03:52:48,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:52:48,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 296 [2022-12-13 03:53:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:53:23,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683430578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:53:23,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:53:23,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 37 [2022-12-13 03:53:23,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436071364] [2022-12-13 03:53:23,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:53:23,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 03:53:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:53:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 03:53:23,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1286, Unknown=11, NotChecked=0, Total=1406 [2022-12-13 03:53:23,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 03:53:23,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 7556 transitions, 411921 flow. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:53:23,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:53:23,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 03:53:23,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:56:23,632 INFO L130 PetriNetUnfolder]: 51768/76362 cut-off events. [2022-12-13 03:56:23,632 INFO L131 PetriNetUnfolder]: For 6673/6673 co-relation queries the response was YES. [2022-12-13 03:56:23,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2143988 conditions, 76362 events. 51768/76362 cut-off events. For 6673/6673 co-relation queries the response was YES. Maximal size of possible extension queue 2821. Compared 558086 event pairs, 1265 based on Foata normal form. 0/60861 useless extension candidates. Maximal degree in co-relation 640408. Up to 76363 conditions per place. [2022-12-13 03:56:24,650 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 7259 selfloop transitions, 465 changer transitions 0/7724 dead transitions. [2022-12-13 03:56:24,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 7724 transitions, 436525 flow [2022-12-13 03:56:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 03:56:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 03:56:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 567 transitions. [2022-12-13 03:56:24,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43783783783783786 [2022-12-13 03:56:24,652 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 373 predicate places. [2022-12-13 03:56:24,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 411 places, 7724 transitions, 436525 flow [2022-12-13 03:56:25,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 411 places, 7724 transitions, 436525 flow [2022-12-13 03:56:26,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:56:26,402 INFO L89 Accepts]: Start accepts. Operand has 411 places, 7724 transitions, 436525 flow [2022-12-13 03:56:26,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:56:26,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:56:26,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 411 places, 7724 transitions, 436525 flow [2022-12-13 03:56:26,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 411 places, 7724 transitions, 436525 flow [2022-12-13 03:56:26,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:56:27,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:56:27,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1058 [2022-12-13 03:56:27,460 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 7723 transitions, 436469 flow [2022-12-13 03:56:27,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:56:27,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:56:27,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:56:27,467 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-13 03:56:27,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 03:56:27,667 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:56:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:56:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1174542915, now seen corresponding path program 1 times [2022-12-13 03:56:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:56:27,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203425085] [2022-12-13 03:56:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:56:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:56:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:56:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:56:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:56:28,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203425085] [2022-12-13 03:56:28,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203425085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:56:28,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320669557] [2022-12-13 03:56:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:56:28,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:56:28,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:56:28,298 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:56:28,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 03:56:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:56:28,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 03:56:28,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:56:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:56:28,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:56:29,371 INFO L321 Elim1Store]: treesize reduction 45, result has 64.0 percent of original size [2022-12-13 03:56:29,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 101 [2022-12-13 03:56:29,416 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 03:56:29,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 03:56:29,420 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 03:56:29,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 03:56:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:56:29,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320669557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:56:29,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:56:29,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-12-13 03:56:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951685436] [2022-12-13 03:56:29,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:56:29,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 03:56:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:56:29,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 03:56:29,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2022-12-13 03:56:29,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 03:56:29,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 7723 transitions, 436469 flow. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:56:29,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:56:29,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 03:56:29,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 03:57:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 03:57:11,374 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:57:11,377 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 03:57:11,377 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 03:57:11,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 03:57:11,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 03:57:11,580 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (32states, 0/38 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 677057 conditions, 23269 events (16555/23268 cut-off events. For 1565/1565 co-relation queries the response was YES. Maximal size of possible extension queue 2489. Compared 153842 event pairs, 569 based on Foata normal form. 0/19921 useless extension candidates. Maximal degree in co-relation 308104. Up to 23269 conditions per place.). [2022-12-13 03:57:11,581 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:57:11,582 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:57:11,582 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:57:11,582 INFO L445 BasicCegarLoop]: Path program histogram: [12, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:11,585 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:57:11,585 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:57:11,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:57:11 BasicIcfg [2022-12-13 03:57:11,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:57:11,587 INFO L158 Benchmark]: Toolchain (without parser) took 771105.70ms. Allocated memory was 202.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 178.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2022-12-13 03:57:11,587 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:57:11,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.01ms. Allocated memory is still 202.4MB. Free memory was 178.9MB in the beginning and 166.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 03:57:11,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 202.4MB. Free memory was 166.5MB in the beginning and 163.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:57:11,588 INFO L158 Benchmark]: Boogie Preprocessor took 37.26ms. Allocated memory is still 202.4MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:57:11,588 INFO L158 Benchmark]: RCFGBuilder took 693.80ms. Allocated memory is still 202.4MB. Free memory was 161.8MB in the beginning and 136.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 03:57:11,588 INFO L158 Benchmark]: TraceAbstraction took 770072.72ms. Allocated memory was 202.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 135.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2022-12-13 03:57:11,589 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.01ms. Allocated memory is still 202.4MB. Free memory was 178.9MB in the beginning and 166.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 202.4MB. Free memory was 166.5MB in the beginning and 163.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.26ms. Allocated memory is still 202.4MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 693.80ms. Allocated memory is still 202.4MB. Free memory was 161.8MB in the beginning and 136.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 770072.72ms. Allocated memory was 202.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 135.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 286 PlacesBefore, 38 PlacesAfterwards, 305 TransitionsBefore, 36 TransitionsAfterwards, 14784 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 117 ConcurrentYvCompositions, 21 ChoiceCompositions, 269 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 10015, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 103, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10081, independent: 1512, independent conditional: 0, independent unconditional: 1512, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 8536, unknown conditional: 0, unknown unconditional: 8536] , Statistics on independence cache: Total cache size (in pairs): 17022, Positive cache size: 16989, Positive conditional cache size: 0, Positive unconditional cache size: 16989, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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: 11.1s, 47 PlacesBefore, 44 PlacesAfterwards, 132 TransitionsBefore, 129 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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, 151 TransitionsBefore, 151 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 231 TransitionsBefore, 231 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 60 PlacesBefore, 60 PlacesAfterwards, 351 TransitionsBefore, 351 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 63 PlacesBefore, 63 PlacesAfterwards, 416 TransitionsBefore, 416 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.8s, 70 PlacesBefore, 69 PlacesAfterwards, 544 TransitionsBefore, 543 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 247 TransitionsBefore, 247 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 337 TransitionsBefore, 337 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 150 TransitionsBefore, 150 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.6s, 63 PlacesBefore, 62 PlacesAfterwards, 323 TransitionsBefore, 322 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 71 PlacesBefore, 71 PlacesAfterwards, 407 TransitionsBefore, 407 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 77 PlacesBefore, 77 PlacesAfterwards, 499 TransitionsBefore, 499 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 83 PlacesBefore, 83 PlacesAfterwards, 554 TransitionsBefore, 554 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 87 PlacesBefore, 87 PlacesAfterwards, 594 TransitionsBefore, 594 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 83 PlacesBefore, 83 PlacesAfterwards, 517 TransitionsBefore, 517 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 117 PlacesBefore, 117 PlacesAfterwards, 1068 TransitionsBefore, 1068 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 135 PlacesBefore, 135 PlacesAfterwards, 1234 TransitionsBefore, 1234 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 153 PlacesBefore, 153 PlacesAfterwards, 1268 TransitionsBefore, 1268 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 185 PlacesBefore, 185 PlacesAfterwards, 2897 TransitionsBefore, 2897 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 212 PlacesBefore, 212 PlacesAfterwards, 2953 TransitionsBefore, 2953 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 230 PlacesBefore, 230 PlacesAfterwards, 3071 TransitionsBefore, 3071 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 248 PlacesBefore, 248 PlacesAfterwards, 3655 TransitionsBefore, 3655 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 266 PlacesBefore, 266 PlacesAfterwards, 3669 TransitionsBefore, 3669 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 284 PlacesBefore, 284 PlacesAfterwards, 3667 TransitionsBefore, 3667 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 343 PlacesBefore, 343 PlacesAfterwards, 6339 TransitionsBefore, 6339 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 377 PlacesBefore, 377 PlacesAfterwards, 7556 TransitionsBefore, 7556 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.7s, 411 PlacesBefore, 410 PlacesAfterwards, 7724 TransitionsBefore, 7723 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 109]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (32states, 0/38 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 677057 conditions, 23269 events (16555/23268 cut-off events. For 1565/1565 co-relation queries the response was YES. Maximal size of possible extension queue 2489. Compared 153842 event pairs, 569 based on Foata normal form. 0/19921 useless extension candidates. Maximal degree in co-relation 308104. Up to 23269 conditions per place.). - TimeoutResultAtElement [Line: 101]: 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 (32states, 0/38 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 677057 conditions, 23269 events (16555/23268 cut-off events. For 1565/1565 co-relation queries the response was YES. Maximal size of possible extension queue 2489. Compared 153842 event pairs, 569 based on Foata normal form. 0/19921 useless extension candidates. Maximal degree in co-relation 308104. Up to 23269 conditions per place.). - TimeoutResultAtElement [Line: 100]: 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 (32states, 0/38 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 677057 conditions, 23269 events (16555/23268 cut-off events. For 1565/1565 co-relation queries the response was YES. Maximal size of possible extension queue 2489. Compared 153842 event pairs, 569 based on Foata normal form. 0/19921 useless extension candidates. Maximal degree in co-relation 308104. Up to 23269 conditions per place.). - TimeoutResultAtElement [Line: 102]: 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 (32states, 0/38 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 677057 conditions, 23269 events (16555/23268 cut-off events. For 1565/1565 co-relation queries the response was YES. Maximal size of possible extension queue 2489. Compared 153842 event pairs, 569 based on Foata normal form. 0/19921 useless extension candidates. Maximal degree in co-relation 308104. Up to 23269 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 413 locations, 4 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: 769.9s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 579.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13720 SdHoareTripleChecker+Valid, 29.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13720 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 25.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47158 IncrementalHoareTripleChecker+Invalid, 47582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 0 mSDtfsCounter, 47158 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1364 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 865 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8901 ImplicationChecksByTransitivity, 31.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436525occurred in iteration=27, InterpolantAutomatonStates: 437, 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.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 148.6s InterpolantComputationTime, 1007 NumberOfCodeBlocks, 1007 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1290 ConstructedInterpolants, 143 QuantifiedInterpolants, 29270 SizeOfPredicates, 423 NumberOfNonLiveVariables, 3940 ConjunctsInSsa, 519 ConjunctsInUnsatCore, 54 InterpolantComputations, 15 PerfectInterpolantSequences, 25/83 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