/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:57:51,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:57:51,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:57:51,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:57:51,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:57:51,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:57:51,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:57:51,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:57:51,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:57:51,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:57:51,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:57:51,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:57:51,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:57:51,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:57:51,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:57:51,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:57:51,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:57:51,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:57:51,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:57:51,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:57:51,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:57:51,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:57:51,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:57:51,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:57:51,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:57:51,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:57:51,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:57:51,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:57:51,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:57:51,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:57:51,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:57:51,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:57:51,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:57:51,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:57:51,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:57:51,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:57:51,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:57:51,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:57:51,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:57:51,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:57:51,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:57:51,949 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:57:51,980 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:57:51,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:57:51,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:57:51,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:57:51,983 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:57:51,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:57:51,983 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:57:51,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:57:51,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:57:51,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:57:51,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:57:51,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:57:51,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:57:51,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:57:51,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:57:51,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:57:51,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:57:51,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:57:51,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:57:51,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:57:51,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:57:51,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:57:51,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:57:51,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:57:51,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:57:51,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:57:51,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:57:51,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:57:51,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:57:52,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:57:52,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:57:52,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:57:52,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:57:52,297 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:57:52,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-13 03:57:53,507 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:57:53,746 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:57:53,746 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-13 03:57:53,758 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f91dbd28/c4089ce0a8704164a1c5e77de0dde935/FLAG81b697410 [2022-12-13 03:57:53,772 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f91dbd28/c4089ce0a8704164a1c5e77de0dde935 [2022-12-13 03:57:53,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:57:53,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:57:53,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:57:53,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:57:53,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:57:53,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:57:53" (1/1) ... [2022-12-13 03:57:53,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613a7211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:53, skipping insertion in model container [2022-12-13 03:57:53,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:57:53" (1/1) ... [2022-12-13 03:57:53,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:57:53,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:57:53,970 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3945,3958] [2022-12-13 03:57:53,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:57:53,993 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:57:54,022 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3945,3958] [2022-12-13 03:57:54,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:57:54,041 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:57:54,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54 WrapperNode [2022-12-13 03:57:54,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:57:54,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:57:54,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:57:54,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:57:54,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,107 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 413 [2022-12-13 03:57:54,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:57:54,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:57:54,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:57:54,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:57:54,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,154 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:57:54,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:57:54,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:57:54,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:57:54,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (1/1) ... [2022-12-13 03:57:54,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:57:54,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:57:54,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:57:54,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:57:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:57:54,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:57:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:57:54,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:57:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 03:57:54,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 03:57:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 03:57:54,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 03:57:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 03:57:54,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 03:57:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:57:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 03:57:54,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:57:54,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:57:54,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:57:54,264 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:57:54,447 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:57:54,449 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:57:55,017 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:57:55,035 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:57:55,035 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 03:57:55,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:57:55 BoogieIcfgContainer [2022-12-13 03:57:55,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:57:55,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:57:55,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:57:55,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:57:55,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:57:53" (1/3) ... [2022-12-13 03:57:55,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a334712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:57:55, skipping insertion in model container [2022-12-13 03:57:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:54" (2/3) ... [2022-12-13 03:57:55,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a334712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:57:55, skipping insertion in model container [2022-12-13 03:57:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:57:55" (3/3) ... [2022-12-13 03:57:55,046 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2022-12-13 03:57:55,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:57:55,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:57:55,064 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:57:55,193 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 03:57:55,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 483 transitions, 990 flow [2022-12-13 03:57:55,471 INFO L130 PetriNetUnfolder]: 41/480 cut-off events. [2022-12-13 03:57:55,471 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:57:55,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 480 events. 41/480 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 632 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-13 03:57:55,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 483 transitions, 990 flow [2022-12-13 03:57:55,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 470 transitions, 958 flow [2022-12-13 03:57:55,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:55,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-13 03:57:55,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 470 transitions, 958 flow [2022-12-13 03:57:55,641 INFO L130 PetriNetUnfolder]: 41/470 cut-off events. [2022-12-13 03:57:55,642 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:57:55,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 470 events. 41/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 630 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-13 03:57:55,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-13 03:57:55,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 17280 [2022-12-13 03:58:13,317 INFO L241 LiptonReduction]: Total number of compositions: 429 [2022-12-13 03:58:13,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:58:13,334 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;@3c89735b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:58:13,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:58:13,341 INFO L130 PetriNetUnfolder]: 10/41 cut-off events. [2022-12-13 03:58:13,342 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:58:13,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:13,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:13,343 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -237819189, now seen corresponding path program 1 times [2022-12-13 03:58:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:13,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522349585] [2022-12-13 03:58:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:13,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:13,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522349585] [2022-12-13 03:58:13,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522349585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:13,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:13,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:58:13,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377113176] [2022-12-13 03:58:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:58:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:13,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:58:13,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:58:13,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:58:13,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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-13 03:58:13,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:13,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:58:13,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:14,008 INFO L130 PetriNetUnfolder]: 727/1071 cut-off events. [2022-12-13 03:58:14,008 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-13 03:58:14,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1071 events. 727/1071 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4030 event pairs, 405 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 2079. Up to 795 conditions per place. [2022-12-13 03:58:14,015 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-13 03:58:14,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 246 flow [2022-12-13 03:58:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:58:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:58:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 03:58:14,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-13 03:58:14,031 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 03:58:14,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 56 transitions, 246 flow [2022-12-13 03:58:14,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 56 transitions, 246 flow [2022-12-13 03:58:14,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:14,041 INFO L89 Accepts]: Start accepts. Operand has 44 places, 56 transitions, 246 flow [2022-12-13 03:58:14,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:14,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:14,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 56 transitions, 246 flow [2022-12-13 03:58:14,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 56 transitions, 246 flow [2022-12-13 03:58:14,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 03:58:14,216 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:58:14,217 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 03:58:14,217 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 55 transitions, 242 flow [2022-12-13 03:58:14,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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-13 03:58:14,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:14,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:14,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:58:14,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2107721905, now seen corresponding path program 1 times [2022-12-13 03:58:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:14,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877932261] [2022-12-13 03:58:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877932261] [2022-12-13 03:58:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877932261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:14,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:14,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:58:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828951391] [2022-12-13 03:58:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:14,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:58:14,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:14,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:58:14,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:58:14,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:58:14,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 55 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-13 03:58:14,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:14,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:58:14,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:14,557 INFO L130 PetriNetUnfolder]: 791/1187 cut-off events. [2022-12-13 03:58:14,557 INFO L131 PetriNetUnfolder]: For 101/117 co-relation queries the response was YES. [2022-12-13 03:58:14,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1187 events. 791/1187 cut-off events. For 101/117 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4651 event pairs, 333 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 3395. Up to 913 conditions per place. [2022-12-13 03:58:14,564 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 68 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2022-12-13 03:58:14,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 75 transitions, 479 flow [2022-12-13 03:58:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:58:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:58:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 03:58:14,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-13 03:58:14,566 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2022-12-13 03:58:14,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 75 transitions, 479 flow [2022-12-13 03:58:14,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 75 transitions, 479 flow [2022-12-13 03:58:14,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:14,577 INFO L89 Accepts]: Start accepts. Operand has 46 places, 75 transitions, 479 flow [2022-12-13 03:58:14,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:14,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:14,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 75 transitions, 479 flow [2022-12-13 03:58:14,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 75 transitions, 479 flow [2022-12-13 03:58:14,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 03:58:14,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:14,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:58:14,584 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 75 transitions, 479 flow [2022-12-13 03:58:14,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-13 03:58:14,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:14,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:14,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:58:14,584 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1575741224, now seen corresponding path program 1 times [2022-12-13 03:58:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:14,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767495665] [2022-12-13 03:58:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:14,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767495665] [2022-12-13 03:58:14,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767495665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:14,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:14,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:58:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215569790] [2022-12-13 03:58:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:14,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:58:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:14,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:58:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:58:14,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:58:14,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 75 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-13 03:58:14,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:14,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:58:14,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:15,024 INFO L130 PetriNetUnfolder]: 791/1187 cut-off events. [2022-12-13 03:58:15,024 INFO L131 PetriNetUnfolder]: For 113/129 co-relation queries the response was YES. [2022-12-13 03:58:15,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 1187 events. 791/1187 cut-off events. For 113/129 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4671 event pairs, 333 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 4482. Up to 1185 conditions per place. [2022-12-13 03:58:15,032 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 73 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2022-12-13 03:58:15,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 635 flow [2022-12-13 03:58:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:58:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:58:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-13 03:58:15,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-13 03:58:15,034 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-12-13 03:58:15,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 76 transitions, 635 flow [2022-12-13 03:58:15,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 76 transitions, 635 flow [2022-12-13 03:58:15,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:15,046 INFO L89 Accepts]: Start accepts. Operand has 48 places, 76 transitions, 635 flow [2022-12-13 03:58:15,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:15,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:15,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 76 transitions, 635 flow [2022-12-13 03:58:15,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 76 transitions, 635 flow [2022-12-13 03:58:15,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 03:58:17,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:58:17,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2299 [2022-12-13 03:58:17,345 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 75 transitions, 627 flow [2022-12-13 03:58:17,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-13 03:58:17,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:17,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:17,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:58:17,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1599217002, now seen corresponding path program 1 times [2022-12-13 03:58:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553213379] [2022-12-13 03:58:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:17,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:17,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553213379] [2022-12-13 03:58:17,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553213379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:17,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:17,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:58:17,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276495194] [2022-12-13 03:58:17,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:17,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:58:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:58:17,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:58:17,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:17,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 75 transitions, 627 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 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-13 03:58:17,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:17,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:17,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:17,751 INFO L130 PetriNetUnfolder]: 893/1339 cut-off events. [2022-12-13 03:58:17,751 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-12-13 03:58:17,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6712 conditions, 1339 events. 893/1339 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5206 event pairs, 417 based on Foata normal form. 0/1179 useless extension candidates. Maximal degree in co-relation 6160. Up to 1338 conditions per place. [2022-12-13 03:58:17,761 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 73 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 03:58:17,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 76 transitions, 787 flow [2022-12-13 03:58:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:58:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:58:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 03:58:17,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-13 03:58:17,764 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-13 03:58:17,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 76 transitions, 787 flow [2022-12-13 03:58:17,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 76 transitions, 787 flow [2022-12-13 03:58:17,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:17,779 INFO L89 Accepts]: Start accepts. Operand has 50 places, 76 transitions, 787 flow [2022-12-13 03:58:17,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:17,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:17,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 76 transitions, 787 flow [2022-12-13 03:58:17,785 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 76 transitions, 787 flow [2022-12-13 03:58:17,785 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:18,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:58:18,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 304 [2022-12-13 03:58:18,083 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 75 transitions, 777 flow [2022-12-13 03:58:18,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 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-13 03:58:18,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:18,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:18,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:58:18,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash -445237807, now seen corresponding path program 1 times [2022-12-13 03:58:18,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:18,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598948832] [2022-12-13 03:58:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:18,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:18,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598948832] [2022-12-13 03:58:18,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598948832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:18,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:18,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:58:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515510086] [2022-12-13 03:58:18,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:18,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:58:18,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:18,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:58:18,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:58:18,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:58:18,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 75 transitions, 777 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:18,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:18,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:58:18,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:18,522 INFO L130 PetriNetUnfolder]: 893/1339 cut-off events. [2022-12-13 03:58:18,522 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-13 03:58:18,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8000 conditions, 1339 events. 893/1339 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5224 event pairs, 417 based on Foata normal form. 0/1179 useless extension candidates. Maximal degree in co-relation 7344. Up to 1339 conditions per place. [2022-12-13 03:58:18,536 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 72 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 03:58:18,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 937 flow [2022-12-13 03:58:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:58:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:58:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 03:58:18,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 03:58:18,541 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-13 03:58:18,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 76 transitions, 937 flow [2022-12-13 03:58:18,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 76 transitions, 937 flow [2022-12-13 03:58:18,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:18,562 INFO L89 Accepts]: Start accepts. Operand has 52 places, 76 transitions, 937 flow [2022-12-13 03:58:18,566 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:18,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:18,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 76 transitions, 937 flow [2022-12-13 03:58:18,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 76 transitions, 937 flow [2022-12-13 03:58:18,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:18,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:58:18,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 315 [2022-12-13 03:58:18,878 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 75 transitions, 925 flow [2022-12-13 03:58:18,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:18,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:18,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:18,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:58:18,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1279022137, now seen corresponding path program 1 times [2022-12-13 03:58:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:18,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251882740] [2022-12-13 03:58:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:19,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:19,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251882740] [2022-12-13 03:58:19,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251882740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:19,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:19,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:58:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635800323] [2022-12-13 03:58:19,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:19,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:58:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:58:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:58:19,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:58:19,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 75 transitions, 925 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:19,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:19,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:58:19,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:19,321 INFO L130 PetriNetUnfolder]: 893/1339 cut-off events. [2022-12-13 03:58:19,322 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-13 03:58:19,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9288 conditions, 1339 events. 893/1339 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5287 event pairs, 417 based on Foata normal form. 0/1179 useless extension candidates. Maximal degree in co-relation 8528. Up to 1339 conditions per place. [2022-12-13 03:58:19,330 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 72 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 03:58:19,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 1087 flow [2022-12-13 03:58:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:58:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:58:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 03:58:19,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 03:58:19,332 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-13 03:58:19,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 76 transitions, 1087 flow [2022-12-13 03:58:19,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 76 transitions, 1087 flow [2022-12-13 03:58:19,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:19,346 INFO L89 Accepts]: Start accepts. Operand has 54 places, 76 transitions, 1087 flow [2022-12-13 03:58:19,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:19,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:19,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 76 transitions, 1087 flow [2022-12-13 03:58:19,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 76 transitions, 1087 flow [2022-12-13 03:58:19,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:19,613 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:58:19,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 268 [2022-12-13 03:58:19,614 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 75 transitions, 1073 flow [2022-12-13 03:58:19,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:19,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:19,614 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:19,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:58:19,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1469115847, now seen corresponding path program 1 times [2022-12-13 03:58:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:19,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526695746] [2022-12-13 03:58:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:19,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:19,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526695746] [2022-12-13 03:58:19,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526695746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:19,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:19,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:58:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856065809] [2022-12-13 03:58:19,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:19,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:58:19,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:19,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:58:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:58:19,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:19,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 75 transitions, 1073 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-13 03:58:19,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:19,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:19,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:20,167 INFO L130 PetriNetUnfolder]: 893/1339 cut-off events. [2022-12-13 03:58:20,168 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-13 03:58:20,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10628 conditions, 1339 events. 893/1339 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5292 event pairs, 417 based on Foata normal form. 0/1179 useless extension candidates. Maximal degree in co-relation 9760. Up to 1339 conditions per place. [2022-12-13 03:58:20,176 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 71 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2022-12-13 03:58:20,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 1239 flow [2022-12-13 03:58:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:58:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:58:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 03:58:20,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20952380952380953 [2022-12-13 03:58:20,178 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-13 03:58:20,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 76 transitions, 1239 flow [2022-12-13 03:58:20,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 76 transitions, 1239 flow [2022-12-13 03:58:20,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:20,192 INFO L89 Accepts]: Start accepts. Operand has 57 places, 76 transitions, 1239 flow [2022-12-13 03:58:20,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:20,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:20,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 76 transitions, 1239 flow [2022-12-13 03:58:20,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 76 transitions, 1239 flow [2022-12-13 03:58:20,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:20,436 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:58:20,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 03:58:20,437 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 1223 flow [2022-12-13 03:58:20,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-13 03:58:20,437 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:20,437 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:20,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:58:20,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash 512895815, now seen corresponding path program 1 times [2022-12-13 03:58:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:20,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058790255] [2022-12-13 03:58:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:20,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058790255] [2022-12-13 03:58:20,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058790255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:20,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:20,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:58:20,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167559171] [2022-12-13 03:58:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:20,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:58:20,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:58:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:58:20,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:58:20,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 1223 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:20,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:20,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:58:20,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:20,925 INFO L130 PetriNetUnfolder]: 893/1339 cut-off events. [2022-12-13 03:58:20,926 INFO L131 PetriNetUnfolder]: For 703/703 co-relation queries the response was YES. [2022-12-13 03:58:20,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11916 conditions, 1339 events. 893/1339 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5173 event pairs, 417 based on Foata normal form. 0/1179 useless extension candidates. Maximal degree in co-relation 10944. Up to 1339 conditions per place. [2022-12-13 03:58:20,935 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 72 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 03:58:20,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 1389 flow [2022-12-13 03:58:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:58:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:58:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 03:58:20,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 03:58:20,937 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-13 03:58:20,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 76 transitions, 1389 flow [2022-12-13 03:58:20,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 76 transitions, 1389 flow [2022-12-13 03:58:20,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:20,954 INFO L89 Accepts]: Start accepts. Operand has 59 places, 76 transitions, 1389 flow [2022-12-13 03:58:20,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:20,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:20,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 76 transitions, 1389 flow [2022-12-13 03:58:20,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 76 transitions, 1389 flow [2022-12-13 03:58:20,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:21,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:58:21,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 03:58:21,200 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 75 transitions, 1371 flow [2022-12-13 03:58:21,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:21,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:21,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:21,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:58:21,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1193678737, now seen corresponding path program 1 times [2022-12-13 03:58:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:21,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671341797] [2022-12-13 03:58:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:22,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671341797] [2022-12-13 03:58:22,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671341797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:22,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:22,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 03:58:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409951695] [2022-12-13 03:58:22,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:22,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 03:58:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:22,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 03:58:22,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 03:58:22,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:22,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 75 transitions, 1371 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:22,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:22,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:22,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:23,265 INFO L130 PetriNetUnfolder]: 1237/1915 cut-off events. [2022-12-13 03:58:23,266 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-12-13 03:58:23,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18947 conditions, 1915 events. 1237/1915 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8484 event pairs, 467 based on Foata normal form. 1/1704 useless extension candidates. Maximal degree in co-relation 16490. Up to 1915 conditions per place. [2022-12-13 03:58:23,279 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 146 selfloop transitions, 13 changer transitions 13/172 dead transitions. [2022-12-13 03:58:23,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 172 transitions, 3476 flow [2022-12-13 03:58:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 03:58:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 03:58:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-12-13 03:58:23,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28095238095238095 [2022-12-13 03:58:23,281 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2022-12-13 03:58:23,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 172 transitions, 3476 flow [2022-12-13 03:58:23,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 159 transitions, 3204 flow [2022-12-13 03:58:23,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:23,302 INFO L89 Accepts]: Start accepts. Operand has 65 places, 159 transitions, 3204 flow [2022-12-13 03:58:23,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:23,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:23,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 159 transitions, 3204 flow [2022-12-13 03:58:23,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 159 transitions, 3204 flow [2022-12-13 03:58:23,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:23,308 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:23,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:58:23,309 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 159 transitions, 3204 flow [2022-12-13 03:58:23,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:58:23,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:23,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:23,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:58:23,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1298233267, now seen corresponding path program 2 times [2022-12-13 03:58:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:23,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856753521] [2022-12-13 03:58:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:24,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856753521] [2022-12-13 03:58:24,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856753521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:24,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:24,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:58:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256165848] [2022-12-13 03:58:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:24,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:58:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:58:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:58:24,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:24,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 159 transitions, 3204 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:58:24,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:24,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:24,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:25,074 INFO L130 PetriNetUnfolder]: 1779/2880 cut-off events. [2022-12-13 03:58:25,075 INFO L131 PetriNetUnfolder]: For 729/729 co-relation queries the response was YES. [2022-12-13 03:58:25,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31505 conditions, 2880 events. 1779/2880 cut-off events. For 729/729 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15026 event pairs, 390 based on Foata normal form. 1/2620 useless extension candidates. Maximal degree in co-relation 26841. Up to 2880 conditions per place. [2022-12-13 03:58:25,097 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 279 selfloop transitions, 48 changer transitions 11/338 dead transitions. [2022-12-13 03:58:25,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 338 transitions, 7580 flow [2022-12-13 03:58:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 03:58:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 03:58:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-12-13 03:58:25,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-13 03:58:25,099 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2022-12-13 03:58:25,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 338 transitions, 7580 flow [2022-12-13 03:58:25,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 327 transitions, 7329 flow [2022-12-13 03:58:25,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:25,135 INFO L89 Accepts]: Start accepts. Operand has 71 places, 327 transitions, 7329 flow [2022-12-13 03:58:25,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:25,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:25,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 327 transitions, 7329 flow [2022-12-13 03:58:25,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 327 transitions, 7329 flow [2022-12-13 03:58:25,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:25,147 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:25,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:58:25,148 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 327 transitions, 7329 flow [2022-12-13 03:58:25,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:58:25,148 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:25,148 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:58:25,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -283022689, now seen corresponding path program 1 times [2022-12-13 03:58:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:25,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836950647] [2022-12-13 03:58:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:26,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:26,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836950647] [2022-12-13 03:58:26,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836950647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:26,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:26,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:58:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954792834] [2022-12-13 03:58:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:26,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:58:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:26,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:58:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:58:26,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:26,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 327 transitions, 7329 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-13 03:58:26,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:26,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:26,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:28,201 INFO L130 PetriNetUnfolder]: 3356/5559 cut-off events. [2022-12-13 03:58:28,201 INFO L131 PetriNetUnfolder]: For 5796/5796 co-relation queries the response was YES. [2022-12-13 03:58:28,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66906 conditions, 5559 events. 3356/5559 cut-off events. For 5796/5796 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 34450 event pairs, 128 based on Foata normal form. 1/4990 useless extension candidates. Maximal degree in co-relation 55758. Up to 5559 conditions per place. [2022-12-13 03:58:28,318 INFO L137 encePairwiseOnDemand]: 29/42 looper letters, 752 selfloop transitions, 105 changer transitions 15/872 dead transitions. [2022-12-13 03:58:28,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 872 transitions, 21414 flow [2022-12-13 03:58:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:58:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:58:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 183 transitions. [2022-12-13 03:58:28,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33516483516483514 [2022-12-13 03:58:28,320 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2022-12-13 03:58:28,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 872 transitions, 21414 flow [2022-12-13 03:58:28,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 857 transitions, 21042 flow [2022-12-13 03:58:28,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:28,406 INFO L89 Accepts]: Start accepts. Operand has 80 places, 857 transitions, 21042 flow [2022-12-13 03:58:28,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:28,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:28,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 857 transitions, 21042 flow [2022-12-13 03:58:28,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 857 transitions, 21042 flow [2022-12-13 03:58:28,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:28,444 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:28,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 03:58:28,445 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 857 transitions, 21042 flow [2022-12-13 03:58:28,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-13 03:58:28,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:28,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:28,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:58:28,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash -564276185, now seen corresponding path program 3 times [2022-12-13 03:58:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:28,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312259483] [2022-12-13 03:58:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312259483] [2022-12-13 03:58:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312259483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:29,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:29,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:58:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551444256] [2022-12-13 03:58:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:29,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:58:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:58:29,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:58:29,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:29,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 857 transitions, 21042 flow. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-13 03:58:29,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:29,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:29,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:31,824 INFO L130 PetriNetUnfolder]: 3430/5779 cut-off events. [2022-12-13 03:58:31,825 INFO L131 PetriNetUnfolder]: For 5840/5840 co-relation queries the response was YES. [2022-12-13 03:58:31,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75380 conditions, 5779 events. 3430/5779 cut-off events. For 5840/5840 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 36938 event pairs, 164 based on Foata normal form. 1/5205 useless extension candidates. Maximal degree in co-relation 62484. Up to 5779 conditions per place. [2022-12-13 03:58:31,883 INFO L137 encePairwiseOnDemand]: 30/42 looper letters, 860 selfloop transitions, 120 changer transitions 15/995 dead transitions. [2022-12-13 03:58:31,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 995 transitions, 26464 flow [2022-12-13 03:58:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 03:58:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 03:58:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-12-13 03:58:31,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2878787878787879 [2022-12-13 03:58:31,886 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2022-12-13 03:58:31,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 995 transitions, 26464 flow [2022-12-13 03:58:31,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 980 transitions, 26062 flow [2022-12-13 03:58:32,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:32,006 INFO L89 Accepts]: Start accepts. Operand has 87 places, 980 transitions, 26062 flow [2022-12-13 03:58:32,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:32,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:32,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 980 transitions, 26062 flow [2022-12-13 03:58:32,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 980 transitions, 26062 flow [2022-12-13 03:58:32,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:32,056 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:32,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 03:58:32,057 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 980 transitions, 26062 flow [2022-12-13 03:58:32,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-13 03:58:32,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:32,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:32,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 03:58:32,057 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1521557447, now seen corresponding path program 2 times [2022-12-13 03:58:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:32,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619253970] [2022-12-13 03:58:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:32,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619253970] [2022-12-13 03:58:32,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619253970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:32,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:32,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:58:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373850179] [2022-12-13 03:58:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:32,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:58:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:58:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:58:32,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:32,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 980 transitions, 26062 flow. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-13 03:58:32,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:32,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:32,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:35,513 INFO L130 PetriNetUnfolder]: 3434/5870 cut-off events. [2022-12-13 03:58:35,513 INFO L131 PetriNetUnfolder]: For 5854/5854 co-relation queries the response was YES. [2022-12-13 03:58:35,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82457 conditions, 5870 events. 3434/5870 cut-off events. For 5854/5854 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 37869 event pairs, 109 based on Foata normal form. 4/5299 useless extension candidates. Maximal degree in co-relation 67986. Up to 5870 conditions per place. [2022-12-13 03:58:35,562 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 1121 selfloop transitions, 46 changer transitions 42/1209 dead transitions. [2022-12-13 03:58:35,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1209 transitions, 34614 flow [2022-12-13 03:58:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:58:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:58:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-12-13 03:58:35,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-13 03:58:35,564 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2022-12-13 03:58:35,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 1209 transitions, 34614 flow [2022-12-13 03:58:35,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 1167 transitions, 33402 flow [2022-12-13 03:58:35,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:35,659 INFO L89 Accepts]: Start accepts. Operand has 93 places, 1167 transitions, 33402 flow [2022-12-13 03:58:35,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:35,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:35,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 1167 transitions, 33402 flow [2022-12-13 03:58:35,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 1167 transitions, 33402 flow [2022-12-13 03:58:35,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:35,711 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:35,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 03:58:35,712 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 1167 transitions, 33402 flow [2022-12-13 03:58:35,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-13 03:58:35,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:35,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:35,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 03:58:35,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -439387743, now seen corresponding path program 4 times [2022-12-13 03:58:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:35,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607800951] [2022-12-13 03:58:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:36,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:36,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607800951] [2022-12-13 03:58:36,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607800951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:36,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:36,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:58:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741144984] [2022-12-13 03:58:36,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:36,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:58:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:58:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:58:36,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:36,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 1167 transitions, 33402 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:58:36,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:36,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:36,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:38,951 INFO L130 PetriNetUnfolder]: 3712/6440 cut-off events. [2022-12-13 03:58:38,952 INFO L131 PetriNetUnfolder]: For 4517/4517 co-relation queries the response was YES. [2022-12-13 03:58:38,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96909 conditions, 6440 events. 3712/6440 cut-off events. For 4517/4517 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 43111 event pairs, 30 based on Foata normal form. 3/5824 useless extension candidates. Maximal degree in co-relation 78787. Up to 6440 conditions per place. [2022-12-13 03:58:39,025 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 1613 selfloop transitions, 148 changer transitions 51/1812 dead transitions. [2022-12-13 03:58:39,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 1812 transitions, 55266 flow [2022-12-13 03:58:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:58:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:58:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-13 03:58:39,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-13 03:58:39,028 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2022-12-13 03:58:39,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 1812 transitions, 55266 flow [2022-12-13 03:58:39,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 1761 transitions, 53691 flow [2022-12-13 03:58:39,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:39,187 INFO L89 Accepts]: Start accepts. Operand has 98 places, 1761 transitions, 53691 flow [2022-12-13 03:58:39,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:39,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:39,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 1761 transitions, 53691 flow [2022-12-13 03:58:39,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 1761 transitions, 53691 flow [2022-12-13 03:58:39,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:39,281 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:39,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 03:58:39,282 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 1761 transitions, 53691 flow [2022-12-13 03:58:39,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:58:39,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:39,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:39,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 03:58:39,284 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -731317443, now seen corresponding path program 3 times [2022-12-13 03:58:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:39,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164694895] [2022-12-13 03:58:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:39,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:39,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164694895] [2022-12-13 03:58:39,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164694895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:39,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:39,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 03:58:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120022093] [2022-12-13 03:58:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:39,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:58:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:39,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:58:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:58:39,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:39,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 1761 transitions, 53691 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:58:39,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:39,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:39,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:44,621 INFO L130 PetriNetUnfolder]: 4427/7933 cut-off events. [2022-12-13 03:58:44,622 INFO L131 PetriNetUnfolder]: For 3815/3815 co-relation queries the response was YES. [2022-12-13 03:58:44,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127385 conditions, 7933 events. 4427/7933 cut-off events. For 3815/3815 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 57756 event pairs, 14 based on Foata normal form. 1/7227 useless extension candidates. Maximal degree in co-relation 101789. Up to 7933 conditions per place. [2022-12-13 03:58:44,682 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 2356 selfloop transitions, 182 changer transitions 13/2551 dead transitions. [2022-12-13 03:58:44,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 2551 transitions, 83003 flow [2022-12-13 03:58:44,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:58:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:58:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-13 03:58:44,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-13 03:58:44,684 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2022-12-13 03:58:44,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 2551 transitions, 83003 flow [2022-12-13 03:58:44,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 2538 transitions, 82575 flow [2022-12-13 03:58:44,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:44,815 INFO L89 Accepts]: Start accepts. Operand has 105 places, 2538 transitions, 82575 flow [2022-12-13 03:58:44,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:44,849 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:44,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 2538 transitions, 82575 flow [2022-12-13 03:58:44,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 2538 transitions, 82575 flow [2022-12-13 03:58:44,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:44,925 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:44,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 03:58:44,925 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 2538 transitions, 82575 flow [2022-12-13 03:58:44,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:58:44,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:44,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:44,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 03:58:44,926 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1416532759, now seen corresponding path program 5 times [2022-12-13 03:58:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:44,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251842928] [2022-12-13 03:58:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:45,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251842928] [2022-12-13 03:58:45,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251842928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:45,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:45,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:58:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401677446] [2022-12-13 03:58:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:45,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:58:45,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:58:45,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:58:45,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:45,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 2538 transitions, 82575 flow. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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-13 03:58:45,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:45,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:45,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:51,798 INFO L130 PetriNetUnfolder]: 4457/8230 cut-off events. [2022-12-13 03:58:51,798 INFO L131 PetriNetUnfolder]: For 3914/3914 co-relation queries the response was YES. [2022-12-13 03:58:51,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140470 conditions, 8230 events. 4457/8230 cut-off events. For 3914/3914 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 62307 event pairs, 14 based on Foata normal form. 6/7529 useless extension candidates. Maximal degree in co-relation 110158. Up to 8230 conditions per place. [2022-12-13 03:58:51,861 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 2498 selfloop transitions, 226 changer transitions 82/2806 dead transitions. [2022-12-13 03:58:51,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 2806 transitions, 97051 flow [2022-12-13 03:58:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:58:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:58:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-13 03:58:51,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3299319727891156 [2022-12-13 03:58:51,862 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2022-12-13 03:58:51,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 2806 transitions, 97051 flow [2022-12-13 03:58:51,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 2724 transitions, 94155 flow [2022-12-13 03:58:51,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:51,995 INFO L89 Accepts]: Start accepts. Operand has 110 places, 2724 transitions, 94155 flow [2022-12-13 03:58:52,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:52,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:52,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 2724 transitions, 94155 flow [2022-12-13 03:58:52,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 2724 transitions, 94155 flow [2022-12-13 03:58:52,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:52,093 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:52,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 03:58:52,094 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 2724 transitions, 94155 flow [2022-12-13 03:58:52,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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-13 03:58:52,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:52,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:52,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 03:58:52,095 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash -614858441, now seen corresponding path program 6 times [2022-12-13 03:58:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:52,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414911230] [2022-12-13 03:58:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:52,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414911230] [2022-12-13 03:58:52,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414911230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:58:52,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:58:52,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:58:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013439990] [2022-12-13 03:58:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:58:52,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:58:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:58:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:58:52,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:58:52,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 2724 transitions, 94155 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:58:52,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:52,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:58:52,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:59,011 INFO L130 PetriNetUnfolder]: 4432/8223 cut-off events. [2022-12-13 03:58:59,011 INFO L131 PetriNetUnfolder]: For 5420/5420 co-relation queries the response was YES. [2022-12-13 03:58:59,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148562 conditions, 8223 events. 4432/8223 cut-off events. For 5420/5420 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 62341 event pairs, 30 based on Foata normal form. 2/7518 useless extension candidates. Maximal degree in co-relation 114952. Up to 8223 conditions per place. [2022-12-13 03:58:59,074 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 2588 selfloop transitions, 202 changer transitions 23/2813 dead transitions. [2022-12-13 03:58:59,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 2813 transitions, 102882 flow [2022-12-13 03:58:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:58:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:58:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-13 03:58:59,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2022-12-13 03:58:59,076 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2022-12-13 03:58:59,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 2813 transitions, 102882 flow [2022-12-13 03:58:59,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 2790 transitions, 102030 flow [2022-12-13 03:58:59,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:59,230 INFO L89 Accepts]: Start accepts. Operand has 115 places, 2790 transitions, 102030 flow [2022-12-13 03:58:59,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:59,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:59,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 2790 transitions, 102030 flow [2022-12-13 03:58:59,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 2790 transitions, 102030 flow [2022-12-13 03:58:59,360 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:59,367 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:59,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 03:58:59,368 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 2790 transitions, 102030 flow [2022-12-13 03:58:59,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:58:59,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:59,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:59,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 03:58:59,369 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:59,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1477362137, now seen corresponding path program 4 times [2022-12-13 03:58:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:59,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766188905] [2022-12-13 03:58:59,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:00,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766188905] [2022-12-13 03:59:00,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766188905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:00,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:00,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 03:59:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519974786] [2022-12-13 03:59:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:00,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:59:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:59:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:59:00,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:00,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 2790 transitions, 102030 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:59:00,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:00,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:00,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:06,246 INFO L130 PetriNetUnfolder]: 4424/8193 cut-off events. [2022-12-13 03:59:06,246 INFO L131 PetriNetUnfolder]: For 5687/5687 co-relation queries the response was YES. [2022-12-13 03:59:06,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156206 conditions, 8193 events. 4424/8193 cut-off events. For 5687/5687 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 61931 event pairs, 30 based on Foata normal form. 1/7487 useless extension candidates. Maximal degree in co-relation 120968. Up to 8193 conditions per place. [2022-12-13 03:59:06,310 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 2567 selfloop transitions, 209 changer transitions 13/2789 dead transitions. [2022-12-13 03:59:06,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 2789 transitions, 107572 flow [2022-12-13 03:59:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:59:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:59:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2022-12-13 03:59:06,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2022-12-13 03:59:06,312 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places. [2022-12-13 03:59:06,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 2789 transitions, 107572 flow [2022-12-13 03:59:06,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 2776 transitions, 107060 flow [2022-12-13 03:59:06,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:06,452 INFO L89 Accepts]: Start accepts. Operand has 122 places, 2776 transitions, 107060 flow [2022-12-13 03:59:06,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:06,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:06,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 2776 transitions, 107060 flow [2022-12-13 03:59:06,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 2776 transitions, 107060 flow [2022-12-13 03:59:06,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:06,550 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:06,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 03:59:06,551 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 2776 transitions, 107060 flow [2022-12-13 03:59:06,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:59:06,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:06,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:06,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 03:59:06,551 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:06,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:06,552 INFO L85 PathProgramCache]: Analyzing trace with hash 833815973, now seen corresponding path program 7 times [2022-12-13 03:59:06,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:06,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584080625] [2022-12-13 03:59:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:06,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:07,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584080625] [2022-12-13 03:59:07,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584080625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:07,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:07,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:59:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313845864] [2022-12-13 03:59:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:07,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:59:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:07,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:59:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:59:07,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:07,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 2776 transitions, 107060 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:07,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:07,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:07,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:13,387 INFO L130 PetriNetUnfolder]: 4450/8309 cut-off events. [2022-12-13 03:59:13,387 INFO L131 PetriNetUnfolder]: For 5718/5718 co-relation queries the response was YES. [2022-12-13 03:59:13,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166753 conditions, 8309 events. 4450/8309 cut-off events. For 5718/5718 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 63597 event pairs, 26 based on Foata normal form. 3/7605 useless extension candidates. Maximal degree in co-relation 128176. Up to 8309 conditions per place. [2022-12-13 03:59:13,459 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 2608 selfloop transitions, 222 changer transitions 40/2870 dead transitions. [2022-12-13 03:59:13,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 2870 transitions, 116480 flow [2022-12-13 03:59:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:59:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:59:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-13 03:59:13,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-13 03:59:13,461 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2022-12-13 03:59:13,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 2870 transitions, 116480 flow [2022-12-13 03:59:13,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 2830 transitions, 114826 flow [2022-12-13 03:59:13,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:13,621 INFO L89 Accepts]: Start accepts. Operand has 128 places, 2830 transitions, 114826 flow [2022-12-13 03:59:13,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:13,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:13,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 2830 transitions, 114826 flow [2022-12-13 03:59:13,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 2830 transitions, 114826 flow [2022-12-13 03:59:13,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:13,767 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:13,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 03:59:13,770 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 2830 transitions, 114826 flow [2022-12-13 03:59:13,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:13,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:13,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:13,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 03:59:13,771 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1829805983, now seen corresponding path program 8 times [2022-12-13 03:59:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:13,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772780885] [2022-12-13 03:59:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:14,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772780885] [2022-12-13 03:59:14,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772780885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:14,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:14,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:59:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443649218] [2022-12-13 03:59:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:14,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:59:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:59:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:59:14,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:14,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 2830 transitions, 114826 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:14,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:14,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:14,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:21,272 INFO L130 PetriNetUnfolder]: 4423/8247 cut-off events. [2022-12-13 03:59:21,272 INFO L131 PetriNetUnfolder]: For 5710/5710 co-relation queries the response was YES. [2022-12-13 03:59:21,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173740 conditions, 8247 events. 4423/8247 cut-off events. For 5710/5710 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 63056 event pairs, 30 based on Foata normal form. 3/7543 useless extension candidates. Maximal degree in co-relation 134196. Up to 8247 conditions per place. [2022-12-13 03:59:21,341 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 2546 selfloop transitions, 216 changer transitions 65/2827 dead transitions. [2022-12-13 03:59:21,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 2827 transitions, 120360 flow [2022-12-13 03:59:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:59:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:59:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-12-13 03:59:21,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3273809523809524 [2022-12-13 03:59:21,343 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2022-12-13 03:59:21,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 2827 transitions, 120360 flow [2022-12-13 03:59:21,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 2762 transitions, 117552 flow [2022-12-13 03:59:21,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:21,516 INFO L89 Accepts]: Start accepts. Operand has 132 places, 2762 transitions, 117552 flow [2022-12-13 03:59:21,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:21,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:21,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 2762 transitions, 117552 flow [2022-12-13 03:59:21,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 2762 transitions, 117552 flow [2022-12-13 03:59:21,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:21,629 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:21,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 03:59:21,630 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 2762 transitions, 117552 flow [2022-12-13 03:59:21,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:21,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:21,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:21,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 03:59:21,630 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash -871567469, now seen corresponding path program 5 times [2022-12-13 03:59:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:21,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427908745] [2022-12-13 03:59:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:22,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:22,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427908745] [2022-12-13 03:59:22,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427908745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:22,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:22,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 03:59:22,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284512608] [2022-12-13 03:59:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:22,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:59:22,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:22,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:59:22,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:59:22,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:22,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 2762 transitions, 117552 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:59:22,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:22,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:29,390 INFO L130 PetriNetUnfolder]: 4372/8176 cut-off events. [2022-12-13 03:59:29,390 INFO L131 PetriNetUnfolder]: For 5807/5807 co-relation queries the response was YES. [2022-12-13 03:59:29,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180394 conditions, 8176 events. 4372/8176 cut-off events. For 5807/5807 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 62541 event pairs, 30 based on Foata normal form. 1/7480 useless extension candidates. Maximal degree in co-relation 139794. Up to 8176 conditions per place. [2022-12-13 03:59:29,458 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 2551 selfloop transitions, 206 changer transitions 21/2778 dead transitions. [2022-12-13 03:59:29,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 2778 transitions, 123795 flow [2022-12-13 03:59:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:59:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:59:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-12-13 03:59:29,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30687830687830686 [2022-12-13 03:59:29,460 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2022-12-13 03:59:29,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 2778 transitions, 123795 flow [2022-12-13 03:59:29,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 2757 transitions, 122850 flow [2022-12-13 03:59:29,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:29,631 INFO L89 Accepts]: Start accepts. Operand has 137 places, 2757 transitions, 122850 flow [2022-12-13 03:59:29,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:29,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:29,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 2757 transitions, 122850 flow [2022-12-13 03:59:29,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 2757 transitions, 122850 flow [2022-12-13 03:59:29,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:29,740 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:29,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 03:59:29,740 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 2757 transitions, 122850 flow [2022-12-13 03:59:29,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:59:29,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:29,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 03:59:29,741 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2027772501, now seen corresponding path program 6 times [2022-12-13 03:59:29,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:29,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409959009] [2022-12-13 03:59:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:30,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409959009] [2022-12-13 03:59:30,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409959009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:30,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:30,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 03:59:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167030605] [2022-12-13 03:59:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:59:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:59:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:59:30,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:30,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 2757 transitions, 122850 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:59:30,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:30,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:37,383 INFO L130 PetriNetUnfolder]: 4353/8133 cut-off events. [2022-12-13 03:59:37,383 INFO L131 PetriNetUnfolder]: For 5599/5599 co-relation queries the response was YES. [2022-12-13 03:59:37,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187572 conditions, 8133 events. 4353/8133 cut-off events. For 5599/5599 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 62062 event pairs, 30 based on Foata normal form. 1/7437 useless extension candidates. Maximal degree in co-relation 145752. Up to 8133 conditions per place. [2022-12-13 03:59:37,456 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 2522 selfloop transitions, 209 changer transitions 25/2756 dead transitions. [2022-12-13 03:59:37,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 2756 transitions, 128318 flow [2022-12-13 03:59:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:59:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:59:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2022-12-13 03:59:37,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32275132275132273 [2022-12-13 03:59:37,457 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2022-12-13 03:59:37,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 2756 transitions, 128318 flow [2022-12-13 03:59:37,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 2731 transitions, 127156 flow [2022-12-13 03:59:37,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:37,625 INFO L89 Accepts]: Start accepts. Operand has 142 places, 2731 transitions, 127156 flow [2022-12-13 03:59:37,666 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:37,666 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:37,666 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 2731 transitions, 127156 flow [2022-12-13 03:59:37,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 2731 transitions, 127156 flow [2022-12-13 03:59:37,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:37,734 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:37,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 03:59:37,735 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 2731 transitions, 127156 flow [2022-12-13 03:59:37,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:59:37,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:37,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:37,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 03:59:37,735 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1282805533, now seen corresponding path program 9 times [2022-12-13 03:59:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700839945] [2022-12-13 03:59:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:38,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:38,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700839945] [2022-12-13 03:59:38,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700839945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:38,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:38,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:59:38,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407248520] [2022-12-13 03:59:38,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:38,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:59:38,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:59:38,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:59:38,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:38,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 2731 transitions, 127156 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:38,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:38,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:38,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:45,074 INFO L130 PetriNetUnfolder]: 4406/8296 cut-off events. [2022-12-13 03:59:45,075 INFO L131 PetriNetUnfolder]: For 5279/5279 co-relation queries the response was YES. [2022-12-13 03:59:45,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199699 conditions, 8296 events. 4406/8296 cut-off events. For 5279/5279 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 64108 event pairs, 26 based on Foata normal form. 2/7605 useless extension candidates. Maximal degree in co-relation 154316. Up to 8296 conditions per place. [2022-12-13 03:59:45,150 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 2619 selfloop transitions, 242 changer transitions 27/2888 dead transitions. [2022-12-13 03:59:45,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 2888 transitions, 140304 flow [2022-12-13 03:59:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:59:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:59:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2022-12-13 03:59:45,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-13 03:59:45,152 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-13 03:59:45,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 2888 transitions, 140304 flow [2022-12-13 03:59:45,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 2861 transitions, 138972 flow [2022-12-13 03:59:45,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:45,325 INFO L89 Accepts]: Start accepts. Operand has 148 places, 2861 transitions, 138972 flow [2022-12-13 03:59:45,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:45,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:45,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 2861 transitions, 138972 flow [2022-12-13 03:59:45,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 2861 transitions, 138972 flow [2022-12-13 03:59:45,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:45,449 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:45,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 03:59:45,450 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 2861 transitions, 138972 flow [2022-12-13 03:59:45,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:45,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:45,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:45,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 03:59:45,451 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash 818592713, now seen corresponding path program 10 times [2022-12-13 03:59:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:45,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830318692] [2022-12-13 03:59:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:46,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830318692] [2022-12-13 03:59:46,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830318692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:46,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:46,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:59:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402894287] [2022-12-13 03:59:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:46,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:59:46,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:59:46,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:59:46,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:46,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 2861 transitions, 138972 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:46,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:46,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:46,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:53,489 INFO L130 PetriNetUnfolder]: 4405/8388 cut-off events. [2022-12-13 03:59:53,490 INFO L131 PetriNetUnfolder]: For 5512/5512 co-relation queries the response was YES. [2022-12-13 03:59:53,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210324 conditions, 8388 events. 4405/8388 cut-off events. For 5512/5512 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 65698 event pairs, 26 based on Foata normal form. 2/7697 useless extension candidates. Maximal degree in co-relation 161896. Up to 8388 conditions per place. [2022-12-13 03:59:53,565 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 2698 selfloop transitions, 244 changer transitions 27/2969 dead transitions. [2022-12-13 03:59:53,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 2969 transitions, 150208 flow [2022-12-13 03:59:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:59:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:59:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-12-13 03:59:53,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2022-12-13 03:59:53,566 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2022-12-13 03:59:53,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 2969 transitions, 150208 flow [2022-12-13 03:59:53,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 2942 transitions, 148822 flow [2022-12-13 03:59:53,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:53,747 INFO L89 Accepts]: Start accepts. Operand has 154 places, 2942 transitions, 148822 flow [2022-12-13 03:59:53,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:53,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:53,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 2942 transitions, 148822 flow [2022-12-13 03:59:53,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 2942 transitions, 148822 flow [2022-12-13 03:59:53,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:53,891 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:53,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 03:59:53,892 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 2942 transitions, 148822 flow [2022-12-13 03:59:53,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 03:59:53,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:53,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:53,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 03:59:53,892 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1320598799, now seen corresponding path program 7 times [2022-12-13 03:59:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:53,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657104237] [2022-12-13 03:59:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:54,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:54,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657104237] [2022-12-13 03:59:54,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657104237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:59:54,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:59:54,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 03:59:54,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158441520] [2022-12-13 03:59:54,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:59:54,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:59:54,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:54,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:59:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:59:54,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:59:54,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 2942 transitions, 148822 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 03:59:54,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:54,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:59:54,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:00:02,531 INFO L130 PetriNetUnfolder]: 4509/8640 cut-off events. [2022-12-13 04:00:02,531 INFO L131 PetriNetUnfolder]: For 5664/5664 co-relation queries the response was YES. [2022-12-13 04:00:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225304 conditions, 8640 events. 4509/8640 cut-off events. For 5664/5664 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 68439 event pairs, 26 based on Foata normal form. 1/7928 useless extension candidates. Maximal degree in co-relation 171782. Up to 8640 conditions per place. [2022-12-13 04:00:02,609 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 2818 selfloop transitions, 241 changer transitions 13/3072 dead transitions. [2022-12-13 04:00:02,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 3072 transitions, 161571 flow [2022-12-13 04:00:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:00:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:00:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-13 04:00:02,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328042328042328 [2022-12-13 04:00:02,611 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2022-12-13 04:00:02,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 3072 transitions, 161571 flow [2022-12-13 04:00:02,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 3059 transitions, 160883 flow [2022-12-13 04:00:02,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:00:02,791 INFO L89 Accepts]: Start accepts. Operand has 161 places, 3059 transitions, 160883 flow [2022-12-13 04:00:02,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:00:02,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:00:02,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 3059 transitions, 160883 flow [2022-12-13 04:00:02,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 3059 transitions, 160883 flow [2022-12-13 04:00:02,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:00:02,926 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:00:02,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 04:00:02,927 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 3059 transitions, 160883 flow [2022-12-13 04:00:02,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 04:00:02,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:00:02,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:00:02,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 04:00:02,927 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:00:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:00:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 574554105, now seen corresponding path program 8 times [2022-12-13 04:00:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:00:02,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537517529] [2022-12-13 04:00:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:00:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:00:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:00:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:00:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:00:03,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537517529] [2022-12-13 04:00:03,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537517529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:00:03,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:00:03,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:00:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226228737] [2022-12-13 04:00:03,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:00:03,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:00:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:00:03,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:00:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:00:03,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:00:03,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 3059 transitions, 160883 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 04:00:03,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:00:03,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:00:03,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:00:11,915 INFO L130 PetriNetUnfolder]: 4489/8600 cut-off events. [2022-12-13 04:00:11,915 INFO L131 PetriNetUnfolder]: For 5868/5868 co-relation queries the response was YES. [2022-12-13 04:00:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232859 conditions, 8600 events. 4489/8600 cut-off events. For 5868/5868 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 68071 event pairs, 30 based on Foata normal form. 1/7888 useless extension candidates. Maximal degree in co-relation 177953. Up to 8600 conditions per place. [2022-12-13 04:00:12,001 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 2797 selfloop transitions, 244 changer transitions 17/3058 dead transitions. [2022-12-13 04:00:12,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 3058 transitions, 166947 flow [2022-12-13 04:00:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:00:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:00:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2022-12-13 04:00:12,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3253968253968254 [2022-12-13 04:00:12,003 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2022-12-13 04:00:12,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 3058 transitions, 166947 flow [2022-12-13 04:00:12,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 3041 transitions, 166005 flow [2022-12-13 04:00:12,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:00:12,336 INFO L89 Accepts]: Start accepts. Operand has 167 places, 3041 transitions, 166005 flow [2022-12-13 04:00:12,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:00:12,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:00:12,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 3041 transitions, 166005 flow [2022-12-13 04:00:12,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 3041 transitions, 166005 flow [2022-12-13 04:00:12,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:00:12,457 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:00:12,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 04:00:12,458 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 3041 transitions, 166005 flow [2022-12-13 04:00:12,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 04:00:12,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:00:12,459 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:00:12,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 04:00:12,459 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:00:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:00:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1180348773, now seen corresponding path program 9 times [2022-12-13 04:00:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:00:12,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798360658] [2022-12-13 04:00:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:00:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:00:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:00:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:00:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:00:13,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798360658] [2022-12-13 04:00:13,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798360658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:00:13,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:00:13,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 04:00:13,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926709824] [2022-12-13 04:00:13,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:00:13,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:00:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:00:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:00:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:00:13,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:00:13,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 3041 transitions, 166005 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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-13 04:00:13,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:00:13,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:00:13,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:00:32,800 INFO L130 PetriNetUnfolder]: 8935/17137 cut-off events. [2022-12-13 04:00:32,800 INFO L131 PetriNetUnfolder]: For 11284/11284 co-relation queries the response was YES. [2022-12-13 04:00:32,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481093 conditions, 17137 events. 8935/17137 cut-off events. For 11284/11284 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 152003 event pairs, 60 based on Foata normal form. 2/15713 useless extension candidates. Maximal degree in co-relation 184224. Up to 17137 conditions per place. [2022-12-13 04:00:33,000 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 5553 selfloop transitions, 484 changer transitions 42/6079 dead transitions. [2022-12-13 04:00:33,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 6079 transitions, 344006 flow [2022-12-13 04:00:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:00:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:00:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 215 transitions. [2022-12-13 04:00:33,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3011204481792717 [2022-12-13 04:00:33,001 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2022-12-13 04:00:33,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 6079 transitions, 344006 flow [2022-12-13 04:00:33,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 6037 transitions, 341612 flow [2022-12-13 04:00:33,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:00:33,502 INFO L89 Accepts]: Start accepts. Operand has 177 places, 6037 transitions, 341612 flow [2022-12-13 04:00:33,617 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:00:33,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:00:33,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 6037 transitions, 341612 flow [2022-12-13 04:00:33,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 6037 transitions, 341612 flow [2022-12-13 04:00:33,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:00:33,822 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:00:33,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-13 04:00:33,823 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 6037 transitions, 341612 flow [2022-12-13 04:00:33,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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-13 04:00:33,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:00:33,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:00:33,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 04:00:33,823 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:00:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:00:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 562262101, now seen corresponding path program 10 times [2022-12-13 04:00:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:00:33,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186045873] [2022-12-13 04:00:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:00:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:00:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:00:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:00:34,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:00:34,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186045873] [2022-12-13 04:00:34,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186045873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:00:34,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:00:34,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:00:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862812715] [2022-12-13 04:00:34,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:00:34,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:00:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:00:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:00:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:00:34,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:00:34,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 6037 transitions, 341612 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 04:00:34,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:00:34,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:00:34,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:01:24,515 INFO L130 PetriNetUnfolder]: 9353/18159 cut-off events. [2022-12-13 04:01:24,515 INFO L131 PetriNetUnfolder]: For 11430/11430 co-relation queries the response was YES. [2022-12-13 04:01:24,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528045 conditions, 18159 events. 9353/18159 cut-off events. For 11430/11430 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 164593 event pairs, 52 based on Foata normal form. 2/16647 useless extension candidates. Maximal degree in co-relation 200363. Up to 18159 conditions per place. [2022-12-13 04:01:24,695 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 6047 selfloop transitions, 544 changer transitions 26/6617 dead transitions. [2022-12-13 04:01:24,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 6617 transitions, 387758 flow [2022-12-13 04:01:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:01:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:01:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2022-12-13 04:01:24,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3412698412698413 [2022-12-13 04:01:24,697 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2022-12-13 04:01:24,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 6617 transitions, 387758 flow [2022-12-13 04:01:24,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 6591 transitions, 386226 flow [2022-12-13 04:01:25,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:01:25,168 INFO L89 Accepts]: Start accepts. Operand has 184 places, 6591 transitions, 386226 flow [2022-12-13 04:01:25,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:01:25,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:01:25,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 6591 transitions, 386226 flow [2022-12-13 04:01:25,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 6591 transitions, 386226 flow [2022-12-13 04:01:25,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:01:25,682 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:01:25,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 517 [2022-12-13 04:01:25,686 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 6591 transitions, 386226 flow [2022-12-13 04:01:25,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 04:01:25,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:01:25,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:01:25,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 04:01:25,686 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:01:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:01:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1620267031, now seen corresponding path program 11 times [2022-12-13 04:01:25,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:01:25,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463652333] [2022-12-13 04:01:25,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:01:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:01:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:01:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:01:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:01:26,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463652333] [2022-12-13 04:01:26,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463652333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:01:26,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:01:26,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:01:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531723955] [2022-12-13 04:01:26,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:01:26,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:01:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:01:26,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:01:26,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:01:26,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:01:26,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 6591 transitions, 386226 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:01:26,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:01:26,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:01:26,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:02:21,233 INFO L130 PetriNetUnfolder]: 9313/18075 cut-off events. [2022-12-13 04:02:21,233 INFO L131 PetriNetUnfolder]: For 9851/9851 co-relation queries the response was YES. [2022-12-13 04:02:21,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543673 conditions, 18075 events. 9313/18075 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 163908 event pairs, 36 based on Foata normal form. 6/16567 useless extension candidates. Maximal degree in co-relation 216196. Up to 18075 conditions per place. [2022-12-13 04:02:21,424 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 5925 selfloop transitions, 592 changer transitions 68/6585 dead transitions. [2022-12-13 04:02:21,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 6585 transitions, 399048 flow [2022-12-13 04:02:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:02:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:02:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-12-13 04:02:21,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-13 04:02:21,426 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2022-12-13 04:02:21,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 6585 transitions, 399048 flow [2022-12-13 04:02:21,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 6517 transitions, 394896 flow [2022-12-13 04:02:21,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:02:21,932 INFO L89 Accepts]: Start accepts. Operand has 189 places, 6517 transitions, 394896 flow [2022-12-13 04:02:22,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:02:22,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:02:22,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 6517 transitions, 394896 flow [2022-12-13 04:02:22,442 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 6517 transitions, 394896 flow [2022-12-13 04:02:22,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:02:22,454 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:02:22,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 523 [2022-12-13 04:02:22,455 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 6517 transitions, 394896 flow [2022-12-13 04:02:22,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:02:22,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:02:22,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:02:22,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 04:02:22,455 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:02:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:02:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1630980539, now seen corresponding path program 12 times [2022-12-13 04:02:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:02:22,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779245418] [2022-12-13 04:02:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:02:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:02:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:02:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:02:23,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:02:23,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779245418] [2022-12-13 04:02:23,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779245418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:02:23,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:02:23,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:02:23,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153881182] [2022-12-13 04:02:23,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:02:23,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:02:23,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:02:23,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:02:23,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:02:23,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:02:23,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 6517 transitions, 394896 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:02:23,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:02:23,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:02:23,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:03:20,673 INFO L130 PetriNetUnfolder]: 9289/17987 cut-off events. [2022-12-13 04:03:20,674 INFO L131 PetriNetUnfolder]: For 9448/9448 co-relation queries the response was YES. [2022-12-13 04:03:20,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558991 conditions, 17987 events. 9289/17987 cut-off events. For 9448/9448 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 162477 event pairs, 44 based on Foata normal form. 4/16477 useless extension candidates. Maximal degree in co-relation 222358. Up to 17987 conditions per place. [2022-12-13 04:03:20,866 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 5951 selfloop transitions, 508 changer transitions 54/6513 dead transitions. [2022-12-13 04:03:20,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 6513 transitions, 407682 flow [2022-12-13 04:03:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:03:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:03:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-12-13 04:03:20,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-13 04:03:20,867 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2022-12-13 04:03:20,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 6513 transitions, 407682 flow [2022-12-13 04:03:21,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 6459 transitions, 404286 flow [2022-12-13 04:03:21,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:03:21,485 INFO L89 Accepts]: Start accepts. Operand has 193 places, 6459 transitions, 404286 flow [2022-12-13 04:03:21,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:03:21,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:03:21,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 6459 transitions, 404286 flow [2022-12-13 04:03:21,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 6459 transitions, 404286 flow [2022-12-13 04:03:21,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:03:21,988 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:03:21,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 503 [2022-12-13 04:03:21,988 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 6459 transitions, 404286 flow [2022-12-13 04:03:21,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:03:21,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:03:21,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:03:21,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 04:03:21,989 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:03:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:03:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash -183782593, now seen corresponding path program 11 times [2022-12-13 04:03:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:03:21,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771499789] [2022-12-13 04:03:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:03:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:03:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:03:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:03:22,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:03:22,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771499789] [2022-12-13 04:03:22,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771499789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:03:22,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:03:22,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:03:22,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228882604] [2022-12-13 04:03:22,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:03:22,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:03:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:03:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:03:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:03:22,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:03:22,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 6459 transitions, 404286 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 04:03:22,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:03:22,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:03:22,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:04:23,860 INFO L130 PetriNetUnfolder]: 9271/17997 cut-off events. [2022-12-13 04:04:23,860 INFO L131 PetriNetUnfolder]: For 8395/8395 co-relation queries the response was YES. [2022-12-13 04:04:23,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577311 conditions, 17997 events. 9271/17997 cut-off events. For 8395/8395 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 163215 event pairs, 24 based on Foata normal form. 2/16491 useless extension candidates. Maximal degree in co-relation 229264. Up to 17997 conditions per place. [2022-12-13 04:04:24,049 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 5961 selfloop transitions, 534 changer transitions 34/6529 dead transitions. [2022-12-13 04:04:24,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 6529 transitions, 421774 flow [2022-12-13 04:04:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:04:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:04:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-13 04:04:24,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3386243386243386 [2022-12-13 04:04:24,051 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2022-12-13 04:04:24,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 6529 transitions, 421774 flow [2022-12-13 04:04:24,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 6495 transitions, 419550 flow [2022-12-13 04:04:24,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:04:24,551 INFO L89 Accepts]: Start accepts. Operand has 200 places, 6495 transitions, 419550 flow [2022-12-13 04:04:24,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:04:24,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:04:24,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 6495 transitions, 419550 flow [2022-12-13 04:04:25,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 6495 transitions, 419550 flow [2022-12-13 04:04:25,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:04:25,067 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:04:25,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 518 [2022-12-13 04:04:25,068 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 6495 transitions, 419550 flow [2022-12-13 04:04:25,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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-13 04:04:25,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:04:25,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:04:25,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 04:04:25,069 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:04:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:04:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -405474662, now seen corresponding path program 1 times [2022-12-13 04:04:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:04:25,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139693956] [2022-12-13 04:04:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:04:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:04:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:04:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:04:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:04:25,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139693956] [2022-12-13 04:04:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139693956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:04:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:04:25,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:04:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582112869] [2022-12-13 04:04:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:04:25,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:04:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:04:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:04:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:04:25,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:04:25,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 6495 transitions, 419550 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:04:25,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:04:25,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:04:25,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:05:46,084 INFO L130 PetriNetUnfolder]: 11341/23547 cut-off events. [2022-12-13 04:05:46,085 INFO L131 PetriNetUnfolder]: For 12406/12406 co-relation queries the response was YES. [2022-12-13 04:05:46,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779581 conditions, 23547 events. 11341/23547 cut-off events. For 12406/12406 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 238094 event pairs, 56 based on Foata normal form. 4/21995 useless extension candidates. Maximal degree in co-relation 291066. Up to 23547 conditions per place. [2022-12-13 04:05:46,503 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 8711 selfloop transitions, 676 changer transitions 74/9461 dead transitions. [2022-12-13 04:05:46,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 9461 transitions, 630666 flow [2022-12-13 04:05:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:05:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:05:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-13 04:05:46,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-13 04:05:46,506 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2022-12-13 04:05:46,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 9461 transitions, 630666 flow [2022-12-13 04:05:46,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 9387 transitions, 625680 flow [2022-12-13 04:05:47,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:05:47,204 INFO L89 Accepts]: Start accepts. Operand has 206 places, 9387 transitions, 625680 flow [2022-12-13 04:05:47,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:05:47,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:05:47,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 9387 transitions, 625680 flow [2022-12-13 04:05:48,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 9387 transitions, 625680 flow [2022-12-13 04:05:48,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:05:48,037 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:05:48,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 834 [2022-12-13 04:05:48,038 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 9387 transitions, 625680 flow [2022-12-13 04:05:48,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:05:48,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:05:48,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:05:48,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 04:05:48,038 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:05:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:05:48,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2016171753, now seen corresponding path program 13 times [2022-12-13 04:05:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:05:48,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338540907] [2022-12-13 04:05:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:05:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:05:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:05:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:05:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:05:48,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338540907] [2022-12-13 04:05:48,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338540907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:05:48,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:05:48,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:05:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918342402] [2022-12-13 04:05:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:05:48,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:05:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:05:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:05:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:05:48,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:05:48,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 9387 transitions, 625680 flow. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:05:48,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:05:48,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:05:48,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:07:50,690 INFO L130 PetriNetUnfolder]: 11243/23387 cut-off events. [2022-12-13 04:07:50,690 INFO L131 PetriNetUnfolder]: For 9544/9544 co-relation queries the response was YES. [2022-12-13 04:07:50,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797641 conditions, 23387 events. 11243/23387 cut-off events. For 9544/9544 co-relation queries the response was YES. Maximal size of possible extension queue 1435. Compared 236852 event pairs, 36 based on Foata normal form. 12/21843 useless extension candidates. Maximal degree in co-relation 312641. Up to 23387 conditions per place. [2022-12-13 04:07:50,962 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 8299 selfloop transitions, 892 changer transitions 184/9375 dead transitions. [2022-12-13 04:07:50,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 9375 transitions, 643638 flow [2022-12-13 04:07:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:07:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:07:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-12-13 04:07:50,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-13 04:07:50,964 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2022-12-13 04:07:50,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 9375 transitions, 643638 flow [2022-12-13 04:07:51,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 9191 transitions, 630910 flow [2022-12-13 04:07:51,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:07:51,811 INFO L89 Accepts]: Start accepts. Operand has 211 places, 9191 transitions, 630910 flow [2022-12-13 04:07:52,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:07:52,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:07:52,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 9191 transitions, 630910 flow [2022-12-13 04:07:52,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 9191 transitions, 630910 flow [2022-12-13 04:07:52,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:07:52,515 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:07:52,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 706 [2022-12-13 04:07:52,516 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 9191 transitions, 630910 flow [2022-12-13 04:07:52,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 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-13 04:07:52,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:07:52,516 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:07:52,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 04:07:52,516 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:07:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:07:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1306808388, now seen corresponding path program 2 times [2022-12-13 04:07:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:07:52,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444776047] [2022-12-13 04:07:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:07:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:07:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:07:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:07:53,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:07:53,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444776047] [2022-12-13 04:07:53,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444776047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:07:53,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:07:53,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 04:07:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354963783] [2022-12-13 04:07:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:07:53,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 04:07:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:07:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 04:07:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 04:07:53,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:07:53,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 9191 transitions, 630910 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-13 04:07:53,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:07:53,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:07:53,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 04:11:20,403 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:11:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 04:11:20,489 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 04:11:20,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 04:11:20,490 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/42 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 1418677 conditions, 40447 events (21266/40446 cut-off events. For 17935/17935 co-relation queries the response was YES. Maximal size of possible extension queue 2959. Compared 430142 event pairs, 38 based on Foata normal form. 0/38691 useless extension candidates. Maximal degree in co-relation 598224. Up to 40446 conditions per place.). [2022-12-13 04:11:20,491 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 04:11:20,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 04:11:20,492 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 04:11:20,493 INFO L445 BasicCegarLoop]: Path program histogram: [13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:20,497 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:11:20,498 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:11:20,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:11:20 BasicIcfg [2022-12-13 04:11:20,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:11:20,502 INFO L158 Benchmark]: Toolchain (without parser) took 806727.55ms. Allocated memory was 196.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 171.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-12-13 04:11:20,502 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:11:20,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.40ms. Allocated memory is still 196.1MB. Free memory was 171.9MB in the beginning and 159.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 04:11:20,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.54ms. Allocated memory is still 196.1MB. Free memory was 159.2MB in the beginning and 155.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 04:11:20,503 INFO L158 Benchmark]: Boogie Preprocessor took 52.27ms. Allocated memory is still 196.1MB. Free memory was 155.5MB in the beginning and 153.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:11:20,504 INFO L158 Benchmark]: RCFGBuilder took 876.52ms. Allocated memory is still 196.1MB. Free memory was 152.9MB in the beginning and 119.9MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 04:11:20,504 INFO L158 Benchmark]: TraceAbstraction took 805461.98ms. Allocated memory was 196.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 118.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-12-13 04:11:20,505 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.40ms. Allocated memory is still 196.1MB. Free memory was 171.9MB in the beginning and 159.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.54ms. Allocated memory is still 196.1MB. Free memory was 159.2MB in the beginning and 155.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.27ms. Allocated memory is still 196.1MB. Free memory was 155.5MB in the beginning and 153.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 876.52ms. Allocated memory is still 196.1MB. Free memory was 152.9MB in the beginning and 119.9MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 805461.98ms. Allocated memory was 196.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 118.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.7s, 439 PlacesBefore, 42 PlacesAfterwards, 470 TransitionsBefore, 42 TransitionsAfterwards, 17280 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 266 TrivialYvCompositions, 131 ConcurrentYvCompositions, 31 ChoiceCompositions, 429 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 11492, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11567, independent: 11492, independent conditional: 0, independent unconditional: 11492, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10220, independent: 10175, independent conditional: 0, independent unconditional: 10175, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10220, independent: 10175, independent conditional: 0, independent unconditional: 10175, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11567, independent: 1317, independent conditional: 0, independent unconditional: 1317, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 10220, unknown conditional: 0, unknown unconditional: 10220] , Statistics on independence cache: Total cache size (in pairs): 20762, Positive cache size: 20717, Positive conditional cache size: 0, Positive unconditional cache size: 20717, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 44 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 48 PlacesBefore, 47 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 50 PlacesBefore, 49 PlacesAfterwards, 76 TransitionsBefore, 75 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 51 PlacesAfterwards, 76 TransitionsBefore, 75 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 54 PlacesBefore, 53 PlacesAfterwards, 76 TransitionsBefore, 75 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 57 PlacesBefore, 56 PlacesAfterwards, 76 TransitionsBefore, 75 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 59 PlacesBefore, 58 PlacesAfterwards, 76 TransitionsBefore, 75 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 159 TransitionsBefore, 159 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 327 TransitionsBefore, 327 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 857 TransitionsBefore, 857 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 980 TransitionsBefore, 980 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 1167 TransitionsBefore, 1167 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 1761 TransitionsBefore, 1761 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 2538 TransitionsBefore, 2538 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 2724 TransitionsBefore, 2724 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 2790 TransitionsBefore, 2790 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 122 PlacesBefore, 122 PlacesAfterwards, 2776 TransitionsBefore, 2776 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 128 PlacesBefore, 128 PlacesAfterwards, 2830 TransitionsBefore, 2830 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 132 PlacesBefore, 132 PlacesAfterwards, 2762 TransitionsBefore, 2762 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 137 PlacesBefore, 137 PlacesAfterwards, 2757 TransitionsBefore, 2757 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 142 PlacesBefore, 142 PlacesAfterwards, 2731 TransitionsBefore, 2731 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 148 PlacesBefore, 148 PlacesAfterwards, 2861 TransitionsBefore, 2861 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 154 PlacesBefore, 154 PlacesAfterwards, 2942 TransitionsBefore, 2942 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 161 PlacesBefore, 161 PlacesAfterwards, 3059 TransitionsBefore, 3059 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 167 PlacesBefore, 167 PlacesAfterwards, 3041 TransitionsBefore, 3041 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 177 PlacesBefore, 177 PlacesAfterwards, 6037 TransitionsBefore, 6037 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 184 PlacesBefore, 184 PlacesAfterwards, 6591 TransitionsBefore, 6591 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 189 PlacesBefore, 189 PlacesAfterwards, 6517 TransitionsBefore, 6517 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 193 PlacesBefore, 193 PlacesAfterwards, 6459 TransitionsBefore, 6459 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 200 PlacesBefore, 200 PlacesAfterwards, 6495 TransitionsBefore, 6495 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 206 PlacesBefore, 206 PlacesAfterwards, 9387 TransitionsBefore, 9387 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 211 PlacesBefore, 211 PlacesAfterwards, 9191 TransitionsBefore, 9191 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): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/42 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 1418677 conditions, 40447 events (21266/40446 cut-off events. For 17935/17935 co-relation queries the response was YES. Maximal size of possible extension queue 2959. Compared 430142 event pairs, 38 based on Foata normal form. 0/38691 useless extension candidates. Maximal degree in co-relation 598224. Up to 40446 conditions per place.). - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/42 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 1418677 conditions, 40447 events (21266/40446 cut-off events. For 17935/17935 co-relation queries the response was YES. Maximal size of possible extension queue 2959. Compared 430142 event pairs, 38 based on Foata normal form. 0/38691 useless extension candidates. Maximal degree in co-relation 598224. Up to 40446 conditions per place.). - TimeoutResultAtElement [Line: 103]: 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 (12states, 0/42 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 1418677 conditions, 40447 events (21266/40446 cut-off events. For 17935/17935 co-relation queries the response was YES. Maximal size of possible extension queue 2959. Compared 430142 event pairs, 38 based on Foata normal form. 0/38691 useless extension candidates. Maximal degree in co-relation 598224. Up to 40446 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 0/42 universal loopers) in iteration 34,while PetriNetUnfolder was constructing finite prefix that currently has 1418677 conditions, 40447 events (21266/40446 cut-off events. For 17935/17935 co-relation queries the response was YES. Maximal size of possible extension queue 2959. Compared 430142 event pairs, 38 based on Foata normal form. 0/38691 useless extension candidates. Maximal degree in co-relation 598224. Up to 40446 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 581 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 805.3s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 752.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2722 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2722 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16239 IncrementalHoareTripleChecker+Invalid, 16295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 22 mSDtfsCounter, 16239 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=630910occurred in iteration=33, InterpolantAutomatonStates: 259, 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.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1017 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 10068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 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