/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/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:24:41,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:24:41,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:24:41,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:24:41,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:24:41,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:24:41,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:24:41,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:24:41,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:24:41,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:24:41,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:24:41,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:24:41,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:24:41,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:24:41,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:24:41,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:24:41,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:24:41,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:24:41,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:24:41,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:24:41,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:24:41,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:24:41,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:24:41,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:24:41,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:24:41,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:24:41,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:24:41,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:24:41,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:24:41,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:24:41,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:24:41,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:24:41,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:24:41,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:24:41,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:24:41,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:24:41,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:24:41,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:24:41,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:24:41,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:24:41,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:24:41,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 03:24:42,021 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:24:42,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:24:42,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:24:42,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:24:42,023 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:24:42,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:24:42,024 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:24:42,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:24:42,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:24:42,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:24:42,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:24:42,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:24:42,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:24:42,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:24:42,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:24:42,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:24:42,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:24:42,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:24:42,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:24:42,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:24:42,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:24:42,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:24:42,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:24:42,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:24:42,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:24:42,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:24:42,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:24:42,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:24:42,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 03:24:42,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:24:42,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:24:42,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:24:42,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:24:42,367 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:24:42,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 03:24:43,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:24:43,767 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:24:43,768 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 03:24:43,773 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d584a49/22160c93e2a548e6ad6dd18a3dfe52a4/FLAG599e746b8 [2022-12-06 03:24:43,787 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d584a49/22160c93e2a548e6ad6dd18a3dfe52a4 [2022-12-06 03:24:43,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:24:43,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:24:43,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:24:43,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:24:43,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:24:43,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:24:43" (1/1) ... [2022-12-06 03:24:43,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5134d817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:43, skipping insertion in model container [2022-12-06 03:24:43,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:24:43" (1/1) ... [2022-12-06 03:24:43,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:24:43,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:24:43,994 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/unroll-2.wvr.c[2428,2441] [2022-12-06 03:24:44,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:24:44,009 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:24:44,027 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/unroll-2.wvr.c[2428,2441] [2022-12-06 03:24:44,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:24:44,046 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:24:44,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44 WrapperNode [2022-12-06 03:24:44,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:24:44,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:24:44,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:24:44,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:24:44,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,103 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-06 03:24:44,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:24:44,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:24:44,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:24:44,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:24:44,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:24:44,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:24:44,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:24:44,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:24:44,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (1/1) ... [2022-12-06 03:24:44,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:24:44,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:44,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:24:44,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:24:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:24:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:24:44,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:24:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:24:44,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:24:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:24:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:24:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:24:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:24:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:24:44,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:24:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:24:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:24:44,238 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:24:44,347 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:24:44,349 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:24:44,609 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:24:44,618 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:24:44,618 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:24:44,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:24:44 BoogieIcfgContainer [2022-12-06 03:24:44,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:24:44,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:24:44,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:24:44,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:24:44,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:24:43" (1/3) ... [2022-12-06 03:24:44,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352fb3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:24:44, skipping insertion in model container [2022-12-06 03:24:44,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:44" (2/3) ... [2022-12-06 03:24:44,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352fb3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:24:44, skipping insertion in model container [2022-12-06 03:24:44,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:24:44" (3/3) ... [2022-12-06 03:24:44,628 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-06 03:24:44,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:24:44,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:24:44,642 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:24:44,733 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 03:24:44,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 03:24:44,836 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-06 03:24:44,836 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:24:44,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 14/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 03:24:44,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 03:24:44,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-06 03:24:44,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:44,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 03:24:44,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-06 03:24:44,909 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-06 03:24:44,910 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:24:44,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 14/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 03:24:44,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 03:24:44,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-06 03:24:49,646 INFO L203 LiptonReduction]: Total number of compositions: 127 [2022-12-06 03:24:49,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:24:49,664 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;@3b8ea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:24:49,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:24:49,668 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 03:24:49,668 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:24:49,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:49,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:49,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:49,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-06 03:24:49,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:49,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342878726] [2022-12-06 03:24:49,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:49,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:49,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:49,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342878726] [2022-12-06 03:24:49,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342878726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:49,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:24:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112575951] [2022-12-06 03:24:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:49,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:24:49,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:24:49,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:24:49,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 03:24:49,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:49,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:49,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 03:24:49,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:50,066 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 03:24:50,066 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 03:24:50,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 03:24:50,069 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 03:24:50,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 03:24:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:24:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:24:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 03:24:50,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 03:24:50,084 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 03:24:50,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:50,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-06 03:24:50,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-06 03:24:50,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 03:24:51,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:24:51,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 981 [2022-12-06 03:24:51,065 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 76 flow [2022-12-06 03:24:51,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:51,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:51,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:51,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:24:51,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-06 03:24:51,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:51,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968258568] [2022-12-06 03:24:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968258568] [2022-12-06 03:24:51,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968258568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:51,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:51,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:24:51,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429425218] [2022-12-06 03:24:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:24:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:51,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:24:51,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:24:51,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 03:24:51,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-06 03:24:51,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:51,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 03:24:51,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:51,359 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 03:24:51,362 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-12-06 03:24:51,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 116 events. 66/116 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 9 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2022-12-06 03:24:51,367 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 03:24:51,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 175 flow [2022-12-06 03:24:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:24:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:24:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 03:24:51,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 03:24:51,370 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 03:24:51,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:51,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 27 transitions, 175 flow [2022-12-06 03:24:51,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 27 transitions, 175 flow [2022-12-06 03:24:51,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 03:24:51,373 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:51,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 03:24:51,375 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 27 transitions, 175 flow [2022-12-06 03:24:51,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-06 03:24:51,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:51,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:51,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:24:51,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -807143668, now seen corresponding path program 1 times [2022-12-06 03:24:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:51,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118637934] [2022-12-06 03:24:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:51,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118637934] [2022-12-06 03:24:51,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118637934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:51,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:51,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:24:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482204402] [2022-12-06 03:24:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:51,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:24:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:51,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:24:51,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:24:51,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:51,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 27 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:51,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:51,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:51,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:51,645 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 03:24:51,645 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-06 03:24:51,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 169 events. 87/169 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 524 event pairs, 10 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 466. Up to 144 conditions per place. [2022-12-06 03:24:51,647 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 40 selfloop transitions, 4 changer transitions 12/56 dead transitions. [2022-12-06 03:24:51,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 56 transitions, 474 flow [2022-12-06 03:24:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:24:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:24:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 03:24:51,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-06 03:24:51,649 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-06 03:24:51,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:51,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 56 transitions, 474 flow [2022-12-06 03:24:51,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 56 transitions, 474 flow [2022-12-06 03:24:51,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:51,653 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:51,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 03:24:51,654 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 56 transitions, 474 flow [2022-12-06 03:24:51,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:51,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:51,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:51,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:24:51,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash -92123380, now seen corresponding path program 2 times [2022-12-06 03:24:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:51,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024878471] [2022-12-06 03:24:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024878471] [2022-12-06 03:24:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024878471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081648747] [2022-12-06 03:24:51,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:24:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:51,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:51,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:24:51,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:24:51,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:51,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:24:51,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:52,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:24:52,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081648747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:52,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:24:52,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-06 03:24:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490255404] [2022-12-06 03:24:52,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:52,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:24:52,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:24:52,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:24:52,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 03:24:52,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 56 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:52,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:52,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 03:24:52,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:52,146 INFO L130 PetriNetUnfolder]: 95/183 cut-off events. [2022-12-06 03:24:52,146 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 03:24:52,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 183 events. 95/183 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 589 event pairs, 10 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 629. Up to 158 conditions per place. [2022-12-06 03:24:52,149 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 44 selfloop transitions, 5 changer transitions 12/63 dead transitions. [2022-12-06 03:24:52,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 63 transitions, 649 flow [2022-12-06 03:24:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:24:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:24:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 03:24:52,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2022-12-06 03:24:52,151 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-06 03:24:52,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:52,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 63 transitions, 649 flow [2022-12-06 03:24:52,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 63 transitions, 649 flow [2022-12-06 03:24:52,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:52,154 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:52,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 03:24:52,156 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 63 transitions, 649 flow [2022-12-06 03:24:52,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:52,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:52,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:52,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:52,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:52,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1950024266, now seen corresponding path program 1 times [2022-12-06 03:24:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:52,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155333330] [2022-12-06 03:24:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:52,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155333330] [2022-12-06 03:24:52,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155333330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:52,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:52,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:24:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877318689] [2022-12-06 03:24:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:52,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:24:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:52,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:24:52,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:24:52,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:52,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 63 transitions, 649 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:52,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:52,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:52,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:52,660 INFO L130 PetriNetUnfolder]: 105/216 cut-off events. [2022-12-06 03:24:52,660 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-12-06 03:24:52,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 216 events. 105/216 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 792 event pairs, 8 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 1054. Up to 191 conditions per place. [2022-12-06 03:24:52,663 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 56 selfloop transitions, 6 changer transitions 36/98 dead transitions. [2022-12-06 03:24:52,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 98 transitions, 1208 flow [2022-12-06 03:24:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:24:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:24:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 03:24:52,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 03:24:52,668 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 03:24:52,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:52,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 98 transitions, 1208 flow [2022-12-06 03:24:52,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 98 transitions, 1208 flow [2022-12-06 03:24:52,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:52,675 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:52,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 03:24:52,679 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 98 transitions, 1208 flow [2022-12-06 03:24:52,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:52,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:52,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:52,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 03:24:52,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1166910282, now seen corresponding path program 2 times [2022-12-06 03:24:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:52,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760081184] [2022-12-06 03:24:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:52,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760081184] [2022-12-06 03:24:52,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760081184] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:52,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122159775] [2022-12-06 03:24:52,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:24:52,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:52,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:52,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:52,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:24:52,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:24:52,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:52,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:24:52,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:52,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:52,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122159775] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:52,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 03:24:52,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-06 03:24:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144456860] [2022-12-06 03:24:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:52,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:24:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:24:52,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:24:52,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 03:24:52,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 98 transitions, 1208 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:52,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:52,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 03:24:52,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:53,050 INFO L130 PetriNetUnfolder]: 111/226 cut-off events. [2022-12-06 03:24:53,050 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2022-12-06 03:24:53,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 226 events. 111/226 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 834 event pairs, 8 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 1293. Up to 201 conditions per place. [2022-12-06 03:24:53,054 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 58 selfloop transitions, 6 changer transitions 36/103 dead transitions. [2022-12-06 03:24:53,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 103 transitions, 1460 flow [2022-12-06 03:24:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:24:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:24:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 03:24:53,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 03:24:53,059 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 03:24:53,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:53,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 103 transitions, 1460 flow [2022-12-06 03:24:53,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 103 transitions, 1460 flow [2022-12-06 03:24:53,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:53,064 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:53,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:24:53,065 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 103 transitions, 1460 flow [2022-12-06 03:24:53,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:53,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:53,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:53,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:53,286 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,SelfDestructingSolverStorable5 [2022-12-06 03:24:53,286 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1046367850, now seen corresponding path program 3 times [2022-12-06 03:24:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:53,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619080279] [2022-12-06 03:24:53,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:53,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:53,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619080279] [2022-12-06 03:24:53,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619080279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:53,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732904598] [2022-12-06 03:24:53,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:24:53,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:53,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:53,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:53,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:24:53,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:24:53,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:53,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:24:53,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:53,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:53,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732904598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:53,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:53,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-06 03:24:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641118267] [2022-12-06 03:24:53,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:53,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:24:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:24:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:24:53,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:53,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 103 transitions, 1460 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-06 03:24:53,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:53,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:53,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:53,745 INFO L130 PetriNetUnfolder]: 137/277 cut-off events. [2022-12-06 03:24:53,745 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-12-06 03:24:53,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 277 events. 137/277 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1110 event pairs, 8 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 1890. Up to 252 conditions per place. [2022-12-06 03:24:53,748 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 65 selfloop transitions, 17 changer transitions 48/130 dead transitions. [2022-12-06 03:24:53,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 130 transitions, 2113 flow [2022-12-06 03:24:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:24:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:24:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-06 03:24:53,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48739495798319327 [2022-12-06 03:24:53,750 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 03:24:53,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:53,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 130 transitions, 2113 flow [2022-12-06 03:24:53,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 130 transitions, 2113 flow [2022-12-06 03:24:53,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:53,755 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:53,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:24:53,756 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 130 transitions, 2113 flow [2022-12-06 03:24:53,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-06 03:24:53,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:53,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:53,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:53,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:53,964 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1844377062, now seen corresponding path program 3 times [2022-12-06 03:24:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:53,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078434645] [2022-12-06 03:24:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:54,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:54,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078434645] [2022-12-06 03:24:54,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078434645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:54,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:54,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:24:54,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087480156] [2022-12-06 03:24:54,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:54,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:24:54,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:54,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:24:54,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:24:54,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 03:24:54,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 130 transitions, 2113 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:54,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:54,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 03:24:54,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:54,148 INFO L130 PetriNetUnfolder]: 137/271 cut-off events. [2022-12-06 03:24:54,148 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2022-12-06 03:24:54,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 271 events. 137/271 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1058 event pairs, 8 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 2081. Up to 246 conditions per place. [2022-12-06 03:24:54,151 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 64 selfloop transitions, 12 changer transitions 48/127 dead transitions. [2022-12-06 03:24:54,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 127 transitions, 2305 flow [2022-12-06 03:24:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:24:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:24:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 03:24:54,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-06 03:24:54,155 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-06 03:24:54,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:54,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 127 transitions, 2305 flow [2022-12-06 03:24:54,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 127 transitions, 2305 flow [2022-12-06 03:24:54,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:54,160 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:54,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:24:54,161 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 127 transitions, 2305 flow [2022-12-06 03:24:54,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:54,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:54,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:54,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 03:24:54,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 218077724, now seen corresponding path program 4 times [2022-12-06 03:24:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:54,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896975001] [2022-12-06 03:24:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:54,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896975001] [2022-12-06 03:24:54,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896975001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:54,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757433412] [2022-12-06 03:24:54,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:24:54,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:54,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:54,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:54,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:24:54,319 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:24:54,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:54,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:24:54,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:54,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:54,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757433412] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:54,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:54,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 03:24:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006581502] [2022-12-06 03:24:54,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:54,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:24:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:24:54,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:24:54,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:54,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 127 transitions, 2305 flow. Second operand has 8 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-06 03:24:54,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:54,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:54,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:54,571 INFO L130 PetriNetUnfolder]: 131/257 cut-off events. [2022-12-06 03:24:54,572 INFO L131 PetriNetUnfolder]: For 381/381 co-relation queries the response was YES. [2022-12-06 03:24:54,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 257 events. 131/257 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 990 event pairs, 8 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 2199. Up to 232 conditions per place. [2022-12-06 03:24:54,574 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 58 selfloop transitions, 14 changer transitions 48/120 dead transitions. [2022-12-06 03:24:54,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 120 transitions, 2413 flow [2022-12-06 03:24:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:24:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:24:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 03:24:54,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 03:24:54,576 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2022-12-06 03:24:54,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:54,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 120 transitions, 2413 flow [2022-12-06 03:24:54,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 120 transitions, 2413 flow [2022-12-06 03:24:54,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:54,581 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:54,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:24:54,582 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 120 transitions, 2413 flow [2022-12-06 03:24:54,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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-06 03:24:54,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:54,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:54,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:54,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:54,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1528703105, now seen corresponding path program 1 times [2022-12-06 03:24:54,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:54,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000781185] [2022-12-06 03:24:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:24:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000781185] [2022-12-06 03:24:54,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000781185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190788922] [2022-12-06 03:24:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:54,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:54,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:54,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:24:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:55,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 03:24:55,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:55,032 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-06 03:24:55,066 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-06 03:24:55,092 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-06 03:24:55,167 INFO L321 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2022-12-06 03:24:55,167 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 31 [2022-12-06 03:24:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:55,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:55,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (~x2~0 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (= (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset)) (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (< .cse0 0))))) is different from false [2022-12-06 03:24:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:55,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190788922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:55,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:55,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-06 03:24:55,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665014526] [2022-12-06 03:24:55,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:55,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:24:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:55,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:24:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2022-12-06 03:24:55,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 03:24:55,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 120 transitions, 2413 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:55,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:55,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 03:24:55,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:56,113 INFO L130 PetriNetUnfolder]: 367/697 cut-off events. [2022-12-06 03:24:56,113 INFO L131 PetriNetUnfolder]: For 1479/1479 co-relation queries the response was YES. [2022-12-06 03:24:56,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 697 events. 367/697 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3478 event pairs, 10 based on Foata normal form. 2/581 useless extension candidates. Maximal degree in co-relation 4183. Up to 630 conditions per place. [2022-12-06 03:24:56,118 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 67 selfloop transitions, 23 changer transitions 220/313 dead transitions. [2022-12-06 03:24:56,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 313 transitions, 6972 flow [2022-12-06 03:24:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:24:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:24:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 151 transitions. [2022-12-06 03:24:56,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4441176470588235 [2022-12-06 03:24:56,121 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-06 03:24:56,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:56,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 313 transitions, 6972 flow [2022-12-06 03:24:56,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 313 transitions, 6972 flow [2022-12-06 03:24:56,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:58,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:24:58,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2240 [2022-12-06 03:24:58,361 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 312 transitions, 6950 flow [2022-12-06 03:24:58,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:58,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:58,361 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:58,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:58,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 03:24:58,569 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:58,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1034262428, now seen corresponding path program 1 times [2022-12-06 03:24:58,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:58,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467234247] [2022-12-06 03:24:58,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:58,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467234247] [2022-12-06 03:24:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467234247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079693346] [2022-12-06 03:24:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:59,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:59,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:59,181 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:59,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:24:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:59,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 03:24:59,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:59,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 03:24:59,300 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-06 03:24:59,322 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-06 03:24:59,394 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-06 03:24:59,395 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 35 [2022-12-06 03:24:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:59,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:01,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079693346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:01,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:01,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 03:25:01,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443864393] [2022-12-06 03:25:01,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:01,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:25:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:01,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:25:01,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2022-12-06 03:25:01,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 03:25:01,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 312 transitions, 6950 flow. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:01,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:01,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 03:25:01,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:02,130 INFO L130 PetriNetUnfolder]: 422/793 cut-off events. [2022-12-06 03:25:02,131 INFO L131 PetriNetUnfolder]: For 2475/2475 co-relation queries the response was YES. [2022-12-06 03:25:02,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9218 conditions, 793 events. 422/793 cut-off events. For 2475/2475 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4037 event pairs, 16 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 4538. Up to 718 conditions per place. [2022-12-06 03:25:02,137 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 74 selfloop transitions, 7 changer transitions 256/343 dead transitions. [2022-12-06 03:25:02,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 343 transitions, 8312 flow [2022-12-06 03:25:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:25:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:25:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-06 03:25:02,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2022-12-06 03:25:02,139 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-06 03:25:02,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:02,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 343 transitions, 8312 flow [2022-12-06 03:25:02,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 343 transitions, 8312 flow [2022-12-06 03:25:02,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:02,156 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:02,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 03:25:02,157 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 343 transitions, 8312 flow [2022-12-06 03:25:02,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:02,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:02,157 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:02,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:02,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:02,367 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -591682705, now seen corresponding path program 1 times [2022-12-06 03:25:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488750749] [2022-12-06 03:25:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:03,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488750749] [2022-12-06 03:25:03,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488750749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:03,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565832219] [2022-12-06 03:25:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:03,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:03,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:25:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:03,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:25:03,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:03,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:03,386 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 03:25:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:03,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:03,475 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-06 03:25:03,476 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-06 03:25:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:25:03,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565832219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:03,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:03,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2022-12-06 03:25:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166760107] [2022-12-06 03:25:03,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:03,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:25:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:25:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-06 03:25:03,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 03:25:03,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 343 transitions, 8312 flow. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:03,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:03,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 03:25:03,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:04,231 INFO L130 PetriNetUnfolder]: 603/1143 cut-off events. [2022-12-06 03:25:04,231 INFO L131 PetriNetUnfolder]: For 4265/4265 co-relation queries the response was YES. [2022-12-06 03:25:04,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14404 conditions, 1143 events. 603/1143 cut-off events. For 4265/4265 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6276 event pairs, 20 based on Foata normal form. 1/926 useless extension candidates. Maximal degree in co-relation 5803. Up to 1048 conditions per place. [2022-12-06 03:25:04,242 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 110 selfloop transitions, 41 changer transitions 331/488 dead transitions. [2022-12-06 03:25:04,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 488 transitions, 12834 flow [2022-12-06 03:25:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:25:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:25:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2022-12-06 03:25:04,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5170940170940171 [2022-12-06 03:25:04,245 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2022-12-06 03:25:04,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:04,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 488 transitions, 12834 flow [2022-12-06 03:25:04,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 488 transitions, 12834 flow [2022-12-06 03:25:04,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:06,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:25:06,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2651 [2022-12-06 03:25:06,896 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 487 transitions, 12808 flow [2022-12-06 03:25:06,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:06,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:06,896 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:06,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:07,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:07,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash 669749116, now seen corresponding path program 1 times [2022-12-06 03:25:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:07,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748794855] [2022-12-06 03:25:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748794855] [2022-12-06 03:25:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748794855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063902142] [2022-12-06 03:25:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:07,711 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:07,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:25:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:07,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:25:07,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:07,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:07,906 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 03:25:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:07,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:08,006 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-06 03:25:08,006 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-06 03:25:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:08,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063902142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:08,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:08,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 03:25:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067634861] [2022-12-06 03:25:08,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:08,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:25:08,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:08,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:25:08,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:25:08,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 03:25:08,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 487 transitions, 12808 flow. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:08,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:08,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 03:25:08,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:08,724 INFO L130 PetriNetUnfolder]: 831/1552 cut-off events. [2022-12-06 03:25:08,725 INFO L131 PetriNetUnfolder]: For 6839/6839 co-relation queries the response was YES. [2022-12-06 03:25:08,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21079 conditions, 1552 events. 831/1552 cut-off events. For 6839/6839 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8985 event pairs, 17 based on Foata normal form. 1/1239 useless extension candidates. Maximal degree in co-relation 7852. Up to 1439 conditions per place. [2022-12-06 03:25:08,743 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 176 selfloop transitions, 56 changer transitions 389/627 dead transitions. [2022-12-06 03:25:08,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 627 transitions, 17765 flow [2022-12-06 03:25:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:25:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:25:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-12-06 03:25:08,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2022-12-06 03:25:08,745 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 74 predicate places. [2022-12-06 03:25:08,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:08,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 627 transitions, 17765 flow [2022-12-06 03:25:08,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 627 transitions, 17765 flow [2022-12-06 03:25:08,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:08,771 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:08,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 03:25:08,773 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 627 transitions, 17765 flow [2022-12-06 03:25:08,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:08,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:08,773 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:08,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:08,979 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,SelfDestructingSolverStorable12 [2022-12-06 03:25:08,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:08,980 INFO L85 PathProgramCache]: Analyzing trace with hash 370688596, now seen corresponding path program 2 times [2022-12-06 03:25:08,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:08,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874091941] [2022-12-06 03:25:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:09,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:09,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874091941] [2022-12-06 03:25:09,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874091941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:09,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804248374] [2022-12-06 03:25:09,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:25:09,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:09,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:09,792 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:09,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:25:09,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:25:09,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:09,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:25:09,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:09,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:09,963 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 03:25:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:09,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:10,047 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-06 03:25:10,047 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-06 03:25:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:25:10,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804248374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:10,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:10,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 03:25:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186259767] [2022-12-06 03:25:10,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:10,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:25:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:25:10,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:25:10,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 03:25:10,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 627 transitions, 17765 flow. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:10,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:10,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 03:25:10,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:11,029 INFO L130 PetriNetUnfolder]: 1095/2026 cut-off events. [2022-12-06 03:25:11,029 INFO L131 PetriNetUnfolder]: For 9625/9625 co-relation queries the response was YES. [2022-12-06 03:25:11,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29560 conditions, 2026 events. 1095/2026 cut-off events. For 9625/9625 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12168 event pairs, 18 based on Foata normal form. 2/1571 useless extension candidates. Maximal degree in co-relation 10669. Up to 1899 conditions per place. [2022-12-06 03:25:11,045 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 269 selfloop transitions, 40 changer transitions 458/773 dead transitions. [2022-12-06 03:25:11,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 773 transitions, 23456 flow [2022-12-06 03:25:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:25:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:25:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2022-12-06 03:25:11,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2022-12-06 03:25:11,047 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 03:25:11,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:11,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 773 transitions, 23456 flow [2022-12-06 03:25:11,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 773 transitions, 23456 flow [2022-12-06 03:25:11,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:11,081 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:11,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 03:25:11,082 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 773 transitions, 23456 flow [2022-12-06 03:25:11,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:11,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:11,083 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:11,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:11,289 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,SelfDestructingSolverStorable13 [2022-12-06 03:25:11,289 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -88368520, now seen corresponding path program 3 times [2022-12-06 03:25:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:11,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022509561] [2022-12-06 03:25:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022509561] [2022-12-06 03:25:12,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022509561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868558329] [2022-12-06 03:25:12,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:25:12,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:12,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:12,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:25:12,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:25:12,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:12,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:25:12,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:12,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:25:12,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-06 03:25:12,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:12,365 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 03:25:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:12,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:12,412 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= c_~x1~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~f~0.base))) (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset))))) is different from false [2022-12-06 03:25:12,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:12,482 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 112 [2022-12-06 03:25:12,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:12,496 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 28 [2022-12-06 03:25:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 03:25:12,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868558329] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:12,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:12,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 03:25:12,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167593954] [2022-12-06 03:25:12,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:12,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:25:12,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:12,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:25:12,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=5, NotChecked=24, Total=210 [2022-12-06 03:25:12,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 03:25:12,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 773 transitions, 23456 flow. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:12,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:12,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 03:25:12,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:13,827 INFO L130 PetriNetUnfolder]: 1514/2767 cut-off events. [2022-12-06 03:25:13,828 INFO L131 PetriNetUnfolder]: For 13550/13550 co-relation queries the response was YES. [2022-12-06 03:25:13,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43256 conditions, 2767 events. 1514/2767 cut-off events. For 13550/13550 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17213 event pairs, 14 based on Foata normal form. 2/2078 useless extension candidates. Maximal degree in co-relation 16282. Up to 2626 conditions per place. [2022-12-06 03:25:13,852 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 336 selfloop transitions, 69 changer transitions 591/1002 dead transitions. [2022-12-06 03:25:13,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1002 transitions, 32453 flow [2022-12-06 03:25:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:25:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:25:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-12-06 03:25:13,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5023923444976076 [2022-12-06 03:25:13,855 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 98 predicate places. [2022-12-06 03:25:13,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:13,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 1002 transitions, 32453 flow [2022-12-06 03:25:13,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 1002 transitions, 32453 flow [2022-12-06 03:25:13,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:13,905 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:13,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 03:25:13,906 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 1002 transitions, 32453 flow [2022-12-06 03:25:13,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:13,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:13,906 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:13,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:14,112 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,SelfDestructingSolverStorable14 [2022-12-06 03:25:14,113 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:14,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1493167686, now seen corresponding path program 4 times [2022-12-06 03:25:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:14,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535141752] [2022-12-06 03:25:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:14,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:14,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535141752] [2022-12-06 03:25:14,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535141752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:14,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585486777] [2022-12-06 03:25:14,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:25:14,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:14,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:14,482 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:14,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:25:14,569 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:25:14,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:14,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:25:14,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:14,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:25:14,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 03:25:14,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:14,738 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 03:25:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:14,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:14,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:14,844 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-06 03:25:14,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:14,866 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-06 03:25:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:15,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585486777] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:15,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:15,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 03:25:15,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644168878] [2022-12-06 03:25:15,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:25:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:25:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=158, Unknown=4, NotChecked=0, Total=210 [2022-12-06 03:25:15,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 03:25:15,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 1002 transitions, 32453 flow. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:15,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:15,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 03:25:15,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:16,197 INFO L130 PetriNetUnfolder]: 1622/2963 cut-off events. [2022-12-06 03:25:16,198 INFO L131 PetriNetUnfolder]: For 16437/16437 co-relation queries the response was YES. [2022-12-06 03:25:16,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49232 conditions, 2963 events. 1622/2963 cut-off events. For 16437/16437 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18746 event pairs, 20 based on Foata normal form. 1/2209 useless extension candidates. Maximal degree in co-relation 18467. Up to 2822 conditions per place. [2022-12-06 03:25:16,217 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 383 selfloop transitions, 51 changer transitions 620/1060 dead transitions. [2022-12-06 03:25:16,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1060 transitions, 36441 flow [2022-12-06 03:25:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:25:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:25:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-06 03:25:16,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 03:25:16,219 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 105 predicate places. [2022-12-06 03:25:16,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:16,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 1060 transitions, 36441 flow [2022-12-06 03:25:16,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 1060 transitions, 36441 flow [2022-12-06 03:25:16,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:16,265 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:16,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 03:25:16,266 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 1060 transitions, 36441 flow [2022-12-06 03:25:16,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:16,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:16,266 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:16,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:16,471 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,SelfDestructingSolverStorable15 [2022-12-06 03:25:16,472 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -21779539, now seen corresponding path program 1 times [2022-12-06 03:25:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:16,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680558906] [2022-12-06 03:25:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:17,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:17,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680558906] [2022-12-06 03:25:17,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680558906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:17,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545768387] [2022-12-06 03:25:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:17,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:17,343 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:17,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:25:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:17,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:25:17,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:17,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:25:17,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-06 03:25:17,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:17,584 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 03:25:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:17,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:17,650 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_487) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4)))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)))) is different from false [2022-12-06 03:25:17,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:17,680 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 112 [2022-12-06 03:25:17,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:17,693 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 28 [2022-12-06 03:25:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 03:25:17,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545768387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:17,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:17,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 03:25:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989399983] [2022-12-06 03:25:17,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:17,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 03:25:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:17,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 03:25:17,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=220, Unknown=2, NotChecked=30, Total=306 [2022-12-06 03:25:17,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 03:25:17,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 1060 transitions, 36441 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:17,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:17,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 03:25:17,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:19,458 INFO L130 PetriNetUnfolder]: 1915/3538 cut-off events. [2022-12-06 03:25:19,458 INFO L131 PetriNetUnfolder]: For 22453/22453 co-relation queries the response was YES. [2022-12-06 03:25:19,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62236 conditions, 3538 events. 1915/3538 cut-off events. For 22453/22453 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23413 event pairs, 24 based on Foata normal form. 2/2611 useless extension candidates. Maximal degree in co-relation 20828. Up to 3375 conditions per place. [2022-12-06 03:25:19,486 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 464 selfloop transitions, 117 changer transitions 744/1331 dead transitions. [2022-12-06 03:25:19,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1331 transitions, 48467 flow [2022-12-06 03:25:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:25:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:25:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2022-12-06 03:25:19,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 03:25:19,488 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 114 predicate places. [2022-12-06 03:25:19,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:19,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 1331 transitions, 48467 flow [2022-12-06 03:25:19,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 1331 transitions, 48467 flow [2022-12-06 03:25:19,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:19,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:19,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 03:25:19,560 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 1331 transitions, 48467 flow [2022-12-06 03:25:19,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:19,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:19,561 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:19,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:19,766 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,SelfDestructingSolverStorable16 [2022-12-06 03:25:19,767 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:19,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1559756667, now seen corresponding path program 2 times [2022-12-06 03:25:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:19,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430457853] [2022-12-06 03:25:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:19,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430457853] [2022-12-06 03:25:20,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430457853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560230735] [2022-12-06 03:25:20,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:25:20,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:20,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:20,670 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:20,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 03:25:20,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:25:20,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:20,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:25:20,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:20,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:25:20,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 03:25:20,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:20,922 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 03:25:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:20,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:20,980 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset))))) is different from false [2022-12-06 03:25:21,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:21,009 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-06 03:25:21,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:25:21,128 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-06 03:25:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:21,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560230735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:21,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:21,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 03:25:21,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205286606] [2022-12-06 03:25:21,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:21,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:25:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:25:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=195, Unknown=1, NotChecked=28, Total=272 [2022-12-06 03:25:21,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 03:25:21,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 1331 transitions, 48467 flow. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:21,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:21,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 03:25:21,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:23,195 INFO L130 PetriNetUnfolder]: 1990/3673 cut-off events. [2022-12-06 03:25:23,196 INFO L131 PetriNetUnfolder]: For 27259/27259 co-relation queries the response was YES. [2022-12-06 03:25:23,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68137 conditions, 3673 events. 1990/3673 cut-off events. For 27259/27259 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24471 event pairs, 20 based on Foata normal form. 1/2713 useless extension candidates. Maximal degree in co-relation 21965. Up to 3506 conditions per place. [2022-12-06 03:25:23,221 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 551 selfloop transitions, 78 changer transitions 745/1380 dead transitions. [2022-12-06 03:25:23,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 1380 transitions, 52991 flow [2022-12-06 03:25:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:25:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:25:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2022-12-06 03:25:23,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2022-12-06 03:25:23,223 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2022-12-06 03:25:23,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:23,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 1380 transitions, 52991 flow [2022-12-06 03:25:23,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 1380 transitions, 52991 flow [2022-12-06 03:25:23,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:25,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:25:25,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2765 [2022-12-06 03:25:25,988 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 1379 transitions, 52953 flow [2022-12-06 03:25:25,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:25,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:25,988 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:25,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:26,193 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,SelfDestructingSolverStorable17 [2022-12-06 03:25:26,194 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1968779461, now seen corresponding path program 5 times [2022-12-06 03:25:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:26,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843056429] [2022-12-06 03:25:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:26,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:26,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843056429] [2022-12-06 03:25:26,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843056429] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:26,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919002905] [2022-12-06 03:25:26,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:25:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:26,389 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:26,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:25:26,505 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:25:26,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:26,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:25:26,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:26,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:26,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919002905] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:26,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:26,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-12-06 03:25:26,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072700445] [2022-12-06 03:25:26,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:26,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:25:26,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:26,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:25:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:25:26,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:25:26,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1379 transitions, 52953 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:26,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:26,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:25:26,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:29,556 INFO L130 PetriNetUnfolder]: 2792/5422 cut-off events. [2022-12-06 03:25:29,556 INFO L131 PetriNetUnfolder]: For 32513/32513 co-relation queries the response was YES. [2022-12-06 03:25:29,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106449 conditions, 5422 events. 2792/5422 cut-off events. For 32513/32513 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41123 event pairs, 0 based on Foata normal form. 0/4084 useless extension candidates. Maximal degree in co-relation 34014. Up to 5209 conditions per place. [2022-12-06 03:25:29,586 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 850 selfloop transitions, 309 changer transitions 1720/2879 dead transitions. [2022-12-06 03:25:29,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 2879 transitions, 116399 flow [2022-12-06 03:25:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:25:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:25:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 149 transitions. [2022-12-06 03:25:29,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.298 [2022-12-06 03:25:29,588 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 148 predicate places. [2022-12-06 03:25:29,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:29,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 2879 transitions, 116399 flow [2022-12-06 03:25:29,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 2879 transitions, 116399 flow [2022-12-06 03:25:29,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:29,790 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:29,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 03:25:29,791 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 2879 transitions, 116399 flow [2022-12-06 03:25:29,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:29,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:29,791 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:29,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:29,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:29,997 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1832300897, now seen corresponding path program 6 times [2022-12-06 03:25:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:29,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913612791] [2022-12-06 03:25:29,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:29,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:30,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913612791] [2022-12-06 03:25:30,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913612791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:30,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650482641] [2022-12-06 03:25:30,145 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:25:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:30,147 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:30,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:25:30,257 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:25:30,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:30,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:25:30,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:30,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:30,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650482641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:30,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:30,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-12-06 03:25:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297946061] [2022-12-06 03:25:30,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:30,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:25:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:25:30,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-06 03:25:30,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:25:30,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 2879 transitions, 116399 flow. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:30,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:30,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:25:30,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:36,921 INFO L130 PetriNetUnfolder]: 2852/5532 cut-off events. [2022-12-06 03:25:36,922 INFO L131 PetriNetUnfolder]: For 32177/32177 co-relation queries the response was YES. [2022-12-06 03:25:36,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114188 conditions, 5532 events. 2852/5532 cut-off events. For 32177/32177 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 42159 event pairs, 0 based on Foata normal form. 24/4200 useless extension candidates. Maximal degree in co-relation 36931. Up to 5319 conditions per place. [2022-12-06 03:25:36,953 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 1025 selfloop transitions, 144 changer transitions 1780/2949 dead transitions. [2022-12-06 03:25:36,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 2949 transitions, 125124 flow [2022-12-06 03:25:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:25:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:25:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-12-06 03:25:36,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-06 03:25:36,956 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 159 predicate places. [2022-12-06 03:25:36,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:36,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 2949 transitions, 125124 flow [2022-12-06 03:25:37,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 2949 transitions, 125124 flow [2022-12-06 03:25:37,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:37,050 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:37,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 03:25:37,051 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 2949 transitions, 125124 flow [2022-12-06 03:25:37,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:37,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:37,051 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:37,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:37,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:37,257 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:37,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash -906062947, now seen corresponding path program 7 times [2022-12-06 03:25:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:37,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304228148] [2022-12-06 03:25:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304228148] [2022-12-06 03:25:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304228148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357735376] [2022-12-06 03:25:37,434 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:25:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:37,436 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:37,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:25:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:37,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:25:37,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:37,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:37,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357735376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:37,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:37,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-06 03:25:37,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535384] [2022-12-06 03:25:37,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:37,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:25:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:25:37,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:25:37,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:25:37,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 2949 transitions, 125124 flow. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:37,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:37,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:25:37,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:45,257 INFO L130 PetriNetUnfolder]: 3205/6358 cut-off events. [2022-12-06 03:25:45,257 INFO L131 PetriNetUnfolder]: For 32704/32704 co-relation queries the response was YES. [2022-12-06 03:25:45,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137143 conditions, 6358 events. 3205/6358 cut-off events. For 32704/32704 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 50758 event pairs, 0 based on Foata normal form. 12/4881 useless extension candidates. Maximal degree in co-relation 43568. Up to 6077 conditions per place. [2022-12-06 03:25:45,294 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 1035 selfloop transitions, 340 changer transitions 2186/3561 dead transitions. [2022-12-06 03:25:45,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 3561 transitions, 158274 flow [2022-12-06 03:25:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:25:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:25:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 161 transitions. [2022-12-06 03:25:45,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-06 03:25:45,296 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 179 predicate places. [2022-12-06 03:25:45,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:45,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 3561 transitions, 158274 flow [2022-12-06 03:25:45,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 3561 transitions, 158274 flow [2022-12-06 03:25:45,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:45,523 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:45,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 03:25:45,523 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 3561 transitions, 158274 flow [2022-12-06 03:25:45,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:45,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:45,524 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:45,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:45,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:45,725 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -849517841, now seen corresponding path program 8 times [2022-12-06 03:25:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:45,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345004580] [2022-12-06 03:25:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:45,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345004580] [2022-12-06 03:25:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345004580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024525267] [2022-12-06 03:25:45,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:25:45,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:45,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:45,852 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:45,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:25:45,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:25:45,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:45,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:25:45,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:46,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:46,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024525267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:46,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:46,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-12-06 03:25:46,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263784554] [2022-12-06 03:25:46,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:46,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:25:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:46,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:25:46,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-06 03:25:46,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:25:46,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 3561 transitions, 158274 flow. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:46,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:46,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:25:46,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:26:00,488 INFO L130 PetriNetUnfolder]: 3755/7478 cut-off events. [2022-12-06 03:26:00,488 INFO L131 PetriNetUnfolder]: For 32560/32560 co-relation queries the response was YES. [2022-12-06 03:26:00,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169403 conditions, 7478 events. 3755/7478 cut-off events. For 32560/32560 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 61843 event pairs, 0 based on Foata normal form. 0/5697 useless extension candidates. Maximal degree in co-relation 52015. Up to 7197 conditions per place. [2022-12-06 03:26:00,531 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 1281 selfloop transitions, 495 changer transitions 2659/4435 dead transitions. [2022-12-06 03:26:00,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 4435 transitions, 205985 flow [2022-12-06 03:26:00,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 03:26:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 03:26:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 242 transitions. [2022-12-06 03:26:00,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3025 [2022-12-06 03:26:00,533 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 218 predicate places. [2022-12-06 03:26:00,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:26:00,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 4435 transitions, 205985 flow [2022-12-06 03:26:00,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 4435 transitions, 205985 flow [2022-12-06 03:26:00,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:26:00,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:26:00,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 03:26:00,817 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 4435 transitions, 205985 flow [2022-12-06 03:26:00,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:00,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:26:00,817 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:26:00,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 03:26:01,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:01,018 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:26:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:26:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash 151517845, now seen corresponding path program 9 times [2022-12-06 03:26:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:26:01,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238959029] [2022-12-06 03:26:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:26:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:26:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:26:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:26:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238959029] [2022-12-06 03:26:01,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238959029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:26:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929398489] [2022-12-06 03:26:01,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:26:01,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:01,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:26:01,209 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:26:01,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:26:01,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:26:01,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:26:01,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:26:01,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:26:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:01,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:26:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:01,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929398489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:26:01,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:26:01,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-06 03:26:01,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763159476] [2022-12-06 03:26:01,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:26:01,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 03:26:01,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:26:01,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 03:26:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-12-06 03:26:01,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:26:01,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 4435 transitions, 205985 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:01,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:26:01,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:26:01,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:26:13,971 INFO L130 PetriNetUnfolder]: 3417/6792 cut-off events. [2022-12-06 03:26:13,971 INFO L131 PetriNetUnfolder]: For 29650/29650 co-relation queries the response was YES. [2022-12-06 03:26:13,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160793 conditions, 6792 events. 3417/6792 cut-off events. For 29650/29650 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 55033 event pairs, 0 based on Foata normal form. 24/5284 useless extension candidates. Maximal degree in co-relation 52196. Up to 6551 conditions per place. [2022-12-06 03:26:14,010 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 1264 selfloop transitions, 308 changer transitions 2468/4040 dead transitions. [2022-12-06 03:26:14,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 4040 transitions, 195539 flow [2022-12-06 03:26:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:26:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:26:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 140 transitions. [2022-12-06 03:26:14,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 03:26:14,013 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 227 predicate places. [2022-12-06 03:26:14,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:26:14,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 4040 transitions, 195539 flow [2022-12-06 03:26:14,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 4040 transitions, 195539 flow [2022-12-06 03:26:14,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:26:14,266 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:26:14,267 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-06 03:26:14,267 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 4040 transitions, 195539 flow [2022-12-06 03:26:14,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:14,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:26:14,267 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:26:14,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 03:26:14,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:14,469 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:26:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:26:14,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1414184901, now seen corresponding path program 10 times [2022-12-06 03:26:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:26:14,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199958784] [2022-12-06 03:26:14,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:26:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:26:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:26:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:14,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:26:14,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199958784] [2022-12-06 03:26:14,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199958784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:26:14,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143246865] [2022-12-06 03:26:14,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:26:14,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:14,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:26:14,624 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:26:14,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:26:14,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:26:14,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:26:14,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:26:14,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:26:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:14,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:26:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:14,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143246865] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:26:14,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:26:14,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-06 03:26:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176314021] [2022-12-06 03:26:14,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:26:14,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:26:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:26:14,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:26:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:26:14,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:26:14,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 4040 transitions, 195539 flow. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:14,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:26:14,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:26:14,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:26:29,076 INFO L130 PetriNetUnfolder]: 3842/7847 cut-off events. [2022-12-06 03:26:29,076 INFO L131 PetriNetUnfolder]: For 30157/30157 co-relation queries the response was YES. [2022-12-06 03:26:29,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194071 conditions, 7847 events. 3842/7847 cut-off events. For 30157/30157 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 67113 event pairs, 0 based on Foata normal form. 0/6115 useless extension candidates. Maximal degree in co-relation 65558. Up to 7606 conditions per place. [2022-12-06 03:26:29,120 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 1420 selfloop transitions, 473 changer transitions 2984/4877 dead transitions. [2022-12-06 03:26:29,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 4877 transitions, 245910 flow [2022-12-06 03:26:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 03:26:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 03:26:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 218 transitions. [2022-12-06 03:26:29,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2658536585365854 [2022-12-06 03:26:29,123 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 267 predicate places. [2022-12-06 03:26:29,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:26:29,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 4877 transitions, 245910 flow [2022-12-06 03:26:29,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 4877 transitions, 245910 flow [2022-12-06 03:26:29,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:26:29,291 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:26:29,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 03:26:29,291 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 4877 transitions, 245910 flow [2022-12-06 03:26:29,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:29,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:26:29,292 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:26:29,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 03:26:29,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:29,492 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:26:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:26:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1004206469, now seen corresponding path program 11 times [2022-12-06 03:26:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:26:29,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031953798] [2022-12-06 03:26:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:26:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:26:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:26:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:26:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031953798] [2022-12-06 03:26:29,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031953798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:26:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217219667] [2022-12-06 03:26:29,699 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:26:29,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:26:29,704 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:26:29,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:26:29,852 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:26:29,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:26:29,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:26:29,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:26:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:29,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:26:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:30,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217219667] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:26:30,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:26:30,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-06 03:26:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845329089] [2022-12-06 03:26:30,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:26:30,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:26:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:26:30,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:26:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:26:30,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:26:30,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 4877 transitions, 245910 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:30,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:26:30,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:26:30,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:26:50,432 INFO L130 PetriNetUnfolder]: 4146/8448 cut-off events. [2022-12-06 03:26:50,432 INFO L131 PetriNetUnfolder]: For 30164/30164 co-relation queries the response was YES. [2022-12-06 03:26:50,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217574 conditions, 8448 events. 4146/8448 cut-off events. For 30164/30164 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 72877 event pairs, 0 based on Foata normal form. 0/6624 useless extension candidates. Maximal degree in co-relation 77550. Up to 8207 conditions per place. [2022-12-06 03:26:50,496 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 1454 selfloop transitions, 523 changer transitions 3293/5270 dead transitions. [2022-12-06 03:26:50,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 5270 transitions, 276187 flow [2022-12-06 03:26:50,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 03:26:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 03:26:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 231 transitions. [2022-12-06 03:26:50,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2625 [2022-12-06 03:26:50,498 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 308 predicate places. [2022-12-06 03:26:50,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:26:50,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 5270 transitions, 276187 flow [2022-12-06 03:26:50,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 5270 transitions, 276187 flow [2022-12-06 03:26:50,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:26:50,697 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:26:50,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 03:26:50,698 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 5270 transitions, 276187 flow [2022-12-06 03:26:50,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:50,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:26:50,698 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:26:50,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 03:26:50,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 03:26:50,904 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:26:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:26:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1628108139, now seen corresponding path program 12 times [2022-12-06 03:26:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:26:50,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185826784] [2022-12-06 03:26:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:26:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:26:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:26:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:26:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185826784] [2022-12-06 03:26:51,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185826784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:26:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875589681] [2022-12-06 03:26:51,067 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:26:51,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:51,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:26:51,068 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:26:51,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:26:51,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 03:26:51,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:26:51,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:26:51,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:26:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:51,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:26:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:51,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875589681] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:26:51,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:26:51,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-06 03:26:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147185745] [2022-12-06 03:26:51,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:26:51,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:26:51,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:26:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:26:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-06 03:26:51,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:26:51,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 5270 transitions, 276187 flow. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:51,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:26:51,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:26:51,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:27:20,977 INFO L130 PetriNetUnfolder]: 4572/9390 cut-off events. [2022-12-06 03:27:20,977 INFO L131 PetriNetUnfolder]: For 30340/30340 co-relation queries the response was YES. [2022-12-06 03:27:20,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251565 conditions, 9390 events. 4572/9390 cut-off events. For 30340/30340 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 83390 event pairs, 0 based on Foata normal form. 0/7369 useless extension candidates. Maximal degree in co-relation 90233. Up to 9149 conditions per place. [2022-12-06 03:27:21,032 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 1603 selfloop transitions, 565 changer transitions 3726/5894 dead transitions. [2022-12-06 03:27:21,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 5894 transitions, 320747 flow [2022-12-06 03:27:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 03:27:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 03:27:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 219 transitions. [2022-12-06 03:27:21,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2959459459459459 [2022-12-06 03:27:21,035 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 344 predicate places. [2022-12-06 03:27:21,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:27:21,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 5894 transitions, 320747 flow [2022-12-06 03:27:21,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 5894 transitions, 320747 flow [2022-12-06 03:27:21,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:27:21,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:27:21,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 03:27:21,246 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 5894 transitions, 320747 flow [2022-12-06 03:27:21,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:27:21,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:27:21,246 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:27:21,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:27:21,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 03:27:21,447 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:27:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:27:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1385047247, now seen corresponding path program 13 times [2022-12-06 03:27:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:27:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060977340] [2022-12-06 03:27:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:27:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:27:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:27:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:27:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:27:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060977340] [2022-12-06 03:27:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060977340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:27:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181910416] [2022-12-06 03:27:21,720 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:27:21,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:27:21,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:27:21,721 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:27:21,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:27:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:27:21,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:27:21,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:27:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:27:21,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:27:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:27:22,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181910416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:27:22,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:27:22,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-12-06 03:27:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657212703] [2022-12-06 03:27:22,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:27:22,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 03:27:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:27:22,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 03:27:22,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-06 03:27:22,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:27:22,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 5894 transitions, 320747 flow. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:27:22,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:27:22,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:27:22,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:27:54,618 INFO L130 PetriNetUnfolder]: 4566/9415 cut-off events. [2022-12-06 03:27:54,618 INFO L131 PetriNetUnfolder]: For 30317/30317 co-relation queries the response was YES. [2022-12-06 03:27:54,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261652 conditions, 9415 events. 4566/9415 cut-off events. For 30317/30317 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 83810 event pairs, 0 based on Foata normal form. 0/7400 useless extension candidates. Maximal degree in co-relation 94168. Up to 9174 conditions per place. [2022-12-06 03:27:54,673 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 1774 selfloop transitions, 400 changer transitions 3749/5923 dead transitions. [2022-12-06 03:27:54,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 5923 transitions, 334147 flow [2022-12-06 03:27:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 03:27:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 03:27:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 161 transitions. [2022-12-06 03:27:54,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2875 [2022-12-06 03:27:54,675 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 369 predicate places. [2022-12-06 03:27:54,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:27:54,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 390 places, 5923 transitions, 334147 flow [2022-12-06 03:27:54,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 390 places, 5923 transitions, 334147 flow [2022-12-06 03:27:54,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:27:54,891 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:27:54,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 03:27:54,892 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 5923 transitions, 334147 flow [2022-12-06 03:27:54,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:27:54,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:27:54,892 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:27:54,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 03:27:55,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 03:27:55,093 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:27:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:27:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -220805867, now seen corresponding path program 14 times [2022-12-06 03:27:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:27:55,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766193093] [2022-12-06 03:27:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:27:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:27:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:27:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:27:55,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:27:55,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766193093] [2022-12-06 03:27:55,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766193093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:27:55,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81439083] [2022-12-06 03:27:55,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:27:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:27:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:27:55,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:27:55,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:27:55,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:27:55,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:27:55,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:27:55,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:27:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:27:55,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:27:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:27:55,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81439083] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:27:55,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:27:55,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-06 03:27:55,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846486402] [2022-12-06 03:27:55,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:27:55,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 03:27:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:27:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 03:27:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-12-06 03:27:55,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:27:55,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 5923 transitions, 334147 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:27:55,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:27:55,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:27:55,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:28:38,850 INFO L130 PetriNetUnfolder]: 5979/12400 cut-off events. [2022-12-06 03:28:38,850 INFO L131 PetriNetUnfolder]: For 30709/30709 co-relation queries the response was YES. [2022-12-06 03:28:38,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357916 conditions, 12400 events. 5979/12400 cut-off events. For 30709/30709 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 116520 event pairs, 0 based on Foata normal form. 0/9681 useless extension candidates. Maximal degree in co-relation 131435. Up to 12159 conditions per place. [2022-12-06 03:28:38,926 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 2525 selfloop transitions, 511 changer transitions 4798/7834 dead transitions. [2022-12-06 03:28:38,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 7834 transitions, 457680 flow [2022-12-06 03:28:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 03:28:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 03:28:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 179 transitions. [2022-12-06 03:28:38,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3196428571428571 [2022-12-06 03:28:38,928 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 396 predicate places. [2022-12-06 03:28:38,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:28:38,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 417 places, 7834 transitions, 457680 flow [2022-12-06 03:28:39,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 417 places, 7834 transitions, 457680 flow [2022-12-06 03:28:39,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:28:39,384 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:28:39,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 457 [2022-12-06 03:28:39,385 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 7834 transitions, 457680 flow [2022-12-06 03:28:39,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:28:39,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:28:39,385 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:28:39,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:28:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:28:39,591 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:28:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:28:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 245717671, now seen corresponding path program 15 times [2022-12-06 03:28:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:28:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011812524] [2022-12-06 03:28:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:28:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:28:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:28:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:39,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:28:39,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011812524] [2022-12-06 03:28:39,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011812524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:28:39,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968452183] [2022-12-06 03:28:39,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:28:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:28:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:28:39,818 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:28:39,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 03:28:39,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:28:39,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:28:39,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:28:39,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:28:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:40,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:28:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:40,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968452183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:28:40,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:28:40,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-06 03:28:40,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550475589] [2022-12-06 03:28:40,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:28:40,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:28:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:28:40,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:28:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:28:40,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:28:40,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 7834 transitions, 457680 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:28:40,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:28:40,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:28:40,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:29:42,217 INFO L130 PetriNetUnfolder]: 6049/12751 cut-off events. [2022-12-06 03:29:42,217 INFO L131 PetriNetUnfolder]: For 30629/30629 co-relation queries the response was YES. [2022-12-06 03:29:42,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380771 conditions, 12751 events. 6049/12751 cut-off events. For 30629/30629 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 121979 event pairs, 0 based on Foata normal form. 0/10090 useless extension candidates. Maximal degree in co-relation 142632. Up to 12502 conditions per place. [2022-12-06 03:29:42,289 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 2334 selfloop transitions, 769 changer transitions 5052/8155 dead transitions. [2022-12-06 03:29:42,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 8155 transitions, 492666 flow [2022-12-06 03:29:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 03:29:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 03:29:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 250 transitions. [2022-12-06 03:29:42,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2358490566037736 [2022-12-06 03:29:42,291 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 448 predicate places. [2022-12-06 03:29:42,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:29:42,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 469 places, 8155 transitions, 492666 flow [2022-12-06 03:29:42,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 469 places, 8155 transitions, 492666 flow [2022-12-06 03:29:42,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:29:42,632 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:29:42,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 342 [2022-12-06 03:29:42,633 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 8155 transitions, 492666 flow [2022-12-06 03:29:42,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:29:42,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:29:42,634 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:29:42,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 03:29:42,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 03:29:42,840 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:29:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:29:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash -164260761, now seen corresponding path program 16 times [2022-12-06 03:29:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:29:42,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913005339] [2022-12-06 03:29:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:29:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:29:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:29:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:29:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:29:42,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913005339] [2022-12-06 03:29:42,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913005339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:29:42,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345728086] [2022-12-06 03:29:42,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:29:42,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:29:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:29:42,989 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:29:42,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 03:29:43,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:29:43,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:29:43,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:29:43,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:29:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:29:43,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:29:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:29:43,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345728086] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:29:43,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:29:43,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-06 03:29:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881355697] [2022-12-06 03:29:43,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:29:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 03:29:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:29:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 03:29:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-12-06 03:29:43,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:29:43,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 8155 transitions, 492666 flow. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:29:43,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:29:43,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:29:43,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:30:58,530 INFO L130 PetriNetUnfolder]: 6642/13927 cut-off events. [2022-12-06 03:30:58,530 INFO L131 PetriNetUnfolder]: For 30697/30697 co-relation queries the response was YES. [2022-12-06 03:30:58,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430019 conditions, 13927 events. 6642/13927 cut-off events. For 30697/30697 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 134370 event pairs, 0 based on Foata normal form. 0/11056 useless extension candidates. Maximal degree in co-relation 164064. Up to 13678 conditions per place. [2022-12-06 03:30:58,619 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 2551 selfloop transitions, 938 changer transitions 5419/8908 dead transitions. [2022-12-06 03:30:58,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 8908 transitions, 555782 flow [2022-12-06 03:30:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-06 03:30:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-06 03:30:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 256 transitions. [2022-12-06 03:30:58,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-06 03:30:58,621 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 503 predicate places. [2022-12-06 03:30:58,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:30:58,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 524 places, 8908 transitions, 555782 flow [2022-12-06 03:30:58,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 524 places, 8908 transitions, 555782 flow [2022-12-06 03:30:58,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:30:59,011 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:30:59,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 390 [2022-12-06 03:30:59,012 INFO L495 AbstractCegarLoop]: Abstraction has has 524 places, 8908 transitions, 555782 flow [2022-12-06 03:30:59,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:30:59,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:30:59,012 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:30:59,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-06 03:30:59,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:30:59,213 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:30:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:30:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash -305634539, now seen corresponding path program 17 times [2022-12-06 03:30:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:30:59,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437073264] [2022-12-06 03:30:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:30:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:30:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:30:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:30:59,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:30:59,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437073264] [2022-12-06 03:30:59,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437073264] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:30:59,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956678968] [2022-12-06 03:30:59,359 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:30:59,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:30:59,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:30:59,364 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:30:59,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 03:30:59,475 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:30:59,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:30:59,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:30:59,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:30:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:30:59,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:30:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:30:59,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956678968] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:30:59,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:30:59,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-06 03:30:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550321080] [2022-12-06 03:30:59,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:30:59,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:30:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:30:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:30:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:30:59,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:30:59,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 8908 transitions, 555782 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:30:59,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:30:59,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:30:59,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:32:27,756 INFO L130 PetriNetUnfolder]: 7334/15127 cut-off events. [2022-12-06 03:32:27,756 INFO L131 PetriNetUnfolder]: For 30683/30683 co-relation queries the response was YES. [2022-12-06 03:32:27,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482327 conditions, 15127 events. 7334/15127 cut-off events. For 30683/30683 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 145525 event pairs, 0 based on Foata normal form. 0/12062 useless extension candidates. Maximal degree in co-relation 189770. Up to 14878 conditions per place. [2022-12-06 03:32:27,927 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 3311 selfloop transitions, 528 changer transitions 5791/9630 dead transitions. [2022-12-06 03:32:27,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 9630 transitions, 619746 flow [2022-12-06 03:32:27,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 03:32:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 03:32:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 184 transitions. [2022-12-06 03:32:27,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24864864864864866 [2022-12-06 03:32:27,929 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 539 predicate places. [2022-12-06 03:32:27,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:32:27,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 560 places, 9630 transitions, 619746 flow [2022-12-06 03:32:28,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 560 places, 9630 transitions, 619746 flow [2022-12-06 03:32:28,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:32:28,370 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:32:28,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 442 [2022-12-06 03:32:28,371 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 9630 transitions, 619746 flow [2022-12-06 03:32:28,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:32:28,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:32:28,372 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:32:28,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 03:32:28,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 03:32:28,577 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:32:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:32:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash -44506737, now seen corresponding path program 18 times [2022-12-06 03:32:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:32:28,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282967129] [2022-12-06 03:32:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:32:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:32:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:32:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:32:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:32:28,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282967129] [2022-12-06 03:32:28,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282967129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:32:28,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162941341] [2022-12-06 03:32:28,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:32:28,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:32:28,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:32:28,762 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:32:28,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 03:32:28,900 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:32:28,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:32:28,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:32:28,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:32:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:32:28,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:32:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:32:29,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162941341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:32:29,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:32:29,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-06 03:32:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665786423] [2022-12-06 03:32:29,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:32:29,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:32:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:32:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:32:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-06 03:32:29,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:32:29,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 9630 transitions, 619746 flow. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:32:29,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:32:29,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:32:29,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:34:22,138 INFO L130 PetriNetUnfolder]: 9395/19419 cut-off events. [2022-12-06 03:34:22,139 INFO L131 PetriNetUnfolder]: For 32509/32509 co-relation queries the response was YES. [2022-12-06 03:34:22,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639261 conditions, 19419 events. 9395/19419 cut-off events. For 32509/32509 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 194422 event pairs, 0 based on Foata normal form. 0/15469 useless extension candidates. Maximal degree in co-relation 262103. Up to 19158 conditions per place. [2022-12-06 03:34:22,297 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 4479 selfloop transitions, 547 changer transitions 7384/12410 dead transitions. [2022-12-06 03:34:22,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 12410 transitions, 823222 flow [2022-12-06 03:34:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:34:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:34:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 94 transitions. [2022-12-06 03:34:22,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31333333333333335 [2022-12-06 03:34:22,298 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 553 predicate places. [2022-12-06 03:34:22,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:34:22,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 574 places, 12410 transitions, 823222 flow [2022-12-06 03:34:23,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 574 places, 12410 transitions, 823222 flow [2022-12-06 03:34:23,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:34:23,033 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:34:23,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 737 [2022-12-06 03:34:23,035 INFO L495 AbstractCegarLoop]: Abstraction has has 574 places, 12410 transitions, 823222 flow [2022-12-06 03:34:23,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:34:23,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:34:23,035 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:34:23,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 03:34:23,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:34:23,236 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:34:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:34:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2071113717, now seen corresponding path program 19 times [2022-12-06 03:34:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:34:23,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276402999] [2022-12-06 03:34:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:34:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:34:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:34:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:34:23,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:34:23,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276402999] [2022-12-06 03:34:23,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276402999] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:34:23,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540371227] [2022-12-06 03:34:23,450 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:34:23,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:34:23,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:34:23,468 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:34:23,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 03:34:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:34:23,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:34:23,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:34:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:34:23,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:34:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:34:23,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540371227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:34:23,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:34:23,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-06 03:34:23,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176630196] [2022-12-06 03:34:23,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:34:23,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 03:34:23,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:34:23,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 03:34:23,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-06 03:34:23,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:34:23,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 12410 transitions, 823222 flow. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:34:23,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:34:23,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:34:23,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:37:13,022 INFO L130 PetriNetUnfolder]: 10131/20704 cut-off events. [2022-12-06 03:37:13,022 INFO L131 PetriNetUnfolder]: For 32469/32469 co-relation queries the response was YES. [2022-12-06 03:37:13,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702347 conditions, 20704 events. 10131/20704 cut-off events. For 32469/32469 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 207372 event pairs, 0 based on Foata normal form. 0/16554 useless extension candidates. Maximal degree in co-relation 290782. Up to 20443 conditions per place. [2022-12-06 03:37:13,162 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 4606 selfloop transitions, 840 changer transitions 7737/13183 dead transitions. [2022-12-06 03:37:13,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 13183 transitions, 900534 flow [2022-12-06 03:37:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 03:37:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 03:37:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 169 transitions. [2022-12-06 03:37:13,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2485294117647059 [2022-12-06 03:37:13,164 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 586 predicate places. [2022-12-06 03:37:13,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:37:13,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 607 places, 13183 transitions, 900534 flow [2022-12-06 03:37:13,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 607 places, 13183 transitions, 900534 flow [2022-12-06 03:37:13,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:37:13,979 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:37:13,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 816 [2022-12-06 03:37:13,980 INFO L495 AbstractCegarLoop]: Abstraction has has 607 places, 13183 transitions, 900534 flow [2022-12-06 03:37:13,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:37:13,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:37:13,980 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:37:13,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 03:37:14,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:37:14,186 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:37:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:37:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 815348321, now seen corresponding path program 20 times [2022-12-06 03:37:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:37:14,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334480311] [2022-12-06 03:37:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:37:14,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:37:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:37:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:37:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:37:14,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334480311] [2022-12-06 03:37:14,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334480311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:37:14,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610587164] [2022-12-06 03:37:14,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:37:14,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:37:14,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:37:14,370 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:37:14,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 03:37:14,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:37:14,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:37:14,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:37:14,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:37:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:37:14,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:37:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:37:14,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610587164] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:37:14,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:37:14,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-12-06 03:37:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344496925] [2022-12-06 03:37:14,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:37:14,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 03:37:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:37:14,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 03:37:14,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-06 03:37:14,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:37:14,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 13183 transitions, 900534 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:37:14,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:37:14,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:37:14,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 03:38:27,171 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:38:27,171 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:38:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 03:38:27,188 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 03:38:27,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 03:38:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:38:27,388 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/20 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 338108 conditions, 9753 events (5095/9752 cut-off events. For 30502/30502 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 94801 event pairs, 0 based on Foata normal form. 0/9065 useless extension candidates. Maximal degree in co-relation 157361. Up to 9464 conditions per place.). [2022-12-06 03:38:27,390 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 03:38:27,390 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 03:38:27,390 INFO L458 BasicCegarLoop]: Path program histogram: [20, 4, 3, 2, 1, 1, 1, 1, 1] [2022-12-06 03:38:27,392 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:38:27,392 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:38:27,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:38:27 BasicIcfg [2022-12-06 03:38:27,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:38:27,394 INFO L158 Benchmark]: Toolchain (without parser) took 823604.91ms. Allocated memory was 187.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 163.0MB in the beginning and 442.8MB in the end (delta: -279.8MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 03:38:27,395 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory was 164.3MB in the beginning and 164.2MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:38:27,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.50ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 151.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 03:38:27,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.69ms. Allocated memory is still 187.7MB. Free memory was 151.2MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:38:27,395 INFO L158 Benchmark]: Boogie Preprocessor took 39.31ms. Allocated memory is still 187.7MB. Free memory was 149.7MB in the beginning and 148.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:38:27,395 INFO L158 Benchmark]: RCFGBuilder took 475.27ms. Allocated memory is still 187.7MB. Free memory was 148.1MB in the beginning and 131.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 03:38:27,396 INFO L158 Benchmark]: TraceAbstraction took 822771.92ms. Allocated memory was 187.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 130.8MB in the beginning and 442.8MB in the end (delta: -312.0MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 03:38:27,397 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory was 164.3MB in the beginning and 164.2MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.50ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 151.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.69ms. Allocated memory is still 187.7MB. Free memory was 151.2MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.31ms. Allocated memory is still 187.7MB. Free memory was 149.7MB in the beginning and 148.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 475.27ms. Allocated memory is still 187.7MB. Free memory was 148.1MB in the beginning and 131.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 822771.92ms. Allocated memory was 187.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 130.8MB in the beginning and 442.8MB in the end (delta: -312.0MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 137 PlacesBefore, 21 PlacesAfterwards, 144 TransitionsBefore, 17 TransitionsAfterwards, 1942 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 47 ConcurrentYvCompositions, 11 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 1248, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 0, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2121, Positive conditional cache size: 0, Positive unconditional cache size: 2121, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 22 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, 24 PlacesBefore, 24 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 56 TransitionsBefore, 56 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, 31 PlacesBefore, 31 PlacesAfterwards, 63 TransitionsBefore, 63 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, 35 PlacesBefore, 35 PlacesAfterwards, 98 TransitionsBefore, 98 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, 38 PlacesBefore, 38 PlacesAfterwards, 103 TransitionsBefore, 103 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, 44 PlacesBefore, 44 PlacesAfterwards, 130 TransitionsBefore, 130 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, 47 PlacesBefore, 47 PlacesAfterwards, 127 TransitionsBefore, 127 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, 51 PlacesBefore, 51 PlacesAfterwards, 120 TransitionsBefore, 120 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: 2.2s, 70 PlacesBefore, 69 PlacesAfterwards, 313 TransitionsBefore, 312 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, 75 PlacesBefore, 75 PlacesAfterwards, 343 TransitionsBefore, 343 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: 2.6s, 87 PlacesBefore, 86 PlacesAfterwards, 488 TransitionsBefore, 487 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, 95 PlacesBefore, 95 PlacesAfterwards, 627 TransitionsBefore, 627 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, 109 PlacesBefore, 109 PlacesAfterwards, 773 TransitionsBefore, 773 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, 119 PlacesBefore, 119 PlacesAfterwards, 1002 TransitionsBefore, 1002 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, 126 PlacesBefore, 126 PlacesAfterwards, 1060 TransitionsBefore, 1060 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, 1331 TransitionsBefore, 1331 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: 2.7s, 146 PlacesBefore, 145 PlacesAfterwards, 1380 TransitionsBefore, 1379 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, 169 PlacesBefore, 169 PlacesAfterwards, 2879 TransitionsBefore, 2879 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, 180 PlacesBefore, 180 PlacesAfterwards, 2949 TransitionsBefore, 2949 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, 200 PlacesBefore, 200 PlacesAfterwards, 3561 TransitionsBefore, 3561 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, 239 PlacesBefore, 239 PlacesAfterwards, 4435 TransitionsBefore, 4435 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, 4040 TransitionsBefore, 4040 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, 288 PlacesBefore, 288 PlacesAfterwards, 4877 TransitionsBefore, 4877 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, 329 PlacesBefore, 329 PlacesAfterwards, 5270 TransitionsBefore, 5270 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, 365 PlacesBefore, 365 PlacesAfterwards, 5894 TransitionsBefore, 5894 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, 390 PlacesBefore, 390 PlacesAfterwards, 5923 TransitionsBefore, 5923 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, 417 PlacesBefore, 417 PlacesAfterwards, 7834 TransitionsBefore, 7834 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, 469 PlacesBefore, 469 PlacesAfterwards, 8155 TransitionsBefore, 8155 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, 524 PlacesBefore, 524 PlacesAfterwards, 8908 TransitionsBefore, 8908 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, 560 PlacesBefore, 560 PlacesAfterwards, 9630 TransitionsBefore, 9630 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, 574 PlacesBefore, 574 PlacesAfterwards, 12410 TransitionsBefore, 12410 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, 607 PlacesBefore, 607 PlacesAfterwards, 13183 TransitionsBefore, 13183 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 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/20 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 338108 conditions, 9753 events (5095/9752 cut-off events. For 30502/30502 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 94801 event pairs, 0 based on Foata normal form. 0/9065 useless extension candidates. Maximal degree in co-relation 157361. Up to 9464 conditions per place.). - TimeoutResultAtElement [Line: 83]: 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 (17states, 0/20 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 338108 conditions, 9753 events (5095/9752 cut-off events. For 30502/30502 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 94801 event pairs, 0 based on Foata normal form. 0/9065 useless extension candidates. Maximal degree in co-relation 157361. Up to 9464 conditions per place.). - TimeoutResultAtElement [Line: 82]: 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 (17states, 0/20 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 338108 conditions, 9753 events (5095/9752 cut-off events. For 30502/30502 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 94801 event pairs, 0 based on Foata normal form. 0/9065 useless extension candidates. Maximal degree in co-relation 157361. Up to 9464 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 189 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 822.6s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 775.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 3886 SdHoareTripleChecker+Valid, 15.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3886 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 224 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 781 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13817 IncrementalHoareTripleChecker+Invalid, 14849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 781 mSolverCounterUnsat, 117 mSDtfsCounter, 13817 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1967 GetRequests, 1106 SyntacticMatches, 40 SemanticMatches, 821 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8171 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900534occurred in iteration=33, InterpolantAutomatonStates: 637, 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.7s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 1404 ConstructedInterpolants, 29 QuantifiedInterpolants, 12310 SizeOfPredicates, 159 NumberOfNonLiveVariables, 5504 ConjunctsInSsa, 471 ConjunctsInUnsatCore, 91 InterpolantComputations, 7 PerfectInterpolantSequences, 65/413 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